./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.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_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 d4fe8f11f0c68d7bafb86f3d9a757ae2e080a2c1f07f1d7545768deda82695bc --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:53:47,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:53:47,610 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 12:53:47,619 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:53:47,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:53:47,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:53:47,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:53:47,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:53:47,652 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:53:47,652 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:53:47,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:53:47,652 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:53:47,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:53:47,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:53:47,653 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:53:47,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:53:47,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:53:47,653 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:53:47,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:53:47,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:53:47,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:53:47,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:53:47,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:53:47,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:53:47,654 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:53:47,654 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:53:47,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:53:47,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:53:47,658 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:53:47,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:53:47,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:53:47,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:53:47,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:53:47,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:53:47,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:53:47,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:53:47,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:53:47,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:53:47,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:53:47,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:53:47,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:53:47,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:53:47,661 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_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 -> d4fe8f11f0c68d7bafb86f3d9a757ae2e080a2c1f07f1d7545768deda82695bc [2024-11-13 12:53:48,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:53:48,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:53:48,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:53:48,031 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:53:48,031 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:53:48,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.i Unable to find full path for "g++" [2024-11-13 12:53:50,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:53:50,510 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:53:50,510 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.i [2024-11-13 12:53:50,520 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/data/dfc03d1ab/99cb65bcdbb5436f84e43e064cf73d10/FLAGd94ad2962 [2024-11-13 12:53:50,535 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/data/dfc03d1ab/99cb65bcdbb5436f84e43e064cf73d10 [2024-11-13 12:53:50,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:53:50,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:53:50,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:53:50,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:53:50,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:53:50,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:53:50" (1/1) ... [2024-11-13 12:53:50,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e8d567e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:53:50, skipping insertion in model container [2024-11-13 12:53:50,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:53:50" (1/1) ... [2024-11-13 12:53:50,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:53:50,741 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_67f663ef-020b-4b22-aa48-c85e48ab77ae/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.i[915,928] [2024-11-13 12:53:50,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:53:50,804 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:53:50,815 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_67f663ef-020b-4b22-aa48-c85e48ab77ae/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.i[915,928] [2024-11-13 12:53:50,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:53:50,863 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:53:50,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:53:50 WrapperNode [2024-11-13 12:53:50,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:53:50,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:53:50,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:53:50,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:53:50,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:53:50" (1/1) ... [2024-11-13 12:53:50,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:53:50" (1/1) ... [2024-11-13 12:53:50,931 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-11-13 12:53:50,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:53:50,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:53:50,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:53:50,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:53:50,952 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:53:50" (1/1) ... [2024-11-13 12:53:50,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:53:50" (1/1) ... [2024-11-13 12:53:50,955 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:53:50" (1/1) ... [2024-11-13 12:53:50,976 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 12:53:50,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:53:50" (1/1) ... [2024-11-13 12:53:50,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:53:50" (1/1) ... [2024-11-13 12:53:50,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:53:50" (1/1) ... [2024-11-13 12:53:50,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:53:50" (1/1) ... [2024-11-13 12:53:50,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:53:50" (1/1) ... [2024-11-13 12:53:50,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:53:50" (1/1) ... [2024-11-13 12:53:50,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:53:50,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:53:50,992 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:53:50,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:53:50,997 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:53:50" (1/1) ... [2024-11-13 12:53:51,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:53:51,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:53:51,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:53:51,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:53:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:53:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 12:53:51,083 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 12:53:51,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:53:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:53:51,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:53:51,197 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:53:51,199 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:53:51,636 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-13 12:53:51,636 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:53:51,656 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:53:51,656 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 12:53:51,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:53:51 BoogieIcfgContainer [2024-11-13 12:53:51,657 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:53:51,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:53:51,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:53:51,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:53:51,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:53:50" (1/3) ... [2024-11-13 12:53:51,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34320d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:53:51, skipping insertion in model container [2024-11-13 12:53:51,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:53:50" (2/3) ... [2024-11-13 12:53:51,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34320d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:53:51, skipping insertion in model container [2024-11-13 12:53:51,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:53:51" (3/3) ... [2024-11-13 12:53:51,669 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-18.i [2024-11-13 12:53:51,688 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:53:51,690 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-18.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 12:53:51,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:53:51,787 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;@1d91d853, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:53:51,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 12:53:51,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 12:53:51,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 12:53:51,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:53:51,804 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:51,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:53:51,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:53:51,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1526359180, now seen corresponding path program 1 times [2024-11-13 12:53:51,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:53:51,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350379816] [2024-11-13 12:53:51,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:53:51,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:53:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:52,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:53:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:52,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:53:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:52,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:53:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:52,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:53:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:52,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:53:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:52,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:53:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:52,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:53:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:52,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 12:53:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:52,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:53:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:52,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 12:53:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:52,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:53:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:52,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:53:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:52,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:53:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:52,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 12:53:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:52,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 12:53:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:52,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 12:53:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 12:53:52,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:53:52,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350379816] [2024-11-13 12:53:52,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350379816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:53:52,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:53:52,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:53:52,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820147368] [2024-11-13 12:53:52,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:53:52,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 12:53:52,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:53:52,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 12:53:52,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 12:53:52,373 INFO L87 Difference]: Start difference. First operand has 61 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 12:53:52,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:53:52,415 INFO L93 Difference]: Finished difference Result 115 states and 192 transitions. [2024-11-13 12:53:52,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:53:52,419 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2024-11-13 12:53:52,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:53:52,428 INFO L225 Difference]: With dead ends: 115 [2024-11-13 12:53:52,428 INFO L226 Difference]: Without dead ends: 57 [2024-11-13 12:53:52,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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 12:53:52,436 INFO L432 NwaCegarLoop]: 84 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, 84 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 12:53:52,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:53:52,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-13 12:53:52,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-13 12:53:52,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 12:53:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2024-11-13 12:53:52,500 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 106 [2024-11-13 12:53:52,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:53:52,502 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2024-11-13 12:53:52,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 12:53:52,503 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2024-11-13 12:53:52,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 12:53:52,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:53:52,508 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:52,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:53:52,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:53:52,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:53:52,510 INFO L85 PathProgramCache]: Analyzing trace with hash 662536716, now seen corresponding path program 1 times [2024-11-13 12:53:52,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:53:52,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179843712] [2024-11-13 12:53:52,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:53:52,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:53:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:53,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:53:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:53,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:53:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:53,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:53:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:53,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:53:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:53,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:53:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:53,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:53:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:53,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:53:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:53,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 12:53:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:53,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:53:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:53,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 12:53:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:53,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:53:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:53,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:53:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:53,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:53:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:53,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 12:53:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:53,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 12:53:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:53,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 12:53:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 12:53:53,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:53:53,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179843712] [2024-11-13 12:53:53,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179843712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:53:53,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:53:53,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:53:53,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161355039] [2024-11-13 12:53:53,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:53:53,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:53:53,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:53:53,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:53:53,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:53:53,416 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 12:53:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:53:53,736 INFO L93 Difference]: Finished difference Result 166 states and 247 transitions. [2024-11-13 12:53:53,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:53:53,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2024-11-13 12:53:53,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:53:53,740 INFO L225 Difference]: With dead ends: 166 [2024-11-13 12:53:53,740 INFO L226 Difference]: Without dead ends: 112 [2024-11-13 12:53:53,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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 12:53:53,742 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 62 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:53:53,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 199 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:53:53,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-13 12:53:53,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2024-11-13 12:53:53,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 68 states have internal predecessors, (88), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 12:53:53,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2024-11-13 12:53:53,771 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 106 [2024-11-13 12:53:53,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:53:53,772 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2024-11-13 12:53:53,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 12:53:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2024-11-13 12:53:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 12:53:53,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:53:53,775 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:53,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:53:53,776 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:53:53,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:53:53,776 INFO L85 PathProgramCache]: Analyzing trace with hash -317674954, now seen corresponding path program 1 times [2024-11-13 12:53:53,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:53:53,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076290782] [2024-11-13 12:53:53,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:53:53,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:53:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:54,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:53:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:54,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:53:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:54,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:53:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:54,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:53:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:54,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:53:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:54,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:53:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:54,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:53:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:54,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 12:53:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:54,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:53:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:54,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 12:53:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:54,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:53:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:54,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:53:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:54,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:53:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:54,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 12:53:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:54,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 12:53:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:54,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 12:53:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 12:53:54,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:53:54,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076290782] [2024-11-13 12:53:54,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076290782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:53:54,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:53:54,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:53:54,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316904201] [2024-11-13 12:53:54,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:53:54,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:53:54,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:53:54,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:53:54,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:53:54,372 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 12:53:54,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:53:54,538 INFO L93 Difference]: Finished difference Result 188 states and 277 transitions. [2024-11-13 12:53:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:53:54,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-11-13 12:53:54,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:53:54,543 INFO L225 Difference]: With dead ends: 188 [2024-11-13 12:53:54,544 INFO L226 Difference]: Without dead ends: 125 [2024-11-13 12:53:54,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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 12:53:54,549 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 32 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:53:54,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 169 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:53:54,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-13 12:53:54,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 101. [2024-11-13 12:53:54,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 states have internal predecessors, (83), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 12:53:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2024-11-13 12:53:54,597 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 110 [2024-11-13 12:53:54,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:53:54,599 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2024-11-13 12:53:54,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 12:53:54,599 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2024-11-13 12:53:54,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 12:53:54,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:53:54,603 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:54,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 12:53:54,604 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:53:54,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:53:54,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1038092201, now seen corresponding path program 1 times [2024-11-13 12:53:54,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:53:54,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480179362] [2024-11-13 12:53:54,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:53:54,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:53:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:55,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:53:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:55,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:53:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:55,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:53:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:55,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:53:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:55,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:53:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:55,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:53:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:55,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:53:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:55,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 12:53:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:55,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:53:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:55,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 12:53:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:55,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:53:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:55,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:53:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:55,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:53:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:55,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 12:53:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:55,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 12:53:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:55,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 12:53:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 12:53:55,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:53:55,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480179362] [2024-11-13 12:53:55,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480179362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:53:55,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:53:55,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:53:55,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855086061] [2024-11-13 12:53:55,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:53:55,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:53:55,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:53:55,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:53:55,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:53:55,926 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 12:53:56,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:53:56,261 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2024-11-13 12:53:56,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:53:56,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-11-13 12:53:56,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:53:56,263 INFO L225 Difference]: With dead ends: 192 [2024-11-13 12:53:56,263 INFO L226 Difference]: Without dead ends: 125 [2024-11-13 12:53:56,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:53:56,265 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 57 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:53:56,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 193 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:53:56,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-13 12:53:56,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2024-11-13 12:53:56,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 82 states have internal predecessors, (105), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 12:53:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2024-11-13 12:53:56,292 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 111 [2024-11-13 12:53:56,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:53:56,293 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2024-11-13 12:53:56,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 12:53:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2024-11-13 12:53:56,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 12:53:56,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:53:56,295 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:56,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:53:56,296 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:53:56,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:53:56,296 INFO L85 PathProgramCache]: Analyzing trace with hash -77414563, now seen corresponding path program 1 times [2024-11-13 12:53:56,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:53:56,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498429380] [2024-11-13 12:53:56,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:53:56,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:53:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 12:53:56,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1751071625] [2024-11-13 12:53:56,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:53:56,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:53:56,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:53:56,431 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:53:56,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 12:53:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:53:56,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:53:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:53:56,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:53:56,719 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 12:53:56,720 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 12:53:56,744 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 12:53:56,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:53:56,929 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-13 12:53:57,012 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 12:53:57,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 12:53:57 BoogieIcfgContainer [2024-11-13 12:53:57,019 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 12:53:57,020 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 12:53:57,020 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 12:53:57,020 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 12:53:57,021 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:53:51" (3/4) ... [2024-11-13 12:53:57,023 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 12:53:57,025 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 12:53:57,026 INFO L158 Benchmark]: Toolchain (without parser) took 6487.23ms. Allocated memory is still 142.6MB. Free memory was 118.9MB in the beginning and 54.2MB in the end (delta: 64.7MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. [2024-11-13 12:53:57,026 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 142.6MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:53:57,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.82ms. Allocated memory is still 142.6MB. Free memory was 118.9MB in the beginning and 106.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:53:57,027 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.45ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 104.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:53:57,028 INFO L158 Benchmark]: Boogie Preprocessor took 59.21ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 102.4MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:53:57,029 INFO L158 Benchmark]: RCFGBuilder took 664.96ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 84.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 12:53:57,029 INFO L158 Benchmark]: TraceAbstraction took 5359.01ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 54.2MB in the end (delta: 29.9MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2024-11-13 12:53:57,029 INFO L158 Benchmark]: Witness Printer took 5.59ms. Allocated memory is still 142.6MB. Free memory was 54.2MB in the beginning and 54.2MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:53:57,032 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44ms. Allocated memory is still 142.6MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.82ms. Allocated memory is still 142.6MB. Free memory was 118.9MB in the beginning and 106.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.45ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 104.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.21ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 102.4MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 664.96ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 84.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5359.01ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 54.2MB in the end (delta: 29.9MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * Witness Printer took 5.59ms. Allocated memory is still 142.6MB. Free memory was 54.2MB in the beginning and 54.2MB in the end (delta: 27.0kB). 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 58, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of bitwiseOr at line 99, overapproximation of bitwiseOr at line 39. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 99.25; [L23] signed short int var_1_6 = 32; [L24] signed short int var_1_7 = 18477; [L25] signed short int var_1_8 = 5; [L26] float var_1_9 = 100.8; [L27] unsigned long int var_1_10 = 256; [L28] unsigned char var_1_11 = 0; [L29] unsigned char var_1_12 = 10; [L30] unsigned long int var_1_13 = 1879106797; [L31] unsigned long int var_1_14 = 1581421231; [L32] signed long int var_1_15 = -32; [L33] unsigned long int last_1_var_1_10 = 256; [L34] signed long int last_1_var_1_15 = -32; VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L95] last_1_var_1_10 = var_1_10 [L96] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L106] RET updateLastVariables() [L107] CALL updateVariables() [L69] var_1_6 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L70] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L71] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L71] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L72] var_1_7 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L73] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L74] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L74] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L75] var_1_8 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=504/5] [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=504/5] [L77] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=504/5] [L77] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=504/5] [L78] var_1_9 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L79] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L80] var_1_11 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L81] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L82] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L82] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L83] var_1_12 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L84] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L85] CALL assume_abort_if_not(var_1_12 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L85] RET assume_abort_if_not(var_1_12 <= 255) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L86] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L86] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L87] var_1_13 = __VERIFIER_nondet_ulong() [L88] CALL assume_abort_if_not(var_1_13 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L88] RET assume_abort_if_not(var_1_13 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L89] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L89] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L90] var_1_14 = __VERIFIER_nondet_ulong() [L91] CALL assume_abort_if_not(var_1_14 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L91] RET assume_abort_if_not(var_1_14 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L92] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L92] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L107] RET updateVariables() [L108] CALL step() [L38] unsigned long int stepLocal_1 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L39] EXPR last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=-1, var_1_7=16383, var_1_8=0] [L39] unsigned long int stepLocal_0 = last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10))); [L40] COND FALSE !(stepLocal_0 != last_1_var_1_10) [L45] var_1_1 = var_1_9 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=2] [L47] signed short int stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=-1, var_1_10=256, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=2] [L48] COND FALSE !(\read(var_1_11)) [L55] var_1_10 = var_1_7 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=-1, var_1_10=16383, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=2] [L57] unsigned long int stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=-1, stepLocal_3=16383, var_1_10=16383, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=2] [L58] COND FALSE !(var_1_1 <= var_1_9) [L65] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=-1, stepLocal_3=16383, var_1_10=16383, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=2] [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=2] [L99-L100] return ((((last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10)))) != last_1_var_1_10) ? ((last_1_var_1_10 == (var_1_6 - (var_1_7 - var_1_8))) ? (var_1_1 == ((float) var_1_9)) : 1) : (var_1_1 == ((float) var_1_9))) && (var_1_11 ? (((var_1_7 % var_1_12) >= var_1_6) ? (var_1_10 == ((unsigned long int) ((var_1_13 + var_1_14) - var_1_7))) : (var_1_10 == ((unsigned long int) var_1_12))) : (var_1_10 == ((unsigned long int) var_1_7)))) && ((var_1_1 <= var_1_9) ? ((var_1_10 > (last_1_var_1_15 + (var_1_10 + var_1_7))) ? (var_1_15 == ((signed long int) var_1_7)) : (var_1_15 == ((signed long int) -5))) : (var_1_15 == ((signed long int) var_1_7))) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=206, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=-1, var_1_7=16383, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 151 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 151 mSDsluCounter, 645 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 356 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 145 IncrementalHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 289 mSDtfsCounter, 145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=4, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 41 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 657 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 1167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1920/1920 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 12:53:57,069 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 d4fe8f11f0c68d7bafb86f3d9a757ae2e080a2c1f07f1d7545768deda82695bc --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:53:59,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:53:59,822 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 12:53:59,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:53:59,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:53:59,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:53:59,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:53:59,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:53:59,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:53:59,877 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:53:59,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:53:59,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:53:59,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:53:59,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:53:59,879 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:53:59,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:53:59,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:53:59,880 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:53:59,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:53:59,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:53:59,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:53:59,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:53:59,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:53:59,881 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 12:53:59,881 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 12:53:59,881 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:53:59,881 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 12:53:59,881 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:53:59,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:53:59,882 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:53:59,882 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:53:59,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:53:59,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:53:59,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:53:59,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:53:59,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:53:59,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:53:59,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:53:59,884 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 12:53:59,884 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 12:53:59,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:53:59,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:53:59,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:53:59,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:53:59,884 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_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 -> d4fe8f11f0c68d7bafb86f3d9a757ae2e080a2c1f07f1d7545768deda82695bc [2024-11-13 12:54:00,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:54:00,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:54:00,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:54:00,230 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:54:00,231 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:54:00,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.i Unable to find full path for "g++" [2024-11-13 12:54:02,164 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:54:02,419 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:54:02,419 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.i [2024-11-13 12:54:02,432 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/data/515e9868d/c9b4df7e66ad466581dc98b2fb4f141e/FLAG08d601fb0 [2024-11-13 12:54:02,756 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/data/515e9868d/c9b4df7e66ad466581dc98b2fb4f141e [2024-11-13 12:54:02,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:54:02,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:54:02,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:54:02,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:54:02,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:54:02,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:54:02" (1/1) ... [2024-11-13 12:54:02,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17fde6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:54:02, skipping insertion in model container [2024-11-13 12:54:02,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:54:02" (1/1) ... [2024-11-13 12:54:02,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:54:02,957 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_67f663ef-020b-4b22-aa48-c85e48ab77ae/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.i[915,928] [2024-11-13 12:54:03,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:54:03,045 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:54:03,060 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_67f663ef-020b-4b22-aa48-c85e48ab77ae/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-18.i[915,928] [2024-11-13 12:54:03,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:54:03,121 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:54:03,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:54:03 WrapperNode [2024-11-13 12:54:03,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:54:03,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:54:03,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:54:03,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:54:03,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:54:03" (1/1) ... [2024-11-13 12:54:03,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:54:03" (1/1) ... [2024-11-13 12:54:03,163 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-11-13 12:54:03,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:54:03,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:54:03,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:54:03,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:54:03,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:54:03" (1/1) ... [2024-11-13 12:54:03,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:54:03" (1/1) ... [2024-11-13 12:54:03,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:54:03" (1/1) ... [2024-11-13 12:54:03,186 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 12:54:03,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:54:03" (1/1) ... [2024-11-13 12:54:03,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:54:03" (1/1) ... [2024-11-13 12:54:03,197 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:54:03" (1/1) ... [2024-11-13 12:54:03,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:54:03" (1/1) ... [2024-11-13 12:54:03,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:54:03" (1/1) ... [2024-11-13 12:54:03,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:54:03" (1/1) ... [2024-11-13 12:54:03,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:54:03,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:54:03,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:54:03,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:54:03,212 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:54:03" (1/1) ... [2024-11-13 12:54:03,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:54:03,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:54:03,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:54:03,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:54:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:54:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 12:54:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 12:54:03,277 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 12:54:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:54:03,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:54:03,381 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:54:03,383 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:54:03,731 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-13 12:54:03,732 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:54:03,742 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:54:03,743 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 12:54:03,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:54:03 BoogieIcfgContainer [2024-11-13 12:54:03,743 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:54:03,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:54:03,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:54:03,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:54:03,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:54:02" (1/3) ... [2024-11-13 12:54:03,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d96396c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:54:03, skipping insertion in model container [2024-11-13 12:54:03,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:54:03" (2/3) ... [2024-11-13 12:54:03,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d96396c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:54:03, skipping insertion in model container [2024-11-13 12:54:03,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:54:03" (3/3) ... [2024-11-13 12:54:03,756 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-18.i [2024-11-13 12:54:03,776 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:54:03,777 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-18.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 12:54:03,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:54:03,879 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;@17ca7a82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:54:03,879 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 12:54:03,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 12:54:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 12:54:03,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:54:03,899 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:03,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:54:03,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:54:03,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1811369050, now seen corresponding path program 1 times [2024-11-13 12:54:03,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:54:03,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532065894] [2024-11-13 12:54:03,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:03,966 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 12:54:03,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:54:03,971 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 12:54:03,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 12:54:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:04,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 12:54:04,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:54:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2024-11-13 12:54:04,343 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:54:04,344 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:54:04,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532065894] [2024-11-13 12:54:04,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532065894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:54:04,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:54:04,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:54:04,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047443836] [2024-11-13 12:54:04,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:54:04,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 12:54:04,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:54:04,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 12:54:04,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 12:54:04,378 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 12:54:04,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:54:04,417 INFO L93 Difference]: Finished difference Result 95 states and 160 transitions. [2024-11-13 12:54:04,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:54:04,422 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2024-11-13 12:54:04,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:54:04,431 INFO L225 Difference]: With dead ends: 95 [2024-11-13 12:54:04,431 INFO L226 Difference]: Without dead ends: 47 [2024-11-13 12:54:04,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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 12:54:04,443 INFO L432 NwaCegarLoop]: 68 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, 68 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 12:54:04,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:54:04,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-13 12:54:04,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-13 12:54:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 12:54:04,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2024-11-13 12:54:04,495 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 102 [2024-11-13 12:54:04,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:54:04,495 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2024-11-13 12:54:04,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 12:54:04,496 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2024-11-13 12:54:04,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 12:54:04,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:54:04,501 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:04,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 12:54:04,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 12:54:04,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:54:04,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:54:04,703 INFO L85 PathProgramCache]: Analyzing trace with hash -843673306, now seen corresponding path program 1 times [2024-11-13 12:54:04,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:54:04,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334846165] [2024-11-13 12:54:04,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:04,703 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 12:54:04,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:54:04,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 12:54:04,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 12:54:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:04,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 12:54:04,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:54:06,077 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 12:54:06,077 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:54:06,077 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:54:06,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334846165] [2024-11-13 12:54:06,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334846165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:54:06,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:54:06,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:54:06,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573941861] [2024-11-13 12:54:06,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:54:06,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:54:06,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:54:06,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:54:06,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:54:06,081 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 12:54:06,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:54:06,569 INFO L93 Difference]: Finished difference Result 136 states and 199 transitions. [2024-11-13 12:54:06,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:54:06,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2024-11-13 12:54:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:54:06,575 INFO L225 Difference]: With dead ends: 136 [2024-11-13 12:54:06,576 INFO L226 Difference]: Without dead ends: 92 [2024-11-13 12:54:06,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 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 12:54:06,577 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 40 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:54:06,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 204 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:54:06,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-13 12:54:06,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2024-11-13 12:54:06,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 12:54:06,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 114 transitions. [2024-11-13 12:54:06,609 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 114 transitions. Word has length 102 [2024-11-13 12:54:06,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:54:06,610 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 114 transitions. [2024-11-13 12:54:06,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 12:54:06,612 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 114 transitions. [2024-11-13 12:54:06,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 12:54:06,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:54:06,616 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:06,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 12:54:06,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 12:54:06,817 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:54:06,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:54:06,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1167403971, now seen corresponding path program 1 times [2024-11-13 12:54:06,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:54:06,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187925863] [2024-11-13 12:54:06,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:06,818 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 12:54:06,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:54:06,820 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 12:54:06,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 12:54:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:07,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 12:54:07,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:54:08,579 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 252 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-13 12:54:08,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:54:09,089 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-13 12:54:09,090 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:54:09,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187925863] [2024-11-13 12:54:09,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187925863] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:54:09,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:54:09,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-13 12:54:09,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225814173] [2024-11-13 12:54:09,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:54:09,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 12:54:09,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:54:09,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 12:54:09,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:54:09,094 INFO L87 Difference]: Start difference. First operand 78 states and 114 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-13 12:54:10,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:54:10,717 INFO L93 Difference]: Finished difference Result 192 states and 260 transitions. [2024-11-13 12:54:10,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 12:54:10,718 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 103 [2024-11-13 12:54:10,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:54:10,720 INFO L225 Difference]: With dead ends: 192 [2024-11-13 12:54:10,721 INFO L226 Difference]: Without dead ends: 148 [2024-11-13 12:54:10,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=188, Invalid=318, Unknown=0, NotChecked=0, Total=506 [2024-11-13 12:54:10,725 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 153 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 12:54:10,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 197 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 12:54:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-13 12:54:10,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 113. [2024-11-13 12:54:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 69 states have internal predecessors, (78), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 12:54:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 154 transitions. [2024-11-13 12:54:10,775 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 154 transitions. Word has length 103 [2024-11-13 12:54:10,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:54:10,775 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 154 transitions. [2024-11-13 12:54:10,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-13 12:54:10,776 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 154 transitions. [2024-11-13 12:54:10,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 12:54:10,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:54:10,779 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:10,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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)] Forceful destruction successful, exit code 0 [2024-11-13 12:54:10,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 12:54:10,983 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:54:10,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:54:10,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1847462341, now seen corresponding path program 1 times [2024-11-13 12:54:10,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:54:10,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526639623] [2024-11-13 12:54:10,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:10,988 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 12:54:10,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:54:10,992 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 12:54:10,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 12:54:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:11,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 12:54:11,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:54:19,559 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 12:54:19,559 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:54:19,560 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:54:19,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526639623] [2024-11-13 12:54:19,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526639623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:54:19,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:54:19,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 12:54:19,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123801044] [2024-11-13 12:54:19,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:54:19,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:54:19,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:54:19,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:54:19,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:54:19,562 INFO L87 Difference]: Start difference. First operand 113 states and 154 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 12:54:20,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:54:20,750 INFO L93 Difference]: Finished difference Result 162 states and 214 transitions. [2024-11-13 12:54:20,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:54:20,754 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2024-11-13 12:54:20,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:54:20,761 INFO L225 Difference]: With dead ends: 162 [2024-11-13 12:54:20,761 INFO L226 Difference]: Without dead ends: 160 [2024-11-13 12:54:20,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-13 12:54:20,765 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 74 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 12:54:20,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 373 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 12:54:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-13 12:54:20,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 121. [2024-11-13 12:54:20,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 77 states have internal predecessors, (89), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 12:54:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 165 transitions. [2024-11-13 12:54:20,812 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 165 transitions. Word has length 103 [2024-11-13 12:54:20,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:54:20,815 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 165 transitions. [2024-11-13 12:54:20,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 12:54:20,815 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 165 transitions. [2024-11-13 12:54:20,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 12:54:20,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:54:20,820 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:20,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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)] Forceful destruction successful, exit code 0 [2024-11-13 12:54:21,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 12:54:21,024 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:54:21,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:54:21,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1594224436, now seen corresponding path program 1 times [2024-11-13 12:54:21,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:54:21,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201584037] [2024-11-13 12:54:21,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:21,025 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 12:54:21,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:54:21,027 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 12:54:21,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 12:54:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:21,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 12:54:21,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:54:21,811 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-11-13 12:54:21,811 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:54:22,218 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:54:22,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201584037] [2024-11-13 12:54:22,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [201584037] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:54:22,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523145134] [2024-11-13 12:54:22,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:22,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:54:22,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:54:22,222 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:54:22,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 12:54:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:22,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 12:54:22,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:54:22,878 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-11-13 12:54:22,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:54:23,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523145134] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:54:23,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:54:23,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-13 12:54:23,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449824030] [2024-11-13 12:54:23,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:54:23,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 12:54:23,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:54:23,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 12:54:23,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-13 12:54:23,148 INFO L87 Difference]: Start difference. First operand 121 states and 165 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 12:54:23,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:54:23,911 INFO L93 Difference]: Finished difference Result 233 states and 311 transitions. [2024-11-13 12:54:23,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 12:54:23,913 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2024-11-13 12:54:23,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:54:23,915 INFO L225 Difference]: With dead ends: 233 [2024-11-13 12:54:23,915 INFO L226 Difference]: Without dead ends: 162 [2024-11-13 12:54:23,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2024-11-13 12:54:23,920 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 65 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:54:23,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 289 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:54:23,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-13 12:54:23,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 130. [2024-11-13 12:54:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 84 states have (on average 1.1666666666666667) internal successors, (98), 85 states have internal predecessors, (98), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 12:54:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 174 transitions. [2024-11-13 12:54:23,946 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 174 transitions. Word has length 104 [2024-11-13 12:54:23,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:54:23,948 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 174 transitions. [2024-11-13 12:54:23,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 12:54:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 174 transitions. [2024-11-13 12:54:23,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 12:54:23,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:54:23,950 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:23,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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)] Ended with exit code 0 [2024-11-13 12:54:24,163 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 12:54:24,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:54:24,351 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:54:24,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:54:24,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1596071478, now seen corresponding path program 1 times [2024-11-13 12:54:24,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:54:24,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804004008] [2024-11-13 12:54:24,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:24,352 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 12:54:24,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:54:24,354 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 12:54:24,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67f663ef-020b-4b22-aa48-c85e48ab77ae/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 (8)] Waiting until timeout for monitored process [2024-11-13 12:54:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:24,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 12:54:24,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:54:32,975 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-11-13 12:54:32,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:59:47,942 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse30 ((_ sign_extend 16) c_~var_1_7~0))) (let ((.cse27 (= c_~var_1_10~0 .cse30))) (let ((.cse66 (or .cse27 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse216 ((_ sign_extend 16) ~var_1_6~0)) (.cse215 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem .cse30 .cse215) .cse216) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse216)) (not (= c_~var_1_10~0 .cse215))))))) (.cse67 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse214 ((_ sign_extend 16) ~var_1_6~0)) (.cse213 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem .cse30 .cse213) .cse214) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse214)) (= c_~var_1_10~0 .cse213)))) .cse27)) (.cse68 (or .cse27 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse212 ((_ sign_extend 16) ~var_1_6~0)) (.cse211 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem .cse30 .cse211) .cse212) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse212))) (= c_~var_1_10~0 .cse211)))))) (.cse71 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse210 ((_ sign_extend 16) ~var_1_6~0)) (.cse209 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem .cse30 .cse209) .cse210) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse210))) (not (= c_~var_1_10~0 .cse209))))) .cse27)) (.cse25 (fp.eq c_~var_1_1~0 c_~var_1_9~0))) (let ((.cse11 (= c_~last_1_var_1_10~0 (bvxor c_~last_1_var_1_15~0 c_~last_1_var_1_10~0))) (.cse29 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse208 ((_ zero_extend 24) ~var_1_12~0))) (or (not (bvsge (bvsrem .cse30 .cse208) ((_ sign_extend 16) ~var_1_6~0))) (not (= c_~var_1_10~0 .cse208)))))) (.cse10 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse206 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse207 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse30 .cse206) .cse207)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse207))))))) (not (= c_~var_1_10~0 .cse206)))))) (.cse26 (not .cse25)) (.cse65 (and .cse66 .cse67 .cse68 .cse71)) (.cse73 (= (_ bv0 8) c_~var_1_11~0)) (.cse170 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse205 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem .cse30 .cse205) ((_ sign_extend 16) ~var_1_6~0)) (not (= c_~var_1_10~0 .cse205)))))) (.cse173 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse203 ((_ zero_extend 24) ~var_1_12~0))) (or (not (= c_~var_1_10~0 .cse203)) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse204 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse30 .cse203) .cse204) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse204))))))))))) (.cse171 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse202 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse30 ((_ zero_extend 24) ~var_1_12~0)) .cse202) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse202)))))))) (.cse72 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse201 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem .cse30 .cse201) ((_ sign_extend 16) ~var_1_6~0)) (= c_~var_1_10~0 .cse201)))))) (let ((.cse41 (bvugt c_~var_1_10~0 (bvadd c_~var_1_10~0 c_~last_1_var_1_15~0 .cse30))) (.cse175 (and .cse171 .cse72)) (.cse176 (and (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse199 ((_ zero_extend 24) ~var_1_12~0))) (or (= c_~var_1_10~0 .cse199) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse200 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse30 .cse199) .cse200) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse200)))))))))) (or .cse72 .cse27) (or .cse170 .cse27) .cse173)) (.cse48 (not .cse73)) (.cse174 (and (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse195 ((_ zero_extend 24) ~var_1_12~0)) (.cse196 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse30 .cse195) .cse196) (= c_~var_1_10~0 .cse195) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse196))))))) (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse197 ((_ zero_extend 24) ~var_1_12~0)) (.cse198 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse30 .cse197) .cse198) (not (= c_~var_1_10~0 .cse197)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse198))))))))) (.cse91 (or .cse26 .cse65)) (.cse156 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse194 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse30 ((_ zero_extend 24) ~var_1_12~0)) .cse194) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse194))))))) (.cse33 (= c_~last_1_var_1_10~0 (bvxor c_~last_1_var_1_10~0 c_~last_1_var_1_10~0))) (.cse18 (fp.leq c_~var_1_1~0 c_~var_1_9~0)) (.cse93 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (bvsge (bvsrem .cse30 ((_ zero_extend 24) ~var_1_12~0)) ((_ sign_extend 16) ~var_1_6~0)))) (.cse22 (bvugt c_~last_1_var_1_15~0 c_~last_1_var_1_10~0)) (.cse81 (bvugt c_~var_1_10~0 (bvadd c_~var_1_10~0 c_~last_1_var_1_15~0 (_ bv4294967291 32)))) (.cse42 (and (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse190 ((_ zero_extend 24) ~var_1_12~0)) (.cse191 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse30 .cse190) .cse191)) (= c_~var_1_10~0 .cse190) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse191))))))) (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse192 ((_ zero_extend 24) ~var_1_12~0)) (.cse193 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse30 .cse192) .cse193)) (not (= c_~var_1_10~0 .cse192)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse193))))))))) (.cse4 (or .cse27 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse189 ((_ sign_extend 16) ~var_1_6~0)) (.cse188 ((_ zero_extend 24) ~var_1_12~0))) (or (not (bvsge (bvsrem .cse30 .cse188) .cse189)) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse189)) (= c_~var_1_10~0 .cse188)))))) (.cse6 (or .cse27 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse187 ((_ sign_extend 16) ~var_1_6~0)) (.cse186 ((_ zero_extend 24) ~var_1_12~0))) (or (not (bvsge (bvsrem .cse30 .cse186) .cse187)) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse187))) (= c_~var_1_10~0 .cse186)))))) (.cse123 (or .cse27 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse185 ((_ sign_extend 16) ~var_1_6~0)) (.cse184 ((_ zero_extend 24) ~var_1_12~0))) (or (not (bvsge (bvsrem .cse30 .cse184) .cse185)) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse185))) (not (= c_~var_1_10~0 .cse184))))))) (.cse124 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse183 ((_ sign_extend 16) ~var_1_6~0)) (.cse182 ((_ zero_extend 24) ~var_1_12~0))) (or (not (bvsge (bvsrem .cse30 .cse182) .cse183)) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse183)) (not (= c_~var_1_10~0 .cse182))))) .cse27)) (.cse40 (and (or .cse29 .cse27) .cse10 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse179 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse180 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse30 .cse179) .cse180)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse180))))))) (= c_~var_1_10~0 .cse179)))) (or .cse27 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse181 ((_ zero_extend 24) ~var_1_12~0))) (or (not (bvsge (bvsrem .cse30 .cse181) ((_ sign_extend 16) ~var_1_6~0))) (= c_~var_1_10~0 .cse181))))))) (.cse46 (= (_ bv0 32) (bvadd (_ bv5 32) .cse30))) (.cse3 (not .cse11)) (.cse28 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (not (bvsge (bvsrem .cse30 ((_ zero_extend 24) ~var_1_12~0)) ((_ sign_extend 16) ~var_1_6~0))))) (.cse43 (= (bvadd (_ bv5 32) c_~var_1_15~0) (_ bv0 32)))) (let ((.cse44 (not .cse43)) (.cse16 (or .cse3 .cse28)) (.cse9 (or .cse25 .cse28)) (.cse47 (not .cse46)) (.cse34 (or .cse40 .cse25)) (.cse8 (or .cse28 .cse73)) (.cse35 (or (and .cse4 .cse6 .cse123 .cse124) .cse26)) (.cse36 (or .cse42 .cse25)) (.cse79 (not .cse81)) (.cse96 (= (_ bv0 32) (bvadd c_~var_1_10~0 (_ bv5 32)))) (.cse24 (not .cse22)) (.cse70 (or .cse93 .cse25)) (.cse1 (not .cse18)) (.cse64 (or .cse3 .cse93)) (.cse0 (not .cse33)) (.cse37 (= c_~var_1_15~0 .cse30)) (.cse86 (or .cse25 .cse156 .cse73)) (.cse87 (or .cse48 (and (or .cse25 .cse174) .cse91))) (.cse90 (or .cse176 .cse25)) (.cse88 (or .cse175 .cse25)) (.cse89 (or .cse26 .cse72)) (.cse19 (not .cse41))) (and (or (let ((.cse5 (or .cse41 .cse28))) (let ((.cse13 (or .cse42 .cse19)) (.cse14 (or .cse19 .cse40)) (.cse15 (or .cse42 .cse41)) (.cse17 (or .cse40 .cse41)) (.cse7 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse38 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse39 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse30 .cse38) .cse39)) (forall ((~var_1_8~0 (_ BitVec 16))) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse39)))))) (not (= c_~var_1_10~0 .cse38)))))) (.cse2 (or .cse37 .cse28)) (.cse12 (and .cse5 .cse34 .cse8 .cse35 .cse36))) (and (or .cse0 (and (or .cse1 (and .cse2 (or .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)) (or .cse11 .cse12))) (or (and .cse13 .cse14 .cse15 .cse2 .cse8 .cse16 .cse17) .cse18))) (or (let ((.cse21 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse32 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse30 ((_ zero_extend 24) ~var_1_12~0)) .cse32)) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse32))))))) (.cse20 (and (or .cse27 .cse28) .cse29 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse31 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse30 ((_ zero_extend 24) ~var_1_12~0)) .cse31)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse31)))))))))) (and (or (and .cse2 (or .cse3 (and .cse15 .cse8 (or .cse19 .cse20) .cse17 (or .cse19 .cse21))) (or .cse11 (let ((.cse23 (and .cse13 .cse14 .cse15 .cse8 .cse17))) (and (or .cse22 .cse23) (or .cse23 .cse24))))) .cse18) (or (and (or (and .cse5 .cse8 (or .cse25 .cse21) (or .cse26 (and .cse4 .cse6 .cse7 .cse10)) (or .cse25 .cse20)) .cse3) .cse2 (or .cse11 (and (or .cse22 .cse12) (or .cse24 .cse12)))) .cse1))) .cse33)))) .cse43) (or .cse44 (let ((.cse75 (or .cse96 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse117 ((_ sign_extend 16) ~var_1_6~0)) (.cse116 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem (_ bv4294967291 32) .cse116) .cse117) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse117)) (= c_~var_1_10~0 .cse116)))))) (.cse76 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse114 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse115 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem (_ bv4294967291 32) .cse114) .cse115) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse115))))))) (not (= c_~var_1_10~0 .cse114)))))) (.cse77 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse112 ((_ zero_extend 24) ~var_1_12~0))) (or (not (= c_~var_1_10~0 .cse112)) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse113 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem (_ bv4294967291 32) .cse112) .cse113) (forall ((~var_1_8~0 (_ BitVec 16))) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse113)))))))))) (.cse78 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse110 ((_ zero_extend 24) ~var_1_12~0)) (.cse111 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem (_ bv4294967291 32) .cse110) .cse111) (= c_~var_1_10~0 .cse110) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse111)))))) .cse96))) (let ((.cse97 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse109 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem (_ bv4294967291 32) ((_ zero_extend 24) ~var_1_12~0)) .cse109) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse109))))))) (.cse80 (and .cse75 .cse76 .cse77 .cse78))) (let ((.cse106 (or .cse26 .cse80)) (.cse99 (or .cse25 .cse97))) (let ((.cse95 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse108 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse30 ((_ zero_extend 24) ~var_1_12~0)) .cse108) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse108)))))))) (.cse62 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse107 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse30 ((_ zero_extend 24) ~var_1_12~0)) .cse107) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse107))))))) (.cse85 (and .cse106 .cse99)) (.cse84 (and (or (and (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse105 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem (_ bv4294967291 32) ((_ zero_extend 24) ~var_1_12~0)) .cse105) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse105))))))) .cse96) .cse25) .cse106)) (.cse74 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse104 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem (_ bv4294967291 32) .cse104) ((_ sign_extend 16) ~var_1_6~0)) (= c_~var_1_10~0 .cse104)))))) (let ((.cse82 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse102 ((_ zero_extend 24) ~var_1_12~0))) (or (= c_~var_1_10~0 .cse102) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse103 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem (_ bv4294967291 32) .cse102) .cse103) (forall ((~var_1_8~0 (_ BitVec 16))) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse103)))))))))) (.cse83 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse100 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse101 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem (_ bv4294967291 32) .cse100) .cse101) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse101))))))) (= c_~var_1_10~0 .cse100))))) (.cse51 (or (let ((.cse98 (and .cse74 .cse99))) (and (or .cse79 .cse98) (or .cse81 .cse98))) .cse73)) (.cse52 (or .cse79 .cse84)) (.cse49 (or .cse79 .cse85)) (.cse54 (or (and (or .cse81 .cse25 .cse97) (or .cse79 .cse25 .cse97)) .cse73)) (.cse69 (or .cse19 .cse93)) (.cse92 (and (or .cse79 .cse62) (or .cse81 .cse62))) (.cse63 (and .cse95 (or .cse96 .cse93)))) (let ((.cse57 (or (let ((.cse94 (and .cse95 .cse72))) (and (or .cse81 .cse94) (or .cse94 .cse79))) .cse73)) (.cse58 (or .cse48 (and (or .cse81 .cse63) (or .cse79 .cse63)))) (.cse59 (or .cse92 .cse48)) (.cse61 (or .cse46 .cse93)) (.cse60 (or .cse92 .cse73)) (.cse45 (and .cse86 .cse87 (or (and .cse69 .cse88 .cse89) .cse73) (or .cse48 (and .cse69 .cse90 .cse91)))) (.cse55 (and .cse51 (or .cse48 (and .cse52 (or .cse81 .cse84))) (or (and .cse49 (or .cse81 .cse85)) .cse48) .cse54)) (.cse53 (or .cse81 (and .cse76 .cse82 .cse77 .cse25 .cse83))) (.cse50 (or .cse81 (and .cse76 .cse82 .cse77 .cse83)))) (and (or (and (or (and (or (and (or .cse45 .cse3) (or .cse11 (and (or .cse45 .cse24) (or .cse22 .cse45)))) .cse46) (or .cse47 (and (or (and (or .cse48 (and .cse49 .cse50)) .cse51 (or .cse48 (and .cse52 .cse53)) .cse54) .cse3) (or (and (or .cse55 .cse24) (or .cse22 .cse55)) .cse11)))) .cse1) (or (and (or (let ((.cse56 (and .cse57 .cse58 .cse59 .cse60))) (and (or .cse22 .cse56) (or .cse24 .cse56))) .cse11) .cse61 (or .cse3 (and .cse57 (or .cse48 .cse62) (or .cse48 .cse63) .cse60))) .cse18)) .cse33) (or .cse0 (and (or (and .cse57 .cse58 .cse59 .cse61 .cse64 .cse60) .cse18) (or (and (or .cse46 (and (or .cse45 .cse11) (or .cse3 (and (or .cse48 .cse65) (or (and .cse66 .cse67 .cse68 .cse69 .cse70 .cse71) .cse48) (or (and .cse69 .cse70 .cse72) .cse73))))) (or .cse47 (and (or .cse55 .cse11) (or (and (or (and .cse74 .cse25) .cse73) (or .cse48 (and (or (and .cse75 .cse76 .cse77 .cse25 .cse78) .cse79) .cse53)) (or (and .cse50 (or .cse79 .cse80)) .cse48)) .cse3)))) .cse1))))))))))) (or .cse44 (let ((.cse137 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse152 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse153 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem (_ bv4294967291 32) .cse152) .cse153)) (forall ((~var_1_8~0 (_ BitVec 16))) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse153)))))) (not (= c_~var_1_10~0 .cse152)))))) (.cse138 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse150 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse151 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem (_ bv4294967291 32) .cse150) .cse151)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse151))))))) (not (= c_~var_1_10~0 .cse150))))))) (let ((.cse128 (and .cse137 .cse138 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse147 ((_ sign_extend 16) ~var_1_6~0)) (.cse146 ((_ zero_extend 24) ~var_1_12~0))) (or (not (bvsge (bvsrem (_ bv4294967291 32) .cse146) .cse147)) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse147)) (= c_~var_1_10~0 .cse146)))) .cse96) (or .cse96 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse148 ((_ zero_extend 24) ~var_1_12~0)) (.cse149 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem (_ bv4294967291 32) .cse148) .cse149)) (= c_~var_1_10~0 .cse148) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse149)))))))))) (let ((.cse136 (and (or .cse128 .cse26) (or (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse145 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem (_ bv4294967291 32) ((_ zero_extend 24) ~var_1_12~0)) .cse145)) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse145)))))) .cse25))) (.cse131 (or .cse96 .cse28)) (.cse132 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse144 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse30 ((_ zero_extend 24) ~var_1_12~0)) .cse144)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse144))))))))) (let ((.cse134 (and .cse131 .cse132)) (.cse135 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse143 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse30 ((_ zero_extend 24) ~var_1_12~0)) .cse143)) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse143))))))) (.cse130 (or .cse79 .cse136)) (.cse125 (or .cse19 .cse28))) (let ((.cse126 (and .cse34 .cse8 .cse35 .cse36 .cse125)) (.cse127 (or .cse81 (and .cse137 .cse138 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse139 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse140 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem (_ bv4294967291 32) .cse139) .cse140)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse140))))))) (= c_~var_1_10~0 .cse139)))) (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse141 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse142 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem (_ bv4294967291 32) .cse141) .cse142)) (forall ((~var_1_8~0 (_ BitVec 16))) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse142)))))) (= c_~var_1_10~0 .cse141))))))) (.cse129 (and (or .cse81 .cse136) .cse130 .cse73)) (.cse119 (or .cse46 .cse28)) (.cse118 (or .cse81 .cse135)) (.cse120 (or .cse135 .cse79)) (.cse121 (or .cse81 .cse134)) (.cse122 (or .cse134 .cse79))) (and (or (and (or .cse18 (and .cse118 .cse119 .cse8 .cse120 .cse121 .cse16 .cse122)) (or (and (or .cse46 (and (or (and .cse4 .cse6 .cse8 .cse9 .cse123 .cse124 .cse125) .cse3) (or .cse126 .cse11))) (or .cse47 (and (or (and .cse127 (or .cse128 .cse79) .cse73) .cse3) (or .cse129 .cse11)))) .cse1)) .cse0) (or (and (or (and (or (and (or (and (or .cse22 .cse126) (or .cse126 .cse24)) .cse11) (or .cse3 .cse126)) .cse46) (or .cse47 (and (or .cse3 (and .cse127 .cse130 .cse73)) (or .cse11 (and (or .cse22 .cse129) (or .cse129 .cse24)))))) .cse1) (or (and .cse119 (or .cse3 (and .cse131 .cse8 .cse132)) (or .cse11 (let ((.cse133 (and .cse118 .cse8 .cse120 .cse121 .cse122))) (and (or .cse133 .cse24) (or .cse22 .cse133))))) .cse18)) .cse33)))))))) (or .cse43 (let ((.cse159 (or .cse93 .cse41))) (let ((.cse167 (or .cse41 .cse174)) (.cse169 (or .cse176 .cse41)) (.cse168 (or .cse19 .cse156)) (.cse172 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse177 ((_ zero_extend 24) ~var_1_12~0))) (or (not (= c_~var_1_10~0 .cse177)) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse178 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse30 .cse177) .cse178) (forall ((~var_1_8~0 (_ BitVec 16))) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse30)) .cse178)))))))))) (.cse160 (or (and .cse88 .cse89 .cse159) .cse73))) (let ((.cse154 (and .cse86 .cse87 (or (and .cse90 .cse91 .cse159) .cse48) .cse160)) (.cse161 (and .cse67 .cse68 .cse172 .cse173)) (.cse163 (or (and (or .cse41 .cse156) .cse168) .cse73)) (.cse164 (or .cse48 (and .cse169 (or .cse19 .cse176)))) (.cse155 (or .cse93 .cse37)) (.cse165 (or (and (or .cse175 .cse41) (or .cse175 .cse19)) .cse73)) (.cse166 (or (and (or .cse19 .cse174) .cse167) .cse48))) (and (or .cse33 (let ((.cse158 (and (or .cse93 .cse27) .cse170 .cse171))) (and (or (and (or (and (or .cse22 .cse154) (or .cse154 .cse24)) .cse11) .cse155 (or (let ((.cse157 (or .cse26 .cse161))) (and .cse86 (or .cse48 (and (or .cse25 .cse156) .cse157)) (or .cse48 (and (or .cse25 .cse158) .cse157 .cse159)) .cse160)) .cse3)) .cse1) (or (and (or .cse11 (let ((.cse162 (and .cse163 .cse164 .cse165 .cse166))) (and (or .cse22 .cse162) (or .cse24 .cse162)))) .cse155 (or (and (or .cse48 (and .cse167 .cse168)) .cse163 (or (and .cse169 (or .cse19 .cse158)) .cse48) .cse165) .cse3)) .cse18)))) (or (and (or (and .cse155 (or .cse154 .cse11) (or (and (or .cse48 (and .cse67 .cse68 .cse172 .cse70 .cse173 .cse159)) (or .cse48 .cse161) (or (and .cse70 .cse72 .cse159) .cse73)) .cse3)) .cse1) (or (and .cse163 .cse164 .cse155 .cse64 .cse165 .cse166) .cse18)) .cse0))))))))))))) is different from true [2024-11-13 13:04:44,081 WARN L286 SmtUtils]: Spent 3.28m on a formula simplification. DAG size of input: 359 DAG size of output: 357 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:07:47,340 WARN L286 SmtUtils]: Spent 1.24m on a formula simplification that was a NOOP. DAG size: 291 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)