./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-48.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 3477469bfd81314cf7d649c8adcd7fe214dd2065383578e89ca0f01d8a450671 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:53:25,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:53:25,207 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 21:53:25,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:53:25,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:53:25,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:53:25,271 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:53:25,271 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:53:25,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:53:25,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:53:25,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:53:25,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:53:25,283 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:53:25,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:53:25,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:53:25,287 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:53:25,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:53:25,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:53:25,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:53:25,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:53:25,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:53:25,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:53:25,290 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:53:25,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:53:25,293 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:53:25,294 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:53:25,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:53:25,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:53:25,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:25,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:53:25,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:53:25,298 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:53:25,299 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:53:25,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:53:25,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:53:25,299 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:53:25,300 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:53:25,300 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:53:25,300 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:53:25,300 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 3477469bfd81314cf7d649c8adcd7fe214dd2065383578e89ca0f01d8a450671 [2023-11-06 21:53:25,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:53:25,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:53:25,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:53:25,660 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:53:25,661 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:53:25,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-48.i [2023-11-06 21:53:28,874 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:53:29,131 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:53:29,132 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-48.i [2023-11-06 21:53:29,146 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/data/410581a98/cec40baa23be4c07a047eab93e9d0b2e/FLAGa9ec55e80 [2023-11-06 21:53:29,160 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/data/410581a98/cec40baa23be4c07a047eab93e9d0b2e [2023-11-06 21:53:29,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:53:29,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:53:29,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:29,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:53:29,172 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:53:29,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2804cfd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29, skipping insertion in model container [2023-11-06 21:53:29,173 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,233 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:53:29,444 WARN L240 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_5f49cfa0-2fb1-46c8-be88-0424f767be10/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-48.i[915,928] [2023-11-06 21:53:29,553 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:29,567 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:53:29,583 WARN L240 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_5f49cfa0-2fb1-46c8-be88-0424f767be10/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-48.i[915,928] [2023-11-06 21:53:29,657 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:29,682 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:53:29,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29 WrapperNode [2023-11-06 21:53:29,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:29,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:29,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:53:29,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:53:29,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,722 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,776 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2023-11-06 21:53:29,778 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:29,780 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:53:29,780 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:53:29,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:53:29,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:53:29,859 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:53:29,859 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:53:29,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:53:29,861 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:29,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:29,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:29,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:53:29,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:53:29,970 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:53:29,970 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:53:29,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:53:29,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:53:29,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:53:30,102 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:53:30,105 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:53:30,547 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:53:30,554 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:53:30,555 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:53:30,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:30 BoogieIcfgContainer [2023-11-06 21:53:30,557 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:53:30,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:53:30,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:53:30,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:53:30,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:53:29" (1/3) ... [2023-11-06 21:53:30,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196bd252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:30, skipping insertion in model container [2023-11-06 21:53:30,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (2/3) ... [2023-11-06 21:53:30,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196bd252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:30, skipping insertion in model container [2023-11-06 21:53:30,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:30" (3/3) ... [2023-11-06 21:53:30,569 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-48.i [2023-11-06 21:53:30,591 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:53:30,591 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:53:30,719 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:53:30,737 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@322905b8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:53:30,738 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:53:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 21:53:30,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-06 21:53:30,759 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:30,760 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:30,761 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:30,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:30,767 INFO L85 PathProgramCache]: Analyzing trace with hash 469945194, now seen corresponding path program 1 times [2023-11-06 21:53:30,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:30,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445721374] [2023-11-06 21:53:30,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:30,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:53:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:53:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 21:53:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 21:53:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 21:53:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 21:53:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 21:53:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 21:53:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 21:53:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 21:53:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 21:53:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 21:53:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 21:53:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 21:53:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 21:53:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:53:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:53:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-06 21:53:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 21:53:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-06 21:53:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:53:31,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:31,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445721374] [2023-11-06 21:53:31,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445721374] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:31,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:31,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:53:31,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978038198] [2023-11-06 21:53:31,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:31,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:53:31,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:31,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:53:31,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:53:31,365 INFO L87 Difference]: Start difference. First operand has 65 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 21:53:31,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:31,401 INFO L93 Difference]: Finished difference Result 122 states and 210 transitions. [2023-11-06 21:53:31,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:53:31,404 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2023-11-06 21:53:31,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:31,413 INFO L225 Difference]: With dead ends: 122 [2023-11-06 21:53:31,413 INFO L226 Difference]: Without dead ends: 60 [2023-11-06 21:53:31,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:53:31,422 INFO L413 NwaCegarLoop]: 89 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, 89 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 [2023-11-06 21:53:31,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:53:31,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-06 21:53:31,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-11-06 21:53:31,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 21:53:31,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2023-11-06 21:53:31,476 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 129 [2023-11-06 21:53:31,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:31,477 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2023-11-06 21:53:31,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 21:53:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2023-11-06 21:53:31,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-06 21:53:31,481 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:31,482 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:31,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:53:31,482 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:31,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:31,484 INFO L85 PathProgramCache]: Analyzing trace with hash 890885746, now seen corresponding path program 1 times [2023-11-06 21:53:31,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:31,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489370129] [2023-11-06 21:53:31,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:31,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:53:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:53:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 21:53:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 21:53:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 21:53:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 21:53:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 21:53:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 21:53:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 21:53:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 21:53:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 21:53:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 21:53:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 21:53:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 21:53:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 21:53:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:53:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:53:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-06 21:53:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 21:53:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-06 21:53:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,970 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:53:31,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:31,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489370129] [2023-11-06 21:53:31,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489370129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:31,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:31,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:53:31,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925868882] [2023-11-06 21:53:31,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:31,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:53:31,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:31,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:53:31,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:53:31,976 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 21:53:32,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:32,032 INFO L93 Difference]: Finished difference Result 135 states and 201 transitions. [2023-11-06 21:53:32,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:53:32,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2023-11-06 21:53:32,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:32,036 INFO L225 Difference]: With dead ends: 135 [2023-11-06 21:53:32,036 INFO L226 Difference]: Without dead ends: 78 [2023-11-06 21:53:32,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:53:32,039 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 18 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:32,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 167 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:53:32,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-06 21:53:32,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2023-11-06 21:53:32,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 21:53:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2023-11-06 21:53:32,055 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 129 [2023-11-06 21:53:32,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:32,058 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2023-11-06 21:53:32,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 21:53:32,059 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2023-11-06 21:53:32,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-06 21:53:32,062 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:32,062 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:32,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:53:32,063 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:32,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:32,063 INFO L85 PathProgramCache]: Analyzing trace with hash 948144048, now seen corresponding path program 1 times [2023-11-06 21:53:32,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:32,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635175895] [2023-11-06 21:53:32,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:32,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:53:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:53:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 21:53:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 21:53:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 21:53:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 21:53:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 21:53:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 21:53:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 21:53:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 21:53:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 21:53:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 21:53:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 21:53:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 21:53:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 21:53:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:53:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:53:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-06 21:53:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 21:53:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-06 21:53:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:53:32,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:32,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635175895] [2023-11-06 21:53:32,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635175895] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:32,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:32,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:53:32,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737634430] [2023-11-06 21:53:32,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:32,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:53:32,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:32,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:53:32,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:53:32,455 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 21:53:32,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:32,498 INFO L93 Difference]: Finished difference Result 195 states and 291 transitions. [2023-11-06 21:53:32,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:53:32,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2023-11-06 21:53:32,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:32,502 INFO L225 Difference]: With dead ends: 195 [2023-11-06 21:53:32,503 INFO L226 Difference]: Without dead ends: 131 [2023-11-06 21:53:32,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:53:32,506 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 42 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:32,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 166 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:53:32,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-06 21:53:32,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2023-11-06 21:53:32,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-06 21:53:32,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 192 transitions. [2023-11-06 21:53:32,546 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 192 transitions. Word has length 129 [2023-11-06 21:53:32,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:32,547 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 192 transitions. [2023-11-06 21:53:32,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 21:53:32,547 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2023-11-06 21:53:32,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-06 21:53:32,550 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:32,550 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:32,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:53:32,551 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:32,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:32,551 INFO L85 PathProgramCache]: Analyzing trace with hash -616956723, now seen corresponding path program 1 times [2023-11-06 21:53:32,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:32,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564299425] [2023-11-06 21:53:32,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:32,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:32,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:53:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:33,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:53:33,005 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:53:33,006 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 21:53:33,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:53:33,012 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-06 21:53:33,017 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:53:33,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:53:33 BoogieIcfgContainer [2023-11-06 21:53:33,124 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:53:33,125 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:53:33,125 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:53:33,125 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:53:33,126 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:30" (3/4) ... [2023-11-06 21:53:33,129 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 21:53:33,130 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:53:33,131 INFO L158 Benchmark]: Toolchain (without parser) took 3966.33ms. Allocated memory was 138.4MB in the beginning and 178.3MB in the end (delta: 39.8MB). Free memory was 93.6MB in the beginning and 113.5MB in the end (delta: -20.0MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2023-11-06 21:53:33,132 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 109.1MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:53:33,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.99ms. Allocated memory is still 138.4MB. Free memory was 93.6MB in the beginning and 79.4MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 21:53:33,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.17ms. Allocated memory is still 138.4MB. Free memory was 79.4MB in the beginning and 76.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:53:33,134 INFO L158 Benchmark]: Boogie Preprocessor took 78.33ms. Allocated memory is still 138.4MB. Free memory was 76.2MB in the beginning and 74.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:53:33,134 INFO L158 Benchmark]: RCFGBuilder took 698.64ms. Allocated memory is still 138.4MB. Free memory was 74.1MB in the beginning and 55.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 21:53:33,135 INFO L158 Benchmark]: TraceAbstraction took 2563.31ms. Allocated memory was 138.4MB in the beginning and 178.3MB in the end (delta: 39.8MB). Free memory was 54.3MB in the beginning and 113.5MB in the end (delta: -59.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:53:33,136 INFO L158 Benchmark]: Witness Printer took 5.62ms. Allocated memory is still 178.3MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:53:33,138 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.33ms. Allocated memory is still 109.1MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 516.99ms. Allocated memory is still 138.4MB. Free memory was 93.6MB in the beginning and 79.4MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.17ms. Allocated memory is still 138.4MB. Free memory was 79.4MB in the beginning and 76.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.33ms. Allocated memory is still 138.4MB. Free memory was 76.2MB in the beginning and 74.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 698.64ms. Allocated memory is still 138.4MB. Free memory was 74.1MB in the beginning and 55.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2563.31ms. Allocated memory was 138.4MB in the beginning and 178.3MB in the end (delta: 39.8MB). Free memory was 54.3MB in the beginning and 113.5MB in the end (delta: -59.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.62ms. Allocated memory is still 178.3MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 137. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 0.0; [L25] double var_1_4 = 128.2; [L26] double var_1_5 = 50.1; [L27] double var_1_6 = 64.5; [L28] unsigned short int var_1_7 = 1; [L29] unsigned char var_1_8 = 5; [L30] double var_1_9 = 15.35; [L31] unsigned char var_1_10 = 10; [L32] unsigned char var_1_11 = 2; [L33] signed long int var_1_12 = 32; [L34] signed long int var_1_13 = 256; [L35] signed char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 0; [L38] signed char var_1_17 = -64; [L39] unsigned short int var_1_18 = 64; [L40] unsigned char last_1_var_1_8 = 5; [L41] unsigned short int last_1_var_1_18 = 64; VAL [isInitial=0, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=1, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] CALL updateLastVariables() [L133] last_1_var_1_8 = var_1_8 [L134] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=1, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L144] RET updateLastVariables() [L145] CALL updateVariables() [L99] var_1_2 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L100] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L101] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L101] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L102] var_1_3 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L103] RET assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L104] var_1_4 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L105] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L106] var_1_5 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L107] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L108] var_1_6 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=1, var_1_8=5, var_1_9=307/20] [L109] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=1, var_1_8=5, var_1_9=307/20] [L110] var_1_7 = __VERIFIER_nondet_ushort() [L111] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=307/20] [L111] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=307/20] [L112] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=307/20] [L112] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=307/20] [L113] var_1_9 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L114] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L115] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L115] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L116] var_1_10 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L117] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L118] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L118] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L119] var_1_11 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L120] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L121] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L121] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L122] var_1_15 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L123] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L124] CALL assume_abort_if_not(var_1_15 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L124] RET assume_abort_if_not(var_1_15 <= 255) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L125] var_1_16 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L126] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L127] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L127] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L128] var_1_17 = __VERIFIER_nondet_char() [L129] CALL assume_abort_if_not(var_1_17 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L129] RET assume_abort_if_not(var_1_17 >= -126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L130] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L130] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L145] RET updateVariables() [L146] CALL step() [L45] COND FALSE !(\read(var_1_2)) [L52] var_1_1 = 1 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=1, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L54] unsigned short int stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=1, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=5, var_1_9=65541] [L55] COND TRUE var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9)))) [L56] var_1_8 = ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=254, var_1_11=253, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=1, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=254, var_1_9=65541] [L64] COND FALSE !(\read(var_1_2)) [L73] var_1_12 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=254, var_1_11=253, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=1, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=254, var_1_9=65541] [L75] signed long int stepLocal_1 = ((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)); VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, stepLocal_1=64, var_1_10=254, var_1_11=253, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=1, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=254, var_1_9=65541] [L76] COND FALSE !(var_1_10 == stepLocal_1) [L79] var_1_14 = var_1_17 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, stepLocal_1=64, var_1_10=254, var_1_11=253, var_1_12=64, var_1_13=256, var_1_14=65, var_1_15=128, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=1, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=254, var_1_9=65541] [L81] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, stepLocal_1=64, var_1_10=254, var_1_11=253, var_1_12=64, var_1_13=256, var_1_14=65, var_1_15=128, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=1, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=254, var_1_9=65541] [L84] COND FALSE !(var_1_8 == var_1_13) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, stepLocal_1=64, var_1_10=254, var_1_11=253, var_1_12=64, var_1_13=256, var_1_14=65, var_1_15=128, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=1, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=254, var_1_9=65541] [L87] COND FALSE !(last_1_var_1_18 != var_1_16) [L94] var_1_18 = var_1_10 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, stepLocal_1=64, var_1_10=254, var_1_11=253, var_1_12=64, var_1_13=256, var_1_14=65, var_1_15=128, var_1_16=64, var_1_17=65, var_1_18=254, var_1_1=1, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=254, var_1_9=65541] [L146] RET step() [L147] CALL, EXPR property() [L137-L138] return (((((var_1_2 ? ((((var_1_3 - var_1_4) - var_1_5) == (15.75 - var_1_6)) ? (var_1_1 == ((unsigned short int) (5 + last_1_var_1_8))) : (var_1_1 == ((unsigned short int) last_1_var_1_8))) : (var_1_1 == ((unsigned short int) 1))) && ((var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9))))) ? (var_1_8 == ((unsigned char) ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) : ((var_1_1 <= var_1_7) ? (var_1_8 == ((unsigned char) var_1_10)) : (var_1_8 == ((unsigned char) var_1_11))))) && (var_1_2 ? ((-128 > var_1_10) ? ((var_1_3 >= (2.75 / var_1_9)) ? (var_1_12 == ((signed long int) (var_1_11 + (last_1_var_1_18 + var_1_10)))) : (var_1_12 == ((signed long int) last_1_var_1_18))) : 1) : (var_1_12 == ((signed long int) last_1_var_1_18)))) && (var_1_2 ? (var_1_13 == ((signed long int) var_1_11)) : 1)) && ((var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)))) ? (var_1_14 == ((signed char) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : (var_1_14 == ((signed char) var_1_17)))) && ((var_1_8 == var_1_13) ? (var_1_18 == ((unsigned short int) (var_1_10 + ((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) : ((last_1_var_1_18 != var_1_16) ? ((-256 >= var_1_13) ? (var_1_18 == ((unsigned short int) var_1_16)) : (var_1_18 == ((unsigned short int) var_1_15))) : (var_1_18 == ((unsigned short int) var_1_10)))) ; VAL [\result=0, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=64, var_1_13=256, var_1_14=65, var_1_15=128, var_1_16=64, var_1_17=65, var_1_18=254, var_1_1=1, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=254, var_1_9=65541] [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=64, var_1_13=256, var_1_14=65, var_1_15=128, var_1_16=64, var_1_17=65, var_1_18=254, var_1_1=1, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=254, var_1_9=65541] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=254, var_1_11=253, var_1_12=64, var_1_13=256, var_1_14=65, var_1_15=128, var_1_16=64, var_1_17=65, var_1_18=254, var_1_1=1, var_1_2=0, var_1_3=65544, var_1_4=65543, var_1_5=65545, var_1_6=65542, var_1_7=0, var_1_8=254, var_1_9=65541] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 422 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 159 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 263 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=3, InterpolantAutomatonStates: 8, 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, 3 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 517 NumberOfCodeBlocks, 517 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 384 ConstructedInterpolants, 0 QuantifiedInterpolants, 508 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2280/2280 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 [2023-11-06 21:53:33,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-48.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 3477469bfd81314cf7d649c8adcd7fe214dd2065383578e89ca0f01d8a450671 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:53:36,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:53:36,220 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 21:53:36,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:53:36,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:53:36,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:53:36,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:53:36,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:53:36,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:53:36,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:53:36,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:53:36,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:53:36,284 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:53:36,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:53:36,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:53:36,287 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:53:36,287 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:53:36,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:53:36,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:53:36,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:53:36,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:53:36,290 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:53:36,290 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 21:53:36,291 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 21:53:36,291 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:53:36,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:53:36,292 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:53:36,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:53:36,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:53:36,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:53:36,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:36,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:53:36,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:53:36,296 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:53:36,296 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 21:53:36,296 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 21:53:36,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:53:36,297 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:53:36,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:53:36,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:53:36,298 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 21:53:36,299 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:53:36,299 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 3477469bfd81314cf7d649c8adcd7fe214dd2065383578e89ca0f01d8a450671 [2023-11-06 21:53:36,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:53:36,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:53:36,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:53:36,775 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:53:36,776 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:53:36,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-48.i [2023-11-06 21:53:40,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:53:40,477 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:53:40,478 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-48.i [2023-11-06 21:53:40,498 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/data/966de1abc/73821a40b6274301a67abcce2a4c8003/FLAGbc845d7d4 [2023-11-06 21:53:40,515 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/data/966de1abc/73821a40b6274301a67abcce2a4c8003 [2023-11-06 21:53:40,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:53:40,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:53:40,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:40,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:53:40,532 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:53:40,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:40" (1/1) ... [2023-11-06 21:53:40,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7433124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:40, skipping insertion in model container [2023-11-06 21:53:40,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:40" (1/1) ... [2023-11-06 21:53:40,587 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:53:40,751 WARN L240 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_5f49cfa0-2fb1-46c8-be88-0424f767be10/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-48.i[915,928] [2023-11-06 21:53:40,841 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:40,870 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:53:40,894 WARN L240 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_5f49cfa0-2fb1-46c8-be88-0424f767be10/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-48.i[915,928] [2023-11-06 21:53:40,965 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:40,984 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:53:40,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:40 WrapperNode [2023-11-06 21:53:40,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:40,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:40,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:53:40,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:53:40,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:40" (1/1) ... [2023-11-06 21:53:41,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:40" (1/1) ... [2023-11-06 21:53:41,077 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2023-11-06 21:53:41,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:41,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:53:41,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:53:41,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:53:41,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:40" (1/1) ... [2023-11-06 21:53:41,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:40" (1/1) ... [2023-11-06 21:53:41,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:40" (1/1) ... [2023-11-06 21:53:41,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:40" (1/1) ... [2023-11-06 21:53:41,127 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:40" (1/1) ... [2023-11-06 21:53:41,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:40" (1/1) ... [2023-11-06 21:53:41,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:40" (1/1) ... [2023-11-06 21:53:41,149 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:40" (1/1) ... [2023-11-06 21:53:41,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:53:41,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:53:41,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:53:41,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:53:41,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:40" (1/1) ... [2023-11-06 21:53:41,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:41,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:41,204 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:41,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:53:41,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:53:41,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 21:53:41,251 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:53:41,252 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:53:41,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:53:41,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:53:41,409 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:53:41,412 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:53:56,446 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:53:56,459 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:53:56,459 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:53:56,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:56 BoogieIcfgContainer [2023-11-06 21:53:56,462 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:53:56,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:53:56,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:53:56,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:53:56,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:53:40" (1/3) ... [2023-11-06 21:53:56,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543d5eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:56, skipping insertion in model container [2023-11-06 21:53:56,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:40" (2/3) ... [2023-11-06 21:53:56,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543d5eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:56, skipping insertion in model container [2023-11-06 21:53:56,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:56" (3/3) ... [2023-11-06 21:53:56,473 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-48.i [2023-11-06 21:53:56,495 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:53:56,495 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:53:56,549 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:53:56,555 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@3c7edaf0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:53:56,555 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:53:56,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 21:53:56,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-06 21:53:56,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:56,575 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:56,576 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:56,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:56,582 INFO L85 PathProgramCache]: Analyzing trace with hash 469945194, now seen corresponding path program 1 times [2023-11-06 21:53:56,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:53:56,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101651902] [2023-11-06 21:53:56,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:56,604 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 [2023-11-06 21:53:56,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:53:56,612 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 21:53:56,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 21:53:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:58,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 21:53:58,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2023-11-06 21:53:58,812 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:53:58,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:53:58,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101651902] [2023-11-06 21:53:58,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101651902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:58,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:58,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:53:58,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380100685] [2023-11-06 21:53:58,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:58,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:53:58,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:53:58,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:53:58,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:53:58,873 INFO L87 Difference]: Start difference. First operand has 65 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 21:53:58,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:58,907 INFO L93 Difference]: Finished difference Result 122 states and 210 transitions. [2023-11-06 21:53:58,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:53:58,910 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2023-11-06 21:53:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:58,919 INFO L225 Difference]: With dead ends: 122 [2023-11-06 21:53:58,919 INFO L226 Difference]: Without dead ends: 60 [2023-11-06 21:53:58,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:53:58,928 INFO L413 NwaCegarLoop]: 89 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, 89 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 [2023-11-06 21:53:58,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:53:58,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-06 21:53:58,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-11-06 21:53:58,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 21:53:58,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2023-11-06 21:53:58,978 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 129 [2023-11-06 21:53:58,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:58,979 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2023-11-06 21:53:58,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 21:53:58,980 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2023-11-06 21:53:58,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-06 21:53:58,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:58,987 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:59,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:59,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 21:53:59,213 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:59,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:59,214 INFO L85 PathProgramCache]: Analyzing trace with hash 890885746, now seen corresponding path program 1 times [2023-11-06 21:53:59,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:53:59,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782726191] [2023-11-06 21:53:59,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:59,216 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 [2023-11-06 21:53:59,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:53:59,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 21:53:59,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 21:54:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:01,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 21:54:01,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:01,297 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:54:01,297 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:01,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:01,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782726191] [2023-11-06 21:54:01,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782726191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:01,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:01,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:54:01,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507497583] [2023-11-06 21:54:01,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:01,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:54:01,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:01,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:54:01,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:01,303 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 21:54:05,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 21:54:07,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 21:54:07,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:07,725 INFO L93 Difference]: Finished difference Result 135 states and 201 transitions. [2023-11-06 21:54:07,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:07,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2023-11-06 21:54:07,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:07,747 INFO L225 Difference]: With dead ends: 135 [2023-11-06 21:54:07,747 INFO L226 Difference]: Without dead ends: 78 [2023-11-06 21:54:07,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:07,749 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 20 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:07,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 167 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2023-11-06 21:54:07,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-06 21:54:07,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2023-11-06 21:54:07,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 21:54:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2023-11-06 21:54:07,775 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 129 [2023-11-06 21:54:07,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:07,779 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2023-11-06 21:54:07,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 21:54:07,780 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2023-11-06 21:54:07,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-06 21:54:07,784 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:07,785 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:07,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 0 [2023-11-06 21:54:08,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 21:54:08,004 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:08,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:08,005 INFO L85 PathProgramCache]: Analyzing trace with hash 948144048, now seen corresponding path program 1 times [2023-11-06 21:54:08,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:08,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411018888] [2023-11-06 21:54:08,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:08,007 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 [2023-11-06 21:54:08,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:08,008 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 21:54:08,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 21:54:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:09,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 21:54:09,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:54:12,732 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:12,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:12,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411018888] [2023-11-06 21:54:12,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411018888] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:12,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:12,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:54:12,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195364529] [2023-11-06 21:54:12,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:12,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:54:12,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:12,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:54:12,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:12,736 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 21:54:16,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 21:54:20,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 21:54:21,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:21,218 INFO L93 Difference]: Finished difference Result 195 states and 291 transitions. [2023-11-06 21:54:21,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:21,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2023-11-06 21:54:21,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:21,222 INFO L225 Difference]: With dead ends: 195 [2023-11-06 21:54:21,222 INFO L226 Difference]: Without dead ends: 131 [2023-11-06 21:54:21,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:21,225 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 19 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:21,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 167 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2023-11-06 21:54:21,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-06 21:54:21,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2023-11-06 21:54:21,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-06 21:54:21,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 192 transitions. [2023-11-06 21:54:21,263 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 192 transitions. Word has length 129 [2023-11-06 21:54:21,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:21,264 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 192 transitions. [2023-11-06 21:54:21,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 21:54:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2023-11-06 21:54:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-06 21:54:21,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:21,268 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:21,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 21:54:21,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 21:54:21,492 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:21,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:21,493 INFO L85 PathProgramCache]: Analyzing trace with hash -616956723, now seen corresponding path program 1 times [2023-11-06 21:54:21,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:21,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884546783] [2023-11-06 21:54:21,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:21,494 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 [2023-11-06 21:54:21,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:21,504 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 21:54:21,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f49cfa0-2fb1-46c8-be88-0424f767be10/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 21:54:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 21:54:23,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:32,280 WARN L293 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:54:38,204 WARN L293 SmtUtils]: Spent 5.92s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:54:48,721 WARN L293 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:54:59,205 WARN L293 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:55:07,191 WARN L293 SmtUtils]: Spent 6.00s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:55:15,684 WARN L839 $PredicateComparison]: unable to prove that (and (= (_ bv256 32) c_~var_1_13~0) (= ((_ extract 7 0) ((_ zero_extend 24) c_~var_1_10~0)) c_~var_1_8~0) (let ((.cse0 (fp.gt c_~var_1_3~0 c_~var_1_9~0))) (or (and (not .cse0) (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_9~0))) (and (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0)) .cse0))) (= c_~var_1_1~0 (_ bv1 16))) is different from false [2023-11-06 21:55:18,131 WARN L861 $PredicateComparison]: unable to prove that (and (= (_ bv256 32) c_~var_1_13~0) (= ((_ extract 7 0) ((_ zero_extend 24) c_~var_1_10~0)) c_~var_1_8~0) (let ((.cse0 (fp.gt c_~var_1_3~0 c_~var_1_9~0))) (or (and (not .cse0) (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_9~0))) (and (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0)) .cse0))) (= c_~var_1_1~0 (_ bv1 16))) is different from true [2023-11-06 21:55:24,324 WARN L293 SmtUtils]: Spent 6.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:55:30,547 WARN L293 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:55:36,606 WARN L293 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:55:42,900 WARN L293 SmtUtils]: Spent 6.29s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:55:53,583 WARN L293 SmtUtils]: Spent 6.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:56:04,188 WARN L293 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:56:10,275 WARN L293 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:56:12,725 WARN L839 $PredicateComparison]: unable to prove that (and (= (_ bv256 32) c_~var_1_13~0) (= ((_ extract 7 0) ((_ zero_extend 24) c_~var_1_10~0)) c_~var_1_8~0) (= (_ bv0 8) c_~var_1_2~0) (let ((.cse0 (fp.gt c_~var_1_3~0 c_~var_1_9~0))) (or (and (not .cse0) (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_9~0))) (and (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0)) .cse0))) (= ((_ zero_extend 16) c_~last_1_var_1_18~0) c_~var_1_12~0) (= c_~var_1_1~0 (_ bv1 16))) is different from false [2023-11-06 21:56:15,177 WARN L861 $PredicateComparison]: unable to prove that (and (= (_ bv256 32) c_~var_1_13~0) (= ((_ extract 7 0) ((_ zero_extend 24) c_~var_1_10~0)) c_~var_1_8~0) (= (_ bv0 8) c_~var_1_2~0) (let ((.cse0 (fp.gt c_~var_1_3~0 c_~var_1_9~0))) (or (and (not .cse0) (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_9~0))) (and (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0)) .cse0))) (= ((_ zero_extend 16) c_~last_1_var_1_18~0) c_~var_1_12~0) (= c_~var_1_1~0 (_ bv1 16))) is different from true [2023-11-06 21:56:21,296 WARN L293 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:56:27,319 WARN L293 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:56:33,426 WARN L293 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:56:39,609 WARN L293 SmtUtils]: Spent 6.18s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:56:50,164 WARN L293 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:57:00,687 WARN L293 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:57:06,835 WARN L293 SmtUtils]: Spent 6.15s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:57:12,944 WARN L293 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:57:18,987 WARN L293 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:57:25,106 WARN L293 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:57:31,127 WARN L293 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:57:33,601 WARN L839 $PredicateComparison]: unable to prove that (and (= (_ bv256 32) c_~var_1_13~0) (= ((_ extract 7 0) ((_ zero_extend 24) c_~var_1_10~0)) c_~var_1_8~0) (= (_ bv0 8) c_~var_1_2~0) (let ((.cse0 (fp.gt c_~var_1_3~0 c_~var_1_9~0))) (or (and (not .cse0) (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_9~0))) (and (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0)) .cse0))) (= ((_ zero_extend 16) c_~last_1_var_1_18~0) c_~var_1_12~0) (let ((.cse2 (bvadd (bvneg ((_ zero_extend 24) c_~var_1_16~0)) ((_ zero_extend 24) c_~var_1_15~0)))) (let ((.cse1 (bvsgt .cse2 c_~var_1_12~0))) (or (and .cse1 (= .cse2 |c_ULTIMATE.start_step_~stepLocal_1~0#1|)) (and (= c_~var_1_12~0 |c_ULTIMATE.start_step_~stepLocal_1~0#1|) (not .cse1))))) (= c_~var_1_1~0 (_ bv1 16))) is different from false [2023-11-06 21:57:36,083 WARN L861 $PredicateComparison]: unable to prove that (and (= (_ bv256 32) c_~var_1_13~0) (= ((_ extract 7 0) ((_ zero_extend 24) c_~var_1_10~0)) c_~var_1_8~0) (= (_ bv0 8) c_~var_1_2~0) (let ((.cse0 (fp.gt c_~var_1_3~0 c_~var_1_9~0))) (or (and (not .cse0) (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_9~0))) (and (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0)) .cse0))) (= ((_ zero_extend 16) c_~last_1_var_1_18~0) c_~var_1_12~0) (let ((.cse2 (bvadd (bvneg ((_ zero_extend 24) c_~var_1_16~0)) ((_ zero_extend 24) c_~var_1_15~0)))) (let ((.cse1 (bvsgt .cse2 c_~var_1_12~0))) (or (and .cse1 (= .cse2 |c_ULTIMATE.start_step_~stepLocal_1~0#1|)) (and (= c_~var_1_12~0 |c_ULTIMATE.start_step_~stepLocal_1~0#1|) (not .cse1))))) (= c_~var_1_1~0 (_ bv1 16))) is different from true [2023-11-06 21:57:42,377 WARN L293 SmtUtils]: Spent 6.24s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:57:48,495 WARN L293 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:57:54,644 WARN L293 SmtUtils]: Spent 6.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)