./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-0.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f190a6c4b0edbc49af141a983db7689f2287405b384242554734ee34095f2f5c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:13:07,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:13:07,322 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:13:07,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:13:07,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:13:07,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:13:07,359 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:13:07,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:13:07,360 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:13:07,361 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:13:07,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:13:07,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:13:07,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:13:07,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:13:07,364 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:13:07,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:13:07,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:13:07,365 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:13:07,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:13:07,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:13:07,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:13:07,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:13:07,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:13:07,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:13:07,371 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:13:07,371 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:13:07,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:13:07,372 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:13:07,372 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:13:07,372 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:13:07,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:13:07,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:13:07,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:13:07,373 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:13:07,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:13:07,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:13:07,374 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:13:07,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:13:07,377 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:13:07,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:13:07,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:13:07,378 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:13:07,378 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f190a6c4b0edbc49af141a983db7689f2287405b384242554734ee34095f2f5c [2024-10-11 13:13:07,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:13:07,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:13:07,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:13:07,674 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:13:07,676 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:13:07,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-0.i [2024-10-11 13:13:09,212 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:13:09,419 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:13:09,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-0.i [2024-10-11 13:13:09,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4209d69b7/e2cd71e106994733bdbd34c7bda24fd9/FLAG368d41f09 [2024-10-11 13:13:09,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4209d69b7/e2cd71e106994733bdbd34c7bda24fd9 [2024-10-11 13:13:09,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:13:09,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:13:09,454 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:13:09,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:13:09,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:13:09,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:13:09" (1/1) ... [2024-10-11 13:13:09,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e48fa3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:09, skipping insertion in model container [2024-10-11 13:13:09,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:13:09" (1/1) ... [2024-10-11 13:13:09,500 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:13:09,668 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-0.i[915,928] [2024-10-11 13:13:09,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:13:09,767 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:13:09,779 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-0.i[915,928] [2024-10-11 13:13:09,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:13:09,850 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:13:09,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:09 WrapperNode [2024-10-11 13:13:09,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:13:09,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:13:09,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:13:09,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:13:09,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:09" (1/1) ... [2024-10-11 13:13:09,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:09" (1/1) ... [2024-10-11 13:13:09,908 INFO L138 Inliner]: procedures = 29, calls = 114, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 365 [2024-10-11 13:13:09,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:13:09,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:13:09,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:13:09,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:13:09,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:09" (1/1) ... [2024-10-11 13:13:09,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:09" (1/1) ... [2024-10-11 13:13:09,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:09" (1/1) ... [2024-10-11 13:13:09,952 INFO L175 MemorySlicer]: Split 91 memory accesses to 5 slices as follows [2, 16, 55, 12, 6]. 60 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 2, 4, 2, 1]. The 13 writes are split as follows [0, 2, 8, 2, 1]. [2024-10-11 13:13:09,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:09" (1/1) ... [2024-10-11 13:13:09,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:09" (1/1) ... [2024-10-11 13:13:09,985 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:09" (1/1) ... [2024-10-11 13:13:09,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:09" (1/1) ... [2024-10-11 13:13:09,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:09" (1/1) ... [2024-10-11 13:13:09,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:09" (1/1) ... [2024-10-11 13:13:10,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:13:10,008 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:13:10,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:13:10,008 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:13:10,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:09" (1/1) ... [2024-10-11 13:13:10,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:13:10,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:13:10,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:13:10,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:13:10,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:13:10,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:13:10,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:13:10,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:13:10,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:13:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:13:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:13:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:13:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:13:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:13:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:13:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:13:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:13:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:13:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:13:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:13:10,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:13:10,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:13:10,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:13:10,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:13:10,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:13:10,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:13:10,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:13:10,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:13:10,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:13:10,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:13:10,117 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:13:10,118 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:13:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:13:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:13:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:13:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:13:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:13:10,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:13:10,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:13:10,267 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:13:10,269 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:13:10,683 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-10-11 13:13:10,683 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:13:10,716 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:13:10,717 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:13:10,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:13:10 BoogieIcfgContainer [2024-10-11 13:13:10,717 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:13:10,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:13:10,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:13:10,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:13:10,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:13:09" (1/3) ... [2024-10-11 13:13:10,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28682c22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:13:10, skipping insertion in model container [2024-10-11 13:13:10,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:09" (2/3) ... [2024-10-11 13:13:10,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28682c22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:13:10, skipping insertion in model container [2024-10-11 13:13:10,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:13:10" (3/3) ... [2024-10-11 13:13:10,727 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-0.i [2024-10-11 13:13:10,742 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:13:10,742 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:13:10,805 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:13:10,811 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1eb10789, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:13:10,812 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:13:10,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 67 states have (on average 1.507462686567164) internal successors, (101), 68 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 13:13:10,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 13:13:10,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:10,826 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:13:10,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:10,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:10,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1703446681, now seen corresponding path program 1 times [2024-10-11 13:13:10,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:13:10,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479340735] [2024-10-11 13:13:10,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:10,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:13:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:13:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:13:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:13:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:13:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:13:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:13:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:13:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:13:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 13:13:11,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:13:11,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479340735] [2024-10-11 13:13:11,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479340735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:13:11,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:13:11,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:13:11,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700563254] [2024-10-11 13:13:11,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:13:11,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:13:11,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:13:11,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:13:11,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:13:11,341 INFO L87 Difference]: Start difference. First operand has 78 states, 67 states have (on average 1.507462686567164) internal successors, (101), 68 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 13:13:11,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:11,382 INFO L93 Difference]: Finished difference Result 150 states and 235 transitions. [2024-10-11 13:13:11,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:13:11,386 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2024-10-11 13:13:11,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:11,394 INFO L225 Difference]: With dead ends: 150 [2024-10-11 13:13:11,394 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 13:13:11,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:13:11,402 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:11,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:13:11,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 13:13:11,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-11 13:13:11,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 13:13:11,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2024-10-11 13:13:11,453 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 73 [2024-10-11 13:13:11,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:11,454 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2024-10-11 13:13:11,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 13:13:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2024-10-11 13:13:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 13:13:11,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:11,457 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:13:11,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:13:11,458 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:11,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:11,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1747522459, now seen corresponding path program 1 times [2024-10-11 13:13:11,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:13:11,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124340645] [2024-10-11 13:13:11,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:11,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:13:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:13:11,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:13:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:13:11,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:13:11,702 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:13:11,705 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:13:11,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:13:11,710 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 13:13:11,785 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:13:11,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:13:11 BoogieIcfgContainer [2024-10-11 13:13:11,788 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:13:11,789 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:13:11,789 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:13:11,789 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:13:11,791 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:13:10" (3/4) ... [2024-10-11 13:13:11,793 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:13:11,794 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:13:11,795 INFO L158 Benchmark]: Toolchain (without parser) took 2341.87ms. Allocated memory is still 203.4MB. Free memory was 133.0MB in the beginning and 128.4MB in the end (delta: 4.6MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2024-10-11 13:13:11,797 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:13:11,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.51ms. Allocated memory is still 203.4MB. Free memory was 133.0MB in the beginning and 117.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 13:13:11,799 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.61ms. Allocated memory is still 203.4MB. Free memory was 117.2MB in the beginning and 114.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:13:11,799 INFO L158 Benchmark]: Boogie Preprocessor took 97.71ms. Allocated memory is still 203.4MB. Free memory was 114.1MB in the beginning and 109.9MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:13:11,800 INFO L158 Benchmark]: RCFGBuilder took 709.59ms. Allocated memory is still 203.4MB. Free memory was 109.9MB in the beginning and 80.0MB in the end (delta: 29.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 13:13:11,802 INFO L158 Benchmark]: TraceAbstraction took 1068.76ms. Allocated memory is still 203.4MB. Free memory was 79.4MB in the beginning and 128.4MB in the end (delta: -48.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:13:11,803 INFO L158 Benchmark]: Witness Printer took 5.09ms. Allocated memory is still 203.4MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:13:11,805 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.51ms. Allocated memory is still 203.4MB. Free memory was 133.0MB in the beginning and 117.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.61ms. Allocated memory is still 203.4MB. Free memory was 117.2MB in the beginning and 114.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.71ms. Allocated memory is still 203.4MB. Free memory was 114.1MB in the beginning and 109.9MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 709.59ms. Allocated memory is still 203.4MB. Free memory was 109.9MB in the beginning and 80.0MB in the end (delta: 29.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1068.76ms. Allocated memory is still 203.4MB. Free memory was 79.4MB in the beginning and 128.4MB in the end (delta: -48.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.09ms. Allocated memory is still 203.4MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryArithmeticDOUBLEoperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] double double_Array_0[2][2] = { {5.25, 128.2}, {15.4, 25.8} }; [L25-L27] double double_Array_0[2][2] = { {5.25, 128.2}, {15.4, 25.8} }; [L25-L27] double double_Array_0[2][2] = { {5.25, 128.2}, {15.4, 25.8} }; [L25-L27] double double_Array_0[2][2] = { {5.25, 128.2}, {15.4, 25.8} }; [L25-L27] double double_Array_0[2][2] = { {5.25, 128.2}, {15.4, 25.8} }; [L28-L30] unsigned char unsigned_char_Array_0[2] = { 1, 100 }; [L28-L30] unsigned char unsigned_char_Array_0[2] = { 1, 100 }; [L28-L30] unsigned char unsigned_char_Array_0[2] = { 1, 100 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[1] = { 5 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[1] = { 5 }; [L34] double last_1_double_Array_0_0__0_ = 5.25; [L35] unsigned char last_1_unsigned_char_Array_0_1_ = 100; [L36] unsigned short int last_1_unsigned_short_int_Array_0_0_ = 5; [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] CALL updateLastVariables() [L87] EXPR double_Array_0[0][0] [L87] last_1_double_Array_0_0__0_ = double_Array_0[0][0] [L88] EXPR unsigned_char_Array_0[1] [L88] last_1_unsigned_char_Array_0_1_ = unsigned_char_Array_0[1] [L89] EXPR unsigned_short_int_Array_0[0] [L89] last_1_unsigned_short_int_Array_0_0_ = unsigned_short_int_Array_0[0] [L99] RET updateLastVariables() [L100] CALL updateVariables() [L72] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L75] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] double_Array_0[1][0] = __VERIFIER_nondet_double() [L79] EXPR double_Array_0[1][0] [L79] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F [L79] EXPR double_Array_0[1][0] [L79] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] double_Array_0[0][1] = __VERIFIER_nondet_double() [L81] EXPR double_Array_0[0][1] [L81] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F [L81] EXPR double_Array_0[0][1] [L81] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] EXPR (double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854765600e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] EXPR (double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854765600e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] CALL assume_abort_if_not((double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854765600e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] RET assume_abort_if_not((double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854765600e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L83] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] RET updateVariables() [L101] CALL step() [L40] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L40] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L45] COND FALSE !((last_1_unsigned_short_int_Array_0_0_ + last_1_unsigned_short_int_Array_0_0_) < last_1_unsigned_short_int_Array_0_0_) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L50] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L50] COND TRUE ! BOOL_unsigned_char_Array_0[1] [L51] EXPR double_Array_0[0][1] [L51] EXPR double_Array_0[1][0] [L51] double_Array_0[1][1] = (double_Array_0[0][1] - double_Array_0[1][0]) [L55] EXPR double_Array_0[0][1] [L55] EXPR double_Array_0[1][0] [L55] EXPR double_Array_0[1][1] [L55] EXPR double_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L55] COND FALSE !((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) [L68] EXPR double_Array_0[0][1] [L68] double_Array_0[0][0] = double_Array_0[0][1] [L101] RET step() [L102] CALL, EXPR property() [L92] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR (! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1]))))) [L92] EXPR double_Array_0[1][1] [L92] EXPR double_Array_0[0][1] [L92] EXPR double_Array_0[1][0] [L92] EXPR (! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR ((! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1])))))) && (((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[1] ? (((- unsigned_short_int_Array_0[0]) <= unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0][0] == ((double) double_Array_0[1][0])) : 1) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR ((! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1])))))) && (((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[1] ? (((- unsigned_short_int_Array_0[0]) <= unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0][0] == ((double) double_Array_0[1][0])) : 1) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR (((! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1])))))) && (((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[1] ? (((- unsigned_short_int_Array_0[0]) <= unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0][0] == ((double) double_Array_0[1][0])) : 1) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1])))) && (((last_1_unsigned_short_int_Array_0_0_ + last_1_unsigned_short_int_Array_0_0_) < last_1_unsigned_short_int_Array_0_0_) ? ((last_1_unsigned_short_int_Array_0_0_ > last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR (((! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1])))))) && (((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[1] ? (((- unsigned_short_int_Array_0[0]) <= unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0][0] == ((double) double_Array_0[1][0])) : 1) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1])))) && (((last_1_unsigned_short_int_Array_0_0_ + last_1_unsigned_short_int_Array_0_0_) < last_1_unsigned_short_int_Array_0_0_) ? ((last_1_unsigned_short_int_Array_0_0_ > last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR ((((! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1])))))) && (((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[1] ? (((- unsigned_short_int_Array_0[0]) <= unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0][0] == ((double) double_Array_0[1][0])) : 1) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1])))) && (((last_1_unsigned_short_int_Array_0_0_ + last_1_unsigned_short_int_Array_0_0_) < last_1_unsigned_short_int_Array_0_0_) ? ((last_1_unsigned_short_int_Array_0_0_ > last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (((double_Array_0[1][0] * (double_Array_0[0][1] - 5.3)) <= last_1_double_Array_0_0__0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_1_)) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR ((((! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1])))))) && (((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[1] ? (((- unsigned_short_int_Array_0[0]) <= unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0][0] == ((double) double_Array_0[1][0])) : 1) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1])))) && (((last_1_unsigned_short_int_Array_0_0_ + last_1_unsigned_short_int_Array_0_0_) < last_1_unsigned_short_int_Array_0_0_) ? ((last_1_unsigned_short_int_Array_0_0_ > last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (((double_Array_0[1][0] * (double_Array_0[0][1] - 5.3)) <= last_1_double_Array_0_0__0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_1_)) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92-L93] return ((((! BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) : (double_Array_0[1][1] == ((double) ((((16.2) < (double_Array_0[0][1])) ? (16.2) : (double_Array_0[0][1])))))) && (((double_Array_0[0][1] + (double_Array_0[1][0] + double_Array_0[1][1])) != double_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[1] ? (((- unsigned_short_int_Array_0[0]) <= unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0][0] == ((double) double_Array_0[1][0])) : 1) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1]))) : (double_Array_0[0][0] == ((double) double_Array_0[0][1])))) && (((last_1_unsigned_short_int_Array_0_0_ + last_1_unsigned_short_int_Array_0_0_) < last_1_unsigned_short_int_Array_0_0_) ? ((last_1_unsigned_short_int_Array_0_0_ > last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (((double_Array_0[1][0] * (double_Array_0[0][1] - 5.3)) <= last_1_double_Array_0_0__0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_1_)) : 1) : 1) ; [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0__0_=21/4, last_1_unsigned_char_Array_0_1_=100, last_1_unsigned_short_int_Array_0_0_=5, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4 IncrementalHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 99 mSDtfsCounter, 4 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 72 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 112/112 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 13:13:11,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-0.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f190a6c4b0edbc49af141a983db7689f2287405b384242554734ee34095f2f5c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:13:14,094 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:13:14,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:13:14,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:13:14,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:13:14,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:13:14,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:13:14,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:13:14,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:13:14,222 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:13:14,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:13:14,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:13:14,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:13:14,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:13:14,227 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:13:14,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:13:14,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:13:14,228 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:13:14,228 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:13:14,230 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:13:14,230 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:13:14,230 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:13:14,231 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:13:14,231 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:13:14,231 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:13:14,231 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:13:14,232 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:13:14,232 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:13:14,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:13:14,232 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:13:14,233 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:13:14,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:13:14,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:13:14,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:13:14,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:13:14,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:13:14,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:13:14,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:13:14,236 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:13:14,236 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:13:14,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:13:14,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:13:14,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:13:14,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:13:14,237 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:13:14,238 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f190a6c4b0edbc49af141a983db7689f2287405b384242554734ee34095f2f5c [2024-10-11 13:13:14,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:13:14,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:13:14,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:13:14,608 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:13:14,608 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:13:14,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-0.i [2024-10-11 13:13:16,221 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:13:16,431 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:13:16,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-0.i [2024-10-11 13:13:16,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4afaee51a/b8648dcc3d244b358ff4a57c85423e31/FLAG61d71cb77 [2024-10-11 13:13:16,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4afaee51a/b8648dcc3d244b358ff4a57c85423e31 [2024-10-11 13:13:16,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:13:16,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:13:16,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:13:16,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:13:16,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:13:16,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:13:16" (1/1) ... [2024-10-11 13:13:16,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a4d1547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:16, skipping insertion in model container [2024-10-11 13:13:16,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:13:16" (1/1) ... [2024-10-11 13:13:16,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:13:16,688 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-0.i[915,928] [2024-10-11 13:13:16,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:13:16,784 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:13:16,796 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-0.i[915,928] [2024-10-11 13:13:16,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:13:16,881 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:13:16,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:16 WrapperNode [2024-10-11 13:13:16,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:13:16,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:13:16,883 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:13:16,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:13:16,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:16" (1/1) ... [2024-10-11 13:13:16,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:16" (1/1) ... [2024-10-11 13:13:16,970 INFO L138 Inliner]: procedures = 33, calls = 114, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 365 [2024-10-11 13:13:16,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:13:16,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:13:16,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:13:16,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:13:16,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:16" (1/1) ... [2024-10-11 13:13:16,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:16" (1/1) ... [2024-10-11 13:13:16,997 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:16" (1/1) ... [2024-10-11 13:13:17,027 INFO L175 MemorySlicer]: Split 91 memory accesses to 5 slices as follows [2, 16, 55, 12, 6]. 60 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 2, 4, 2, 1]. The 13 writes are split as follows [0, 2, 8, 2, 1]. [2024-10-11 13:13:17,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:16" (1/1) ... [2024-10-11 13:13:17,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:16" (1/1) ... [2024-10-11 13:13:17,063 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:16" (1/1) ... [2024-10-11 13:13:17,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:16" (1/1) ... [2024-10-11 13:13:17,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:16" (1/1) ... [2024-10-11 13:13:17,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:16" (1/1) ... [2024-10-11 13:13:17,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:13:17,083 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:13:17,083 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:13:17,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:13:17,084 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:16" (1/1) ... [2024-10-11 13:13:17,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:13:17,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:13:17,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:13:17,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:13:17,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:13:17,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 13:13:17,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 13:13:17,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-11 13:13:17,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-11 13:13:17,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-11 13:13:17,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 13:13:17,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 13:13:17,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-11 13:13:17,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-11 13:13:17,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-11 13:13:17,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:13:17,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:13:17,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:13:17,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:13:17,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:13:17,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:13:17,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:13:17,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-11 13:13:17,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-11 13:13:17,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-11 13:13:17,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:13:17,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:13:17,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:13:17,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:13:17,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:13:17,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-11 13:13:17,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-11 13:13:17,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-11 13:13:17,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-11 13:13:17,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-11 13:13:17,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:13:17,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:13:17,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-11 13:13:17,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-11 13:13:17,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-11 13:13:17,157 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:13:17,157 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:13:17,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:13:17,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:13:17,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:13:17,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:13:17,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:13:17,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:13:17,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:13:17,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:13:17,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:13:17,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-11 13:13:17,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-11 13:13:17,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-11 13:13:17,310 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:13:17,312 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:13:37,982 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2024-10-11 13:13:37,982 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:13:38,027 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:13:38,027 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:13:38,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:13:38 BoogieIcfgContainer [2024-10-11 13:13:38,028 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:13:38,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:13:38,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:13:38,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:13:38,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:13:16" (1/3) ... [2024-10-11 13:13:38,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7254e763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:13:38, skipping insertion in model container [2024-10-11 13:13:38,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:13:16" (2/3) ... [2024-10-11 13:13:38,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7254e763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:13:38, skipping insertion in model container [2024-10-11 13:13:38,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:13:38" (3/3) ... [2024-10-11 13:13:38,062 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-0.i [2024-10-11 13:13:38,077 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:13:38,077 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:13:38,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:13:38,144 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@341ad2da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:13:38,145 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:13:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 67 states have (on average 1.507462686567164) internal successors, (101), 68 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 13:13:38,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 13:13:38,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:38,164 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:13:38,164 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:38,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:38,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1703446681, now seen corresponding path program 1 times [2024-10-11 13:13:38,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:13:38,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977874975] [2024-10-11 13:13:38,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:38,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:13:38,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:13:38,190 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:13:38,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 13:13:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:38,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:13:38,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:38,686 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-11 13:13:38,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:13:38,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:13:38,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977874975] [2024-10-11 13:13:38,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977874975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:13:38,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:13:38,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:13:38,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973602430] [2024-10-11 13:13:38,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:13:38,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:13:38,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:13:38,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:13:38,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:13:38,730 INFO L87 Difference]: Start difference. First operand has 78 states, 67 states have (on average 1.507462686567164) internal successors, (101), 68 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 13:13:38,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:13:38,807 INFO L93 Difference]: Finished difference Result 150 states and 235 transitions. [2024-10-11 13:13:38,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:13:38,810 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2024-10-11 13:13:38,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:13:38,818 INFO L225 Difference]: With dead ends: 150 [2024-10-11 13:13:38,820 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 13:13:38,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:13:38,829 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:13:38,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:13:38,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 13:13:38,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-11 13:13:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 13:13:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2024-10-11 13:13:38,883 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 73 [2024-10-11 13:13:38,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:13:38,884 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2024-10-11 13:13:38,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 13:13:38,885 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2024-10-11 13:13:38,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 13:13:38,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:13:38,887 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:13:38,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 13:13:39,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:13:39,089 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:13:39,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:13:39,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1747522459, now seen corresponding path program 1 times [2024-10-11 13:13:39,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:13:39,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555921072] [2024-10-11 13:13:39,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:13:39,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:13:39,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:13:39,093 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:13:39,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 13:13:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:13:39,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:13:39,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:40,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:13:40,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-10-11 13:13:40,356 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 13:13:40,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:13:40,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:13:40,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555921072] [2024-10-11 13:13:40,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1555921072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:13:40,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:13:40,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:13:40,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045611204] [2024-10-11 13:13:40,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:13:40,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:13:40,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:13:40,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:13:40,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:13:40,360 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 13:13:45,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:13:47,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:13:51,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:13:53,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:14:01,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:14:06,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:14:09,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:14:09,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:09,672 INFO L93 Difference]: Finished difference Result 146 states and 206 transitions. [2024-10-11 13:14:09,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:14:09,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2024-10-11 13:14:09,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:09,705 INFO L225 Difference]: With dead ends: 146 [2024-10-11 13:14:09,705 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 13:14:09,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:14:09,707 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 85 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:09,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 268 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 3 Unknown, 0 Unchecked, 29.1s Time] [2024-10-11 13:14:09,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 13:14:09,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-10-11 13:14:09,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 13:14:09,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2024-10-11 13:14:09,716 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 73 [2024-10-11 13:14:09,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:09,720 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2024-10-11 13:14:09,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 13:14:09,720 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2024-10-11 13:14:09,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 13:14:09,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:09,721 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:09,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 13:14:09,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:09,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:09,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:09,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1604512151, now seen corresponding path program 1 times [2024-10-11 13:14:09,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:09,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113650960] [2024-10-11 13:14:09,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:09,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:09,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:09,928 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:14:09,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 13:14:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:14:10,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 13:14:10,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:14:10,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:10,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113650960] [2024-10-11 13:14:10,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113650960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:10,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:10,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:14:10,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24876184] [2024-10-11 13:14:10,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:10,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:14:10,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:10,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:14:10,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:14:10,566 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 13:14:11,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:11,121 INFO L93 Difference]: Finished difference Result 149 states and 208 transitions. [2024-10-11 13:14:11,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:14:11,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2024-10-11 13:14:11,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:11,123 INFO L225 Difference]: With dead ends: 149 [2024-10-11 13:14:11,123 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 13:14:11,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:14:11,125 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:11,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 411 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:14:11,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 13:14:11,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2024-10-11 13:14:11,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 13:14:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2024-10-11 13:14:11,134 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 75 [2024-10-11 13:14:11,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:11,135 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2024-10-11 13:14:11,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 13:14:11,136 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2024-10-11 13:14:11,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 13:14:11,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:11,137 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:11,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 13:14:11,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:11,338 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:11,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:11,339 INFO L85 PathProgramCache]: Analyzing trace with hash 762182443, now seen corresponding path program 1 times [2024-10-11 13:14:11,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:11,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92186302] [2024-10-11 13:14:11,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:11,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:11,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:11,343 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:14:11,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 13:14:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:11,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:14:11,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:12,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:12,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-10-11 13:14:12,372 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 13:14:12,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:14:12,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:12,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92186302] [2024-10-11 13:14:12,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92186302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:12,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:12,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:14:12,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676491825] [2024-10-11 13:14:12,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:12,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:14:12,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:12,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:14:12,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:14:12,375 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 13:14:15,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:14:18,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:14:21,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:14:26,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:14:29,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:14:33,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:14:37,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:14:39,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:14:39,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:39,789 INFO L93 Difference]: Finished difference Result 146 states and 202 transitions. [2024-10-11 13:14:39,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:14:39,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2024-10-11 13:14:39,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:39,823 INFO L225 Difference]: With dead ends: 146 [2024-10-11 13:14:39,824 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 13:14:39,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:14:39,825 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 75 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:39,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 257 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 3 Unknown, 0 Unchecked, 27.3s Time] [2024-10-11 13:14:39,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 13:14:39,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-10-11 13:14:39,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 13:14:39,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 100 transitions. [2024-10-11 13:14:39,833 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 100 transitions. Word has length 75 [2024-10-11 13:14:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:39,835 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 100 transitions. [2024-10-11 13:14:39,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 13:14:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2024-10-11 13:14:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 13:14:39,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:39,838 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:39,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 13:14:40,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:40,038 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:40,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:40,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2015070171, now seen corresponding path program 1 times [2024-10-11 13:14:40,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:40,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633495456] [2024-10-11 13:14:40,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:40,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:40,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:40,043 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:14:40,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 13:14:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:44,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-11 13:14:44,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:44,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 13:14:46,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 67