./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-35.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd --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 fcbb8ac143b8a67ade9889ff8d88b7d2d6babdf5f8c61bca7ac82a80bc9d336c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:05:05,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:05:05,522 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:05:05,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:05:05,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:05:05,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:05:05,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:05:05,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:05:05,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:05:05,552 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:05:05,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:05:05,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:05:05,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:05:05,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:05:05,553 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:05:05,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:05:05,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:05:05,553 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:05:05,554 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:05:05,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:05:05,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:05:05,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:05:05,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:05:05,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:05:05,557 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:05:05,557 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:05:05,558 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:05:05,558 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:05:05,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:05:05,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:05:05,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:05:05,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:05:05,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:05:05,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:05:05,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:05:05,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:05:05,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:05:05,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:05:05,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:05:05,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:05:05,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:05:05,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:05:05,559 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd 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 -> fcbb8ac143b8a67ade9889ff8d88b7d2d6babdf5f8c61bca7ac82a80bc9d336c [2024-11-13 14:05:05,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:05:05,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:05:05,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:05:05,907 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:05:05,908 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:05:05,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-35.i Unable to find full path for "g++" [2024-11-13 14:05:07,872 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:05:08,290 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:05:08,291 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-35.i [2024-11-13 14:05:08,309 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/data/af356de9f/28f3d8dde10d493298627c428c726eb8/FLAG1cbdaf44d [2024-11-13 14:05:08,465 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/data/af356de9f/28f3d8dde10d493298627c428c726eb8 [2024-11-13 14:05:08,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:05:08,471 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:05:08,472 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:05:08,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:05:08,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:05:08,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:05:08" (1/1) ... [2024-11-13 14:05:08,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45252db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:08, skipping insertion in model container [2024-11-13 14:05:08,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:05:08" (1/1) ... [2024-11-13 14:05:08,521 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:05:08,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-35.i[915,928] [2024-11-13 14:05:08,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:05:08,851 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:05:08,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-35.i[915,928] [2024-11-13 14:05:08,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:05:08,922 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:05:08,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:08 WrapperNode [2024-11-13 14:05:08,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:05:08,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:05:08,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:05:08,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:05:08,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:08" (1/1) ... [2024-11-13 14:05:08,950 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:08" (1/1) ... [2024-11-13 14:05:08,998 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2024-11-13 14:05:08,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:05:08,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:05:08,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:05:08,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:05:09,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:08" (1/1) ... [2024-11-13 14:05:09,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:08" (1/1) ... [2024-11-13 14:05:09,017 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:08" (1/1) ... [2024-11-13 14:05:09,047 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 14:05:09,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:08" (1/1) ... [2024-11-13 14:05:09,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:08" (1/1) ... [2024-11-13 14:05:09,066 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:08" (1/1) ... [2024-11-13 14:05:09,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:08" (1/1) ... [2024-11-13 14:05:09,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:08" (1/1) ... [2024-11-13 14:05:09,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:08" (1/1) ... [2024-11-13 14:05:09,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:05:09,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:05:09,086 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:05:09,086 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:05:09,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:08" (1/1) ... [2024-11-13 14:05:09,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:05:09,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:05:09,139 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:05:09,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:05:09,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:05:09,179 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:05:09,181 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:05:09,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:05:09,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:05:09,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:05:09,314 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:05:09,316 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:05:09,890 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-13 14:05:09,890 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:05:09,908 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:05:09,909 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:05:09,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:05:09 BoogieIcfgContainer [2024-11-13 14:05:09,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:05:09,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:05:09,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:05:09,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:05:09,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:05:08" (1/3) ... [2024-11-13 14:05:09,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1673aeac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:05:09, skipping insertion in model container [2024-11-13 14:05:09,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:08" (2/3) ... [2024-11-13 14:05:09,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1673aeac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:05:09, skipping insertion in model container [2024-11-13 14:05:09,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:05:09" (3/3) ... [2024-11-13 14:05:09,927 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-35.i [2024-11-13 14:05:09,947 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:05:09,949 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-35.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:05:10,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:05:10,055 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;@4569eb20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:05:10,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:05:10,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 14:05:10,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 14:05:10,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:10,079 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:05:10,080 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:10,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:10,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2092225353, now seen corresponding path program 1 times [2024-11-13 14:05:10,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:05:10,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744228972] [2024-11-13 14:05:10,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:10,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:05:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:10,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:05:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:10,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:05:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:10,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:05:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:10,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:05:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:10,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:05:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:10,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:05:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:10,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:05:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:10,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 14:05:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:10,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:05:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:10,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:05:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:10,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 14:05:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:10,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 14:05:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:10,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 14:05:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:10,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-13 14:05:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:10,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:05:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:10,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 14:05:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:10,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 14:05:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:10,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:05:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:10,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:05:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:10,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-13 14:05:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:05:10,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:05:10,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744228972] [2024-11-13 14:05:10,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744228972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:05:10,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:05:10,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:05:10,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911118847] [2024-11-13 14:05:10,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:05:10,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:05:10,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:05:10,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:05:10,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:05:10,635 INFO L87 Difference]: Start difference. First operand has 72 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 14:05:10,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:10,677 INFO L93 Difference]: Finished difference Result 141 states and 229 transitions. [2024-11-13 14:05:10,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:05:10,681 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 136 [2024-11-13 14:05:10,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:10,689 INFO L225 Difference]: With dead ends: 141 [2024-11-13 14:05:10,689 INFO L226 Difference]: Without dead ends: 68 [2024-11-13 14:05:10,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-11-13 14:05:10,697 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:10,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:05:10,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-13 14:05:10,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-13 14:05:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 14:05:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions. [2024-11-13 14:05:10,748 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 136 [2024-11-13 14:05:10,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:10,748 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions. [2024-11-13 14:05:10,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 14:05:10,749 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions. [2024-11-13 14:05:10,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 14:05:10,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:10,753 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:05:10,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:05:10,754 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:10,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:10,754 INFO L85 PathProgramCache]: Analyzing trace with hash 211476671, now seen corresponding path program 1 times [2024-11-13 14:05:10,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:05:10,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917663004] [2024-11-13 14:05:10,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:10,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:05:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:11,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:05:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:11,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:05:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:11,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:05:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:11,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:05:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:11,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:05:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:11,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:05:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:11,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:05:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:11,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 14:05:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:11,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:05:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:11,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:05:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:11,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 14:05:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:11,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 14:05:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:11,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 14:05:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:11,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-13 14:05:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:11,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:05:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:11,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 14:05:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:11,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 14:05:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:11,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:05:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:11,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:05:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:11,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-13 14:05:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:11,697 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:05:11,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:05:11,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917663004] [2024-11-13 14:05:11,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917663004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:05:11,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:05:11,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:05:11,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738159318] [2024-11-13 14:05:11,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:05:11,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:05:11,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:05:11,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:05:11,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:05:11,701 INFO L87 Difference]: Start difference. First operand 68 states and 99 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:05:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:12,105 INFO L93 Difference]: Finished difference Result 218 states and 318 transitions. [2024-11-13 14:05:12,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:05:12,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2024-11-13 14:05:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:12,116 INFO L225 Difference]: With dead ends: 218 [2024-11-13 14:05:12,116 INFO L226 Difference]: Without dead ends: 153 [2024-11-13 14:05:12,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:05:12,118 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 93 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:12,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 368 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:05:12,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-13 14:05:12,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 131. [2024-11-13 14:05:12,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 88 states have internal predecessors, (113), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 14:05:12,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 193 transitions. [2024-11-13 14:05:12,163 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 193 transitions. Word has length 136 [2024-11-13 14:05:12,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:12,163 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 193 transitions. [2024-11-13 14:05:12,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:05:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 193 transitions. [2024-11-13 14:05:12,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 14:05:12,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:12,166 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 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-11-13 14:05:12,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:05:12,167 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:12,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:12,167 INFO L85 PathProgramCache]: Analyzing trace with hash 442824094, now seen corresponding path program 1 times [2024-11-13 14:05:12,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:05:12,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754451018] [2024-11-13 14:05:12,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:12,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:05:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:12,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:05:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:12,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:05:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:12,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:05:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:12,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:05:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:12,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:05:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:12,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:05:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:12,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:05:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:12,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 14:05:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:12,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:05:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:12,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:05:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:12,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 14:05:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:12,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 14:05:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:12,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 14:05:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:12,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-13 14:05:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:12,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:05:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:12,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 14:05:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:12,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 14:05:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:12,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:05:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:12,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:05:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:12,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-13 14:05:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:05:12,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:05:12,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754451018] [2024-11-13 14:05:12,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754451018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:05:12,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:05:12,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:05:12,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597728556] [2024-11-13 14:05:12,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:05:12,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:05:12,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:05:12,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:05:12,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:05:12,702 INFO L87 Difference]: Start difference. First operand 131 states and 193 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:05:13,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:13,088 INFO L93 Difference]: Finished difference Result 452 states and 664 transitions. [2024-11-13 14:05:13,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:05:13,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-13 14:05:13,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:13,094 INFO L225 Difference]: With dead ends: 452 [2024-11-13 14:05:13,094 INFO L226 Difference]: Without dead ends: 324 [2024-11-13 14:05:13,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:05:13,097 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 132 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:13,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 372 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:05:13,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-13 14:05:13,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 220. [2024-11-13 14:05:13,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 161 states have (on average 1.329192546583851) internal successors, (214), 163 states have internal predecessors, (214), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 14:05:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 322 transitions. [2024-11-13 14:05:13,183 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 322 transitions. Word has length 137 [2024-11-13 14:05:13,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:13,184 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 322 transitions. [2024-11-13 14:05:13,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:05:13,184 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 322 transitions. [2024-11-13 14:05:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 14:05:13,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:13,190 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 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-11-13 14:05:13,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:05:13,191 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:13,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:13,191 INFO L85 PathProgramCache]: Analyzing trace with hash -143981920, now seen corresponding path program 1 times [2024-11-13 14:05:13,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:05:13,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268261515] [2024-11-13 14:05:13,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:13,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:05:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:05:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:05:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:05:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:05:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:05:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:05:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:05:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 14:05:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:05:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:05:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 14:05:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 14:05:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 14:05:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-13 14:05:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:05:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 14:05:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 14:05:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:05:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:05:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-13 14:05:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:05:13,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:05:13,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268261515] [2024-11-13 14:05:13,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268261515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:05:13,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:05:13,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:05:13,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480784642] [2024-11-13 14:05:13,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:05:13,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:05:13,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:05:13,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:05:13,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:05:13,837 INFO L87 Difference]: Start difference. First operand 220 states and 322 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:05:14,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:14,128 INFO L93 Difference]: Finished difference Result 720 states and 1051 transitions. [2024-11-13 14:05:14,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:05:14,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-13 14:05:14,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:14,142 INFO L225 Difference]: With dead ends: 720 [2024-11-13 14:05:14,143 INFO L226 Difference]: Without dead ends: 503 [2024-11-13 14:05:14,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:05:14,149 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 96 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:14,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 297 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:05:14,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-13 14:05:14,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 435. [2024-11-13 14:05:14,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 318 states have (on average 1.3270440251572326) internal successors, (422), 322 states have internal predecessors, (422), 108 states have call successors, (108), 8 states have call predecessors, (108), 8 states have return successors, (108), 104 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-13 14:05:14,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 638 transitions. [2024-11-13 14:05:14,277 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 638 transitions. Word has length 137 [2024-11-13 14:05:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:14,278 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 638 transitions. [2024-11-13 14:05:14,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:05:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 638 transitions. [2024-11-13 14:05:14,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 14:05:14,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:14,285 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 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-11-13 14:05:14,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:05:14,285 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:14,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:14,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1832925662, now seen corresponding path program 1 times [2024-11-13 14:05:14,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:05:14,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013781557] [2024-11-13 14:05:14,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:14,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:05:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:05:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:05:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:05:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:05:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:05:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:05:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:05:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 14:05:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:05:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:05:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 14:05:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 14:05:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 14:05:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-13 14:05:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:05:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 14:05:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 14:05:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:05:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:05:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-13 14:05:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:05:14,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:05:14,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013781557] [2024-11-13 14:05:14,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013781557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:05:14,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:05:14,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:05:14,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955632679] [2024-11-13 14:05:14,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:05:14,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:05:14,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:05:14,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:05:14,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:05:14,770 INFO L87 Difference]: Start difference. First operand 435 states and 638 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:05:15,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:15,268 INFO L93 Difference]: Finished difference Result 836 states and 1195 transitions. [2024-11-13 14:05:15,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:05:15,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-13 14:05:15,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:15,276 INFO L225 Difference]: With dead ends: 836 [2024-11-13 14:05:15,276 INFO L226 Difference]: Without dead ends: 619 [2024-11-13 14:05:15,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:05:15,281 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 107 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:15,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 366 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:05:15,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-13 14:05:15,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 435. [2024-11-13 14:05:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 318 states have (on average 1.3144654088050314) internal successors, (418), 322 states have internal predecessors, (418), 108 states have call successors, (108), 8 states have call predecessors, (108), 8 states have return successors, (108), 104 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-13 14:05:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 634 transitions. [2024-11-13 14:05:15,390 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 634 transitions. Word has length 137 [2024-11-13 14:05:15,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:15,390 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 634 transitions. [2024-11-13 14:05:15,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:05:15,391 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 634 transitions. [2024-11-13 14:05:15,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 14:05:15,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:15,393 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 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-11-13 14:05:15,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:05:15,394 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:15,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:15,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1152867292, now seen corresponding path program 1 times [2024-11-13 14:05:15,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:05:15,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166812429] [2024-11-13 14:05:15,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:15,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:05:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:05:15,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1085328240] [2024-11-13 14:05:15,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:15,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:05:15,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:05:15,480 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:05:15,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:05:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:05:15,699 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:05:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:05:15,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:05:15,908 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:05:15,909 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:05:15,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:05:16,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:05:16,114 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-13 14:05:16,249 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:05:16,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:05:16 BoogieIcfgContainer [2024-11-13 14:05:16,253 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:05:16,253 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:05:16,253 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:05:16,254 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:05:16,258 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:05:09" (3/4) ... [2024-11-13 14:05:16,260 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:05:16,261 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:05:16,262 INFO L158 Benchmark]: Toolchain (without parser) took 7791.25ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 94.0MB in the beginning and 106.8MB in the end (delta: -12.8MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-11-13 14:05:16,262 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 167.8MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:05:16,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.78ms. Allocated memory is still 117.4MB. Free memory was 94.0MB in the beginning and 79.7MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:05:16,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.54ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 77.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:05:16,263 INFO L158 Benchmark]: Boogie Preprocessor took 85.87ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 73.8MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:05:16,263 INFO L158 Benchmark]: RCFGBuilder took 823.97ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 53.5MB in the end (delta: 20.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 14:05:16,263 INFO L158 Benchmark]: TraceAbstraction took 6337.13ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 53.1MB in the beginning and 108.3MB in the end (delta: -55.2MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2024-11-13 14:05:16,264 INFO L158 Benchmark]: Witness Printer took 7.56ms. Allocated memory is still 142.6MB. Free memory was 108.3MB in the beginning and 106.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:05:16,266 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 167.8MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.78ms. Allocated memory is still 117.4MB. Free memory was 94.0MB in the beginning and 79.7MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.54ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 77.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 85.87ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 73.8MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 823.97ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 53.5MB in the end (delta: 20.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6337.13ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 53.1MB in the beginning and 108.3MB in the end (delta: -55.2MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. * Witness Printer took 7.56ms. Allocated memory is still 142.6MB. Free memory was 108.3MB in the beginning and 106.8MB in the end (delta: 1.5MB). 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 someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someUnaryFLOAToperation at line 79, overapproximation of someBinaryArithmeticFLOAToperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_3 = 1; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 0; [L26] unsigned short int var_1_6 = 25; [L27] double var_1_9 = 999.625; [L28] unsigned short int var_1_11 = 5; [L29] signed short int var_1_12 = 2; [L30] signed long int var_1_13 = -256; [L31] double var_1_14 = 127.75; [L32] double var_1_15 = 9.75; [L33] float var_1_16 = 32.8; [L34] float var_1_17 = 32.5; [L35] float var_1_18 = 1.75; [L36] float var_1_19 = 1000000000000000.4; [L37] float var_1_20 = 0.875; [L38] unsigned char var_1_21 = 0; [L39] unsigned char var_1_22 = 0; [L40] signed short int var_1_23 = 64; [L41] signed short int var_1_24 = 25; [L42] signed short int var_1_25 = 0; [L43] signed short int last_1_var_1_12 = 2; [L44] signed long int last_1_var_1_13 = -256; [L45] double last_1_var_1_14 = 127.75; [L46] unsigned char last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L137] isInitial = 1 [L138] FCALL initially() [L139] int k_loop; [L140] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L140] COND TRUE k_loop < 1 [L141] CALL updateLastVariables() [L127] last_1_var_1_12 = var_1_12 [L128] last_1_var_1_13 = var_1_13 [L129] last_1_var_1_14 = var_1_14 [L130] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L141] RET updateLastVariables() [L142] CALL updateVariables() [L92] var_1_3 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_3 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L93] RET assume_abort_if_not(var_1_3 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L94] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L94] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L95] var_1_4 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L96] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L97] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L97] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L98] var_1_5 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25, var_1_9=7997/8] [L99] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25, var_1_9=7997/8] [L100] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25, var_1_9=7997/8] [L100] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25, var_1_9=7997/8] [L101] var_1_9 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L102] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L103] var_1_11 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L104] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L105] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L105] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L106] var_1_15 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L107] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L108] var_1_17 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L109] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L110] var_1_18 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L111] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L112] var_1_19 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L113] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L114] var_1_20 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L115] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L116] var_1_22 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L117] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L118] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L118] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L119] var_1_24 = __VERIFIER_nondet_short() [L120] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L120] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L121] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L121] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L122] var_1_25 = __VERIFIER_nondet_short() [L123] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L123] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L124] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L124] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L142] RET updateVariables() [L143] CALL step() [L50] COND FALSE !(\read(last_1_var_1_21)) [L53] var_1_1 = (var_1_3 && var_1_5) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L55] COND TRUE var_1_18 > var_1_9 [L56] var_1_23 = (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L60] signed long int stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_0=2, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L61] COND TRUE last_1_var_1_12 >= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=25] [L62] COND TRUE (var_1_9 - 1.00000000000025E12) >= last_1_var_1_14 [L63] var_1_6 = 200 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L70] unsigned short int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_1=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L71] COND FALSE !(var_1_11 > stepLocal_1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L74] EXPR var_1_11 >> var_1_6 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L74] COND TRUE (var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12) [L75] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L79] var_1_16 = (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))))) [L80] unsigned short int stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_3=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L81] COND FALSE !(stepLocal_3 == var_1_6) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L84] unsigned short int stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_2=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L85] COND FALSE !(stepLocal_2 == var_1_12) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L143] RET step() [L144] CALL, EXPR property() [L133] EXPR ((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L133-L134] return (((((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15)))) && (var_1_16 == ((float) (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))))))))) && ((var_1_11 == var_1_6) ? (var_1_21 == ((unsigned char) ((var_1_5 || var_1_3) && (var_1_1 || var_1_22)))) : 1)) && ((var_1_18 > var_1_9) ? (var_1_23 == ((signed short int) (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))))) : (var_1_23 == ((signed short int) (last_1_var_1_13 + 1)))) ; [L144] RET, EXPR property() [L144] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=-255, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=-255, var_1_6=200] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 6, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 428 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 428 mSDsluCounter, 1506 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 879 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 311 IncrementalHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 627 mSDtfsCounter, 311 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=435occurred in iteration=4, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 5 MinimizatonAttempts, 378 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 957 NumberOfCodeBlocks, 957 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 678 ConstructedInterpolants, 0 QuantifiedInterpolants, 1182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 3800/3800 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-11-13 14:05:16,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/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: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-35.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd --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 fcbb8ac143b8a67ade9889ff8d88b7d2d6babdf5f8c61bca7ac82a80bc9d336c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:05:19,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:05:19,366 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:05:19,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:05:19,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:05:19,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:05:19,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:05:19,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:05:19,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:05:19,431 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:05:19,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:05:19,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:05:19,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:05:19,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:05:19,433 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:05:19,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:05:19,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:05:19,433 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:05:19,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:05:19,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:05:19,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:05:19,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:05:19,434 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:05:19,434 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:05:19,434 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:05:19,434 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:05:19,434 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:05:19,434 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:05:19,434 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:05:19,434 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:05:19,435 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:05:19,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:05:19,435 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:05:19,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:05:19,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:05:19,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:05:19,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:05:19,437 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:05:19,437 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:05:19,437 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:05:19,437 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:05:19,437 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:05:19,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:05:19,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:05:19,438 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd 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 -> fcbb8ac143b8a67ade9889ff8d88b7d2d6babdf5f8c61bca7ac82a80bc9d336c [2024-11-13 14:05:19,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:05:19,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:05:19,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:05:19,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:05:19,880 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:05:19,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-35.i Unable to find full path for "g++" [2024-11-13 14:05:22,003 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:05:22,313 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:05:22,313 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-35.i [2024-11-13 14:05:22,324 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/data/73cb084cd/23f60e5941a44ec1bd5de37cb9e2f0a4/FLAG1b2865376 [2024-11-13 14:05:22,584 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/data/73cb084cd/23f60e5941a44ec1bd5de37cb9e2f0a4 [2024-11-13 14:05:22,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:05:22,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:05:22,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:05:22,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:05:22,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:05:22,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:05:22" (1/1) ... [2024-11-13 14:05:22,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50aad52e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:22, skipping insertion in model container [2024-11-13 14:05:22,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:05:22" (1/1) ... [2024-11-13 14:05:22,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:05:22,817 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-35.i[915,928] [2024-11-13 14:05:22,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:05:22,952 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:05:22,967 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-35.i[915,928] [2024-11-13 14:05:23,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:05:23,062 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:05:23,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:23 WrapperNode [2024-11-13 14:05:23,063 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:05:23,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:05:23,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:05:23,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:05:23,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:23" (1/1) ... [2024-11-13 14:05:23,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:23" (1/1) ... [2024-11-13 14:05:23,153 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-11-13 14:05:23,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:05:23,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:05:23,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:05:23,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:05:23,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:23" (1/1) ... [2024-11-13 14:05:23,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:23" (1/1) ... [2024-11-13 14:05:23,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:23" (1/1) ... [2024-11-13 14:05:23,204 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 14:05:23,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:23" (1/1) ... [2024-11-13 14:05:23,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:23" (1/1) ... [2024-11-13 14:05:23,215 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:23" (1/1) ... [2024-11-13 14:05:23,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:23" (1/1) ... [2024-11-13 14:05:23,222 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:23" (1/1) ... [2024-11-13 14:05:23,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:23" (1/1) ... [2024-11-13 14:05:23,229 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:05:23,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:05:23,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:05:23,234 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:05:23,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:23" (1/1) ... [2024-11-13 14:05:23,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:05:23,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:05:23,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:05:23,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:05:23,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:05:23,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:05:23,322 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:05:23,322 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:05:23,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:05:23,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:05:23,428 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:05:23,430 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:05:26,122 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-13 14:05:26,122 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:05:26,135 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:05:26,136 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:05:26,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:05:26 BoogieIcfgContainer [2024-11-13 14:05:26,137 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:05:26,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:05:26,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:05:26,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:05:26,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:05:22" (1/3) ... [2024-11-13 14:05:26,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f41e276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:05:26, skipping insertion in model container [2024-11-13 14:05:26,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:23" (2/3) ... [2024-11-13 14:05:26,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f41e276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:05:26, skipping insertion in model container [2024-11-13 14:05:26,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:05:26" (3/3) ... [2024-11-13 14:05:26,150 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-35.i [2024-11-13 14:05:26,169 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:05:26,170 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-35.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:05:26,249 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:05:26,267 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;@6fee63ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:05:26,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:05:26,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 14:05:26,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 14:05:26,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:26,290 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:05:26,291 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:26,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:26,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1329123436, now seen corresponding path program 1 times [2024-11-13 14:05:26,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:05:26,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818970628] [2024-11-13 14:05:26,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:26,314 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-11-13 14:05:26,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:05:26,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/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-11-13 14:05:26,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/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-11-13 14:05:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:26,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 14:05:26,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:05:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-13 14:05:26,938 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:05:26,939 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:05:26,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818970628] [2024-11-13 14:05:26,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818970628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:05:26,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:05:26,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:05:26,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437397216] [2024-11-13 14:05:26,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:05:26,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:05:26,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:05:26,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:05:26,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:05:26,974 INFO L87 Difference]: Start difference. First operand has 65 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 14:05:27,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:27,009 INFO L93 Difference]: Finished difference Result 127 states and 209 transitions. [2024-11-13 14:05:27,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:05:27,011 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2024-11-13 14:05:27,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:27,018 INFO L225 Difference]: With dead ends: 127 [2024-11-13 14:05:27,018 INFO L226 Difference]: Without dead ends: 61 [2024-11-13 14:05:27,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-11-13 14:05:27,026 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:27,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:05:27,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-13 14:05:27,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-13 14:05:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 14:05:27,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2024-11-13 14:05:27,072 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 89 transitions. Word has length 133 [2024-11-13 14:05:27,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:27,073 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 89 transitions. [2024-11-13 14:05:27,073 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 14:05:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 89 transitions. [2024-11-13 14:05:27,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 14:05:27,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:27,077 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:05:27,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/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-11-13 14:05:27,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/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-11-13 14:05:27,278 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:27,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:27,279 INFO L85 PathProgramCache]: Analyzing trace with hash 863820132, now seen corresponding path program 1 times [2024-11-13 14:05:27,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:05:27,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248237775] [2024-11-13 14:05:27,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:27,281 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-11-13 14:05:27,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:05:27,283 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/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-11-13 14:05:27,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/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-11-13 14:05:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:27,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:05:27,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:05:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:05:28,544 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:05:28,544 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:05:28,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248237775] [2024-11-13 14:05:28,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248237775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:05:28,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:05:28,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:05:28,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241541869] [2024-11-13 14:05:28,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:05:28,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:05:28,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:05:28,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:05:28,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:05:28,552 INFO L87 Difference]: Start difference. First operand 61 states and 89 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:05:30,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:05:31,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:05:31,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:31,786 INFO L93 Difference]: Finished difference Result 196 states and 288 transitions. [2024-11-13 14:05:31,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:05:31,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-13 14:05:31,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:31,802 INFO L225 Difference]: With dead ends: 196 [2024-11-13 14:05:31,802 INFO L226 Difference]: Without dead ends: 138 [2024-11-13 14:05:31,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:05:31,804 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 88 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:31,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 275 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-13 14:05:31,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-13 14:05:31,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 117. [2024-11-13 14:05:31,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 74 states have internal predecessors, (93), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 14:05:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 173 transitions. [2024-11-13 14:05:31,842 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 173 transitions. Word has length 133 [2024-11-13 14:05:31,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:31,843 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 173 transitions. [2024-11-13 14:05:31,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:05:31,844 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 173 transitions. [2024-11-13 14:05:31,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 14:05:31,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:31,846 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:05:31,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/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-11-13 14:05:32,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/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-11-13 14:05:32,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:32,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:32,048 INFO L85 PathProgramCache]: Analyzing trace with hash -416043546, now seen corresponding path program 1 times [2024-11-13 14:05:32,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:05:32,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007507581] [2024-11-13 14:05:32,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:32,049 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-11-13 14:05:32,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:05:32,051 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/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-11-13 14:05:32,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/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-11-13 14:05:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:32,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:05:32,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:05:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:05:33,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:05:33,192 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:05:33,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007507581] [2024-11-13 14:05:33,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2007507581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:05:33,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:05:33,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:05:33,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554168] [2024-11-13 14:05:33,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:05:33,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:05:33,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:05:33,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:05:33,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:05:33,197 INFO L87 Difference]: Start difference. First operand 117 states and 173 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:05:35,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:05:36,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:36,733 INFO L93 Difference]: Finished difference Result 369 states and 546 transitions. [2024-11-13 14:05:36,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:05:36,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-13 14:05:36,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:36,758 INFO L225 Difference]: With dead ends: 369 [2024-11-13 14:05:36,759 INFO L226 Difference]: Without dead ends: 255 [2024-11-13 14:05:36,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:05:36,761 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 70 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:36,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 311 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-13 14:05:36,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-13 14:05:36,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 229. [2024-11-13 14:05:36,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 144 states have (on average 1.25) internal successors, (180), 144 states have internal predecessors, (180), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-13 14:05:36,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 340 transitions. [2024-11-13 14:05:36,822 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 340 transitions. Word has length 133 [2024-11-13 14:05:36,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:36,823 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 340 transitions. [2024-11-13 14:05:36,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:05:36,823 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 340 transitions. [2024-11-13 14:05:36,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 14:05:36,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:36,826 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:05:36,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/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)] Ended with exit code 0 [2024-11-13 14:05:37,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/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-11-13 14:05:37,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:37,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:37,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1840706803, now seen corresponding path program 1 times [2024-11-13 14:05:37,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:05:37,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042938152] [2024-11-13 14:05:37,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:37,029 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-11-13 14:05:37,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:05:37,031 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/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-11-13 14:05:37,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/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-11-13 14:05:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:37,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:05:37,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:05:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:05:37,643 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:05:37,643 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:05:37,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042938152] [2024-11-13 14:05:37,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042938152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:05:37,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:05:37,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:05:37,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754459055] [2024-11-13 14:05:37,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:05:37,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:05:37,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:05:37,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:05:37,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:05:37,647 INFO L87 Difference]: Start difference. First operand 229 states and 340 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:05:40,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:05:41,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:05:43,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:05:44,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:44,782 INFO L93 Difference]: Finished difference Result 569 states and 840 transitions. [2024-11-13 14:05:44,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:05:44,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134 [2024-11-13 14:05:44,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:44,800 INFO L225 Difference]: With dead ends: 569 [2024-11-13 14:05:44,801 INFO L226 Difference]: Without dead ends: 511 [2024-11-13 14:05:44,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:05:44,807 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 139 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:44,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 313 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2024-11-13 14:05:44,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-13 14:05:44,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 289. [2024-11-13 14:05:44,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 188 states have (on average 1.2553191489361701) internal successors, (236), 190 states have internal predecessors, (236), 94 states have call successors, (94), 6 states have call predecessors, (94), 6 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-13 14:05:44,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 424 transitions. [2024-11-13 14:05:44,933 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 424 transitions. Word has length 134 [2024-11-13 14:05:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:44,935 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 424 transitions. [2024-11-13 14:05:44,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:05:44,935 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 424 transitions. [2024-11-13 14:05:44,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 14:05:44,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:44,942 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:05:44,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/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-11-13 14:05:45,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/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-11-13 14:05:45,143 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:45,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:45,143 INFO L85 PathProgramCache]: Analyzing trace with hash -679253131, now seen corresponding path program 1 times [2024-11-13 14:05:45,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:05:45,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581051612] [2024-11-13 14:05:45,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:45,144 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-11-13 14:05:45,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:05:45,146 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/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-11-13 14:05:45,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089d7861-970f-4476-bb0e-1420517407ba/bin/uautomizer-verify-qhAvR1uOyd/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-11-13 14:05:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:45,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 14:05:45,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:07:25,661 WARN L286 SmtUtils]: Spent 8.93s on a formula simplification that was a NOOP. DAG size: 102 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:08:33,283 WARN L286 SmtUtils]: Spent 11.33s on a formula simplification that was a NOOP. DAG size: 105 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:09:34,874 WARN L286 SmtUtils]: Spent 12.35s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:09:49,549 WARN L286 SmtUtils]: Spent 5.44s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:10:28,573 WARN L286 SmtUtils]: Spent 7.51s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:10:33,602 WARN L286 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:10:40,558 WARN L286 SmtUtils]: Spent 6.95s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:10:48,791 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:10:55,566 WARN L286 SmtUtils]: Spent 6.77s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:11:05,512 WARN L286 SmtUtils]: Spent 6.24s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:11:14,154 WARN L286 SmtUtils]: Spent 6.57s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:11:21,002 WARN L286 SmtUtils]: Spent 6.85s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:11:29,092 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:11:34,261 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:11:39,443 WARN L286 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:11:45,548 WARN L286 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:12:06,849 WARN L286 SmtUtils]: Spent 5.97s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:12:24,347 WARN L286 SmtUtils]: Spent 6.60s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:17:17,371 WARN L286 SmtUtils]: Spent 2.37m on a formula simplification that was a NOOP. DAG size: 145 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:17:51,944 WARN L286 SmtUtils]: Spent 6.39s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:18:06,092 WARN L286 SmtUtils]: Spent 6.72s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:18:11,455 WARN L286 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:18:19,255 WARN L286 SmtUtils]: Spent 7.80s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:18:24,914 WARN L286 SmtUtils]: Spent 5.66s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:18:31,618 WARN L286 SmtUtils]: Spent 6.70s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:18:39,745 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:18:46,862 WARN L286 SmtUtils]: Spent 7.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:19:05,292 WARN L286 SmtUtils]: Spent 6.84s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:19:11,935 WARN L286 SmtUtils]: Spent 6.64s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:19:20,052 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:19:26,963 WARN L286 SmtUtils]: Spent 6.91s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:19:33,025 WARN L286 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:19:38,631 WARN L286 SmtUtils]: Spent 5.61s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)