./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-78.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c60f372b7dc1b4532187e57acf518ccbf786ab918ffb900907557784c73c0567 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:45:29,979 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:45:30,068 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 12:45:30,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:45:30,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:45:30,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:45:30,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:45:30,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:45:30,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:45:30,097 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:45:30,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:45:30,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:45:30,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:45:30,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:45:30,099 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:45:30,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:45:30,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:45:30,099 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:45:30,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:45:30,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:45:30,100 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:45:30,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:45:30,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:45:30,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:45:30,100 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:45:30,100 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:45:30,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:45:30,101 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:45:30,101 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:45:30,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:45:30,101 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:45:30,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:45:30,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:45:30,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:45:30,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:45:30,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:45:30,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:45:30,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:45:30,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:45:30,103 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:45:30,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:45:30,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:45:30,103 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c60f372b7dc1b4532187e57acf518ccbf786ab918ffb900907557784c73c0567 [2024-11-13 12:45:30,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:45:30,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:45:30,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:45:30,499 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:45:30,499 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:45:30,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-78.i Unable to find full path for "g++" [2024-11-13 12:45:32,678 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:45:32,954 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:45:32,954 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-78.i [2024-11-13 12:45:32,964 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/data/e141dd082/a94e7213976441a6b51c47fb214d6512/FLAGfc75f11fc [2024-11-13 12:45:32,983 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/data/e141dd082/a94e7213976441a6b51c47fb214d6512 [2024-11-13 12:45:32,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:45:32,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:45:32,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:45:32,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:45:32,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:45:32,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:45:32" (1/1) ... [2024-11-13 12:45:32,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f2cdfc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:32, skipping insertion in model container [2024-11-13 12:45:32,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:45:32" (1/1) ... [2024-11-13 12:45:33,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:45:33,218 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-78.i[915,928] [2024-11-13 12:45:33,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:45:33,390 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:45:33,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-78.i[915,928] [2024-11-13 12:45:33,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:45:33,511 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:45:33,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:33 WrapperNode [2024-11-13 12:45:33,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:45:33,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:45:33,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:45:33,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:45:33,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:33" (1/1) ... [2024-11-13 12:45:33,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:33" (1/1) ... [2024-11-13 12:45:33,654 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2024-11-13 12:45:33,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:45:33,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:45:33,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:45:33,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:45:33,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:33" (1/1) ... [2024-11-13 12:45:33,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:33" (1/1) ... [2024-11-13 12:45:33,679 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:33" (1/1) ... [2024-11-13 12:45:33,730 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 12:45:33,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:33" (1/1) ... [2024-11-13 12:45:33,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:33" (1/1) ... [2024-11-13 12:45:33,757 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:33" (1/1) ... [2024-11-13 12:45:33,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:33" (1/1) ... [2024-11-13 12:45:33,773 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:33" (1/1) ... [2024-11-13 12:45:33,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:33" (1/1) ... [2024-11-13 12:45:33,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:45:33,791 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:45:33,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:45:33,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:45:33,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:33" (1/1) ... [2024-11-13 12:45:33,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:45:33,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:33,837 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:45:33,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:45:33,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:45:33,876 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 12:45:33,876 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 12:45:33,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:45:33,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:45:33,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:45:34,014 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:45:34,017 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:45:34,705 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-13 12:45:34,705 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:45:34,718 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:45:34,718 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 12:45:34,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:45:34 BoogieIcfgContainer [2024-11-13 12:45:34,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:45:34,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:45:34,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:45:34,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:45:34,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:45:32" (1/3) ... [2024-11-13 12:45:34,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfe93c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:45:34, skipping insertion in model container [2024-11-13 12:45:34,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:33" (2/3) ... [2024-11-13 12:45:34,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfe93c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:45:34, skipping insertion in model container [2024-11-13 12:45:34,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:45:34" (3/3) ... [2024-11-13 12:45:34,730 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-78.i [2024-11-13 12:45:34,751 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:45:34,753 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-78.i that has 2 procedures, 78 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 12:45:34,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:45:34,844 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57a41bd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:45:34,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 12:45:34,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 12:45:34,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 12:45:34,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:34,866 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:34,866 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:34,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:34,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1896783141, now seen corresponding path program 1 times [2024-11-13 12:45:34,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:34,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911309981] [2024-11-13 12:45:34,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:34,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:45:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:45:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:45:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:45:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:45:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 12:45:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:45:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:45:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 12:45:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 12:45:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 12:45:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 12:45:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 12:45:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 12:45:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 12:45:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 12:45:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 12:45:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 12:45:35,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:35,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911309981] [2024-11-13 12:45:35,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911309981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:35,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:35,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:45:35,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898306980] [2024-11-13 12:45:35,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:35,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 12:45:35,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:35,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 12:45:35,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 12:45:35,514 INFO L87 Difference]: Start difference. First operand has 78 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 12:45:35,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:35,555 INFO L93 Difference]: Finished difference Result 149 states and 246 transitions. [2024-11-13 12:45:35,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:45:35,557 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 124 [2024-11-13 12:45:35,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:35,567 INFO L225 Difference]: With dead ends: 149 [2024-11-13 12:45:35,567 INFO L226 Difference]: Without dead ends: 74 [2024-11-13 12:45:35,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 12:45:35,576 INFO L432 NwaCegarLoop]: 110 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, 110 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:35,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:45:35,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-13 12:45:35,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-13 12:45:35,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 12:45:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 110 transitions. [2024-11-13 12:45:35,651 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 110 transitions. Word has length 124 [2024-11-13 12:45:35,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:35,653 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 110 transitions. [2024-11-13 12:45:35,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 12:45:35,653 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 110 transitions. [2024-11-13 12:45:35,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 12:45:35,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:35,659 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:35,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:45:35,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:35,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:35,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1037489359, now seen corresponding path program 1 times [2024-11-13 12:45:35,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:35,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114199734] [2024-11-13 12:45:35,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:35,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:45:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:45:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:45:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:45:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:45:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 12:45:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:45:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:45:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 12:45:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 12:45:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 12:45:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 12:45:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 12:45:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 12:45:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 12:45:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 12:45:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 12:45:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 12:45:36,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:36,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114199734] [2024-11-13 12:45:36,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114199734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:36,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:36,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:45:36,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096037847] [2024-11-13 12:45:36,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:36,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:45:36,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:36,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:45:36,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:45:36,263 INFO L87 Difference]: Start difference. First operand 74 states and 110 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:45:36,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:36,312 INFO L93 Difference]: Finished difference Result 145 states and 217 transitions. [2024-11-13 12:45:36,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:45:36,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2024-11-13 12:45:36,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:36,315 INFO L225 Difference]: With dead ends: 145 [2024-11-13 12:45:36,315 INFO L226 Difference]: Without dead ends: 74 [2024-11-13 12:45:36,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:45:36,317 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:36,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:45:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-13 12:45:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-13 12:45:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 12:45:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2024-11-13 12:45:36,337 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 124 [2024-11-13 12:45:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:36,339 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2024-11-13 12:45:36,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:45:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2024-11-13 12:45:36,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 12:45:36,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:36,342 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:36,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:45:36,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:36,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:36,343 INFO L85 PathProgramCache]: Analyzing trace with hash -399197129, now seen corresponding path program 1 times [2024-11-13 12:45:36,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:36,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077602027] [2024-11-13 12:45:36,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:36,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:45:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:45:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:45:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:45:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:45:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 12:45:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:45:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:45:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 12:45:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 12:45:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 12:45:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 12:45:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 12:45:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:36,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 12:45:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 12:45:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 12:45:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 12:45:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,041 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 12:45:37,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:37,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077602027] [2024-11-13 12:45:37,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077602027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:37,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:37,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:45:37,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791955505] [2024-11-13 12:45:37,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:37,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:45:37,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:37,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:45:37,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:45:37,044 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:45:37,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:37,383 INFO L93 Difference]: Finished difference Result 217 states and 322 transitions. [2024-11-13 12:45:37,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:45:37,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2024-11-13 12:45:37,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:37,387 INFO L225 Difference]: With dead ends: 217 [2024-11-13 12:45:37,387 INFO L226 Difference]: Without dead ends: 146 [2024-11-13 12:45:37,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:37,393 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 83 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:37,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 284 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:45:37,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-13 12:45:37,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 129. [2024-11-13 12:45:37,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 12:45:37,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 192 transitions. [2024-11-13 12:45:37,444 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 192 transitions. Word has length 125 [2024-11-13 12:45:37,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:37,445 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 192 transitions. [2024-11-13 12:45:37,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:45:37,448 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2024-11-13 12:45:37,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 12:45:37,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:37,450 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:37,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 12:45:37,450 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:37,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:37,451 INFO L85 PathProgramCache]: Analyzing trace with hash -536058235, now seen corresponding path program 1 times [2024-11-13 12:45:37,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:37,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037560041] [2024-11-13 12:45:37,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:37,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:45:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:45:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:45:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:45:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:45:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 12:45:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:45:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:45:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 12:45:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 12:45:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 12:45:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 12:45:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 12:45:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 12:45:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 12:45:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:37,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 12:45:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:38,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 12:45:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:38,020 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 12:45:38,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:38,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037560041] [2024-11-13 12:45:38,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037560041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:38,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:38,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:45:38,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684076280] [2024-11-13 12:45:38,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:38,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:45:38,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:38,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:45:38,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:45:38,025 INFO L87 Difference]: Start difference. First operand 129 states and 192 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:45:38,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:38,330 INFO L93 Difference]: Finished difference Result 310 states and 460 transitions. [2024-11-13 12:45:38,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:45:38,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-11-13 12:45:38,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:38,333 INFO L225 Difference]: With dead ends: 310 [2024-11-13 12:45:38,333 INFO L226 Difference]: Without dead ends: 223 [2024-11-13 12:45:38,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:38,335 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 123 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:38,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 311 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:45:38,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-13 12:45:38,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 205. [2024-11-13 12:45:38,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 147 states have (on average 1.3333333333333333) internal successors, (196), 147 states have internal predecessors, (196), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 12:45:38,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 304 transitions. [2024-11-13 12:45:38,386 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 304 transitions. Word has length 126 [2024-11-13 12:45:38,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:38,388 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 304 transitions. [2024-11-13 12:45:38,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:45:38,389 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 304 transitions. [2024-11-13 12:45:38,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-13 12:45:38,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:38,393 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:38,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:45:38,394 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:38,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:38,394 INFO L85 PathProgramCache]: Analyzing trace with hash -411177284, now seen corresponding path program 1 times [2024-11-13 12:45:38,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:38,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900755528] [2024-11-13 12:45:38,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:38,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:38,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:38,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:45:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:38,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:45:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:38,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:45:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:38,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:45:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:38,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:45:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:38,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 12:45:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:38,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:45:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:38,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:45:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:38,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 12:45:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:38,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 12:45:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:38,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 12:45:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:38,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 12:45:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:39,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 12:45:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:39,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 12:45:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:39,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 12:45:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:39,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 12:45:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:39,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 12:45:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 12:45:39,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:39,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900755528] [2024-11-13 12:45:39,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900755528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:39,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:39,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 12:45:39,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415951503] [2024-11-13 12:45:39,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:39,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:45:39,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:39,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:45:39,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:45:39,036 INFO L87 Difference]: Start difference. First operand 205 states and 304 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:45:39,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:39,554 INFO L93 Difference]: Finished difference Result 583 states and 857 transitions. [2024-11-13 12:45:39,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:45:39,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2024-11-13 12:45:39,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:39,560 INFO L225 Difference]: With dead ends: 583 [2024-11-13 12:45:39,561 INFO L226 Difference]: Without dead ends: 432 [2024-11-13 12:45:39,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:45:39,563 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 266 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:39,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 619 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:45:39,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-13 12:45:39,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 366. [2024-11-13 12:45:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 270 states have (on average 1.3555555555555556) internal successors, (366), 270 states have internal predecessors, (366), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-13 12:45:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 546 transitions. [2024-11-13 12:45:39,668 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 546 transitions. Word has length 127 [2024-11-13 12:45:39,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:39,672 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 546 transitions. [2024-11-13 12:45:39,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:45:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 546 transitions. [2024-11-13 12:45:39,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-13 12:45:39,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:39,675 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:39,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 12:45:39,675 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:39,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:39,682 INFO L85 PathProgramCache]: Analyzing trace with hash -804204294, now seen corresponding path program 1 times [2024-11-13 12:45:39,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:39,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546588245] [2024-11-13 12:45:39,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:39,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:45:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:45:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:45:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:45:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:45:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 12:45:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:45:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:45:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 12:45:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 12:45:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 12:45:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 12:45:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 12:45:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 12:45:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 12:45:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 12:45:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 12:45:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 12:45:40,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:40,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546588245] [2024-11-13 12:45:40,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546588245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:40,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:40,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:45:40,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312339921] [2024-11-13 12:45:40,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:40,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:45:40,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:40,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:45:40,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:45:40,377 INFO L87 Difference]: Start difference. First operand 366 states and 546 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:45:40,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:40,717 INFO L93 Difference]: Finished difference Result 752 states and 1113 transitions. [2024-11-13 12:45:40,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:45:40,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2024-11-13 12:45:40,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:40,727 INFO L225 Difference]: With dead ends: 752 [2024-11-13 12:45:40,728 INFO L226 Difference]: Without dead ends: 428 [2024-11-13 12:45:40,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:40,731 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 75 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:40,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 284 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:45:40,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-13 12:45:40,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 374. [2024-11-13 12:45:40,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 278 states have (on average 1.341726618705036) internal successors, (373), 278 states have internal predecessors, (373), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-13 12:45:40,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 553 transitions. [2024-11-13 12:45:40,816 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 553 transitions. Word has length 127 [2024-11-13 12:45:40,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:40,817 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 553 transitions. [2024-11-13 12:45:40,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:45:40,817 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 553 transitions. [2024-11-13 12:45:40,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 12:45:40,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:40,819 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:40,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 12:45:40,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:40,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:40,821 INFO L85 PathProgramCache]: Analyzing trace with hash 533689574, now seen corresponding path program 1 times [2024-11-13 12:45:40,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:40,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423749360] [2024-11-13 12:45:40,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:40,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:41,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:41,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:45:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:41,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:45:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:41,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:45:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:41,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:45:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:41,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:45:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:41,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 12:45:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:41,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:45:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:41,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:45:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:41,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 12:45:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:41,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 12:45:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:41,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 12:45:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:41,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 12:45:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:41,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 12:45:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:41,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 12:45:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:41,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 12:45:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:41,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 12:45:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:41,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 12:45:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 12:45:41,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:41,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423749360] [2024-11-13 12:45:41,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423749360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:41,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:41,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:45:41,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730871074] [2024-11-13 12:45:41,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:41,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:41,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:41,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:41,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:41,430 INFO L87 Difference]: Start difference. First operand 374 states and 553 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:45:41,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:41,909 INFO L93 Difference]: Finished difference Result 942 states and 1392 transitions. [2024-11-13 12:45:41,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:45:41,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 128 [2024-11-13 12:45:41,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:41,915 INFO L225 Difference]: With dead ends: 942 [2024-11-13 12:45:41,915 INFO L226 Difference]: Without dead ends: 617 [2024-11-13 12:45:41,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:45:41,917 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 119 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:41,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 445 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:45:41,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-13 12:45:42,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 531. [2024-11-13 12:45:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 397 states have (on average 1.3324937027707808) internal successors, (529), 397 states have internal predecessors, (529), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-13 12:45:42,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 781 transitions. [2024-11-13 12:45:42,053 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 781 transitions. Word has length 128 [2024-11-13 12:45:42,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:42,054 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 781 transitions. [2024-11-13 12:45:42,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:45:42,055 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 781 transitions. [2024-11-13 12:45:42,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 12:45:42,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:42,057 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:42,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 12:45:42,057 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:42,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:42,057 INFO L85 PathProgramCache]: Analyzing trace with hash -477427676, now seen corresponding path program 1 times [2024-11-13 12:45:42,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:42,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364146481] [2024-11-13 12:45:42,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:42,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:42,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:42,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:45:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:42,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:45:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:42,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:45:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:42,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:45:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:42,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:45:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:42,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 12:45:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:42,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:45:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:42,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:45:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:42,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 12:45:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:42,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 12:45:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:42,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 12:45:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:42,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 12:45:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:42,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 12:45:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:42,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 12:45:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:42,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 12:45:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:42,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 12:45:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:42,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 12:45:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 12:45:42,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:42,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364146481] [2024-11-13 12:45:42,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364146481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:42,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:42,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:45:42,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722937980] [2024-11-13 12:45:42,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:42,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:45:42,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:42,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:45:42,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:45:42,548 INFO L87 Difference]: Start difference. First operand 531 states and 781 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:45:42,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:42,893 INFO L93 Difference]: Finished difference Result 1081 states and 1601 transitions. [2024-11-13 12:45:42,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:45:42,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 128 [2024-11-13 12:45:42,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:42,900 INFO L225 Difference]: With dead ends: 1081 [2024-11-13 12:45:42,900 INFO L226 Difference]: Without dead ends: 647 [2024-11-13 12:45:42,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:45:42,904 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 36 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:42,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 477 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:45:42,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-11-13 12:45:43,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 577. [2024-11-13 12:45:43,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 443 states have (on average 1.3318284424379232) internal successors, (590), 443 states have internal predecessors, (590), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-13 12:45:43,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 842 transitions. [2024-11-13 12:45:43,046 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 842 transitions. Word has length 128 [2024-11-13 12:45:43,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:43,047 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 842 transitions. [2024-11-13 12:45:43,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:45:43,047 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 842 transitions. [2024-11-13 12:45:43,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 12:45:43,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:43,049 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:43,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 12:45:43,050 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:43,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:43,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1056376608, now seen corresponding path program 1 times [2024-11-13 12:45:43,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:43,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557377037] [2024-11-13 12:45:43,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:43,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 12:45:43,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [376008309] [2024-11-13 12:45:43,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:43,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:43,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:43,234 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:45:43,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 12:45:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:44,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 12:45:44,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-13 12:45:44,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:45:46,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:46,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557377037] [2024-11-13 12:45:46,107 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 12:45:46,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376008309] [2024-11-13 12:45:46,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376008309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:45:46,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:45:46,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-13 12:45:46,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771211207] [2024-11-13 12:45:46,109 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-13 12:45:46,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:45:46,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:46,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:45:46,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:45:46,111 INFO L87 Difference]: Start difference. First operand 577 states and 842 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 12:45:47,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:47,196 INFO L93 Difference]: Finished difference Result 1404 states and 2008 transitions. [2024-11-13 12:45:47,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:45:47,197 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 133 [2024-11-13 12:45:47,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:47,205 INFO L225 Difference]: With dead ends: 1404 [2024-11-13 12:45:47,205 INFO L226 Difference]: Without dead ends: 1053 [2024-11-13 12:45:47,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-11-13 12:45:47,208 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 145 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:47,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 441 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 12:45:47,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2024-11-13 12:45:47,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1009. [2024-11-13 12:45:47,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 779 states have (on average 1.3209242618741976) internal successors, (1029), 783 states have internal predecessors, (1029), 206 states have call successors, (206), 23 states have call predecessors, (206), 23 states have return successors, (206), 202 states have call predecessors, (206), 206 states have call successors, (206) [2024-11-13 12:45:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1441 transitions. [2024-11-13 12:45:47,362 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1441 transitions. Word has length 133 [2024-11-13 12:45:47,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:47,363 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1441 transitions. [2024-11-13 12:45:47,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 12:45:47,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1441 transitions. [2024-11-13 12:45:47,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 12:45:47,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:47,365 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:47,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 12:45:47,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:47,566 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:47,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:47,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1536025184, now seen corresponding path program 1 times [2024-11-13 12:45:47,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:47,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360576166] [2024-11-13 12:45:47,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:47,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:47,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:47,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:45:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:47,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:45:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:47,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:45:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:47,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:45:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:47,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:45:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:47,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 12:45:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:47,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:45:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:47,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:45:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:47,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 12:45:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:47,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 12:45:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:47,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 12:45:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:47,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 12:45:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:47,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 12:45:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:47,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 12:45:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:47,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 12:45:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:47,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 12:45:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:47,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 12:45:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 12:45:47,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:47,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360576166] [2024-11-13 12:45:47,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360576166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:47,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:47,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:45:47,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769660730] [2024-11-13 12:45:47,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:47,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:47,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:47,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:47,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:47,957 INFO L87 Difference]: Start difference. First operand 1009 states and 1441 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:45:48,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:48,172 INFO L93 Difference]: Finished difference Result 1735 states and 2505 transitions. [2024-11-13 12:45:48,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:45:48,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 133 [2024-11-13 12:45:48,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:48,186 INFO L225 Difference]: With dead ends: 1735 [2024-11-13 12:45:48,186 INFO L226 Difference]: Without dead ends: 1334 [2024-11-13 12:45:48,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:45:48,190 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 69 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:48,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 434 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:48,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2024-11-13 12:45:48,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1012. [2024-11-13 12:45:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 782 states have (on average 1.319693094629156) internal successors, (1032), 786 states have internal predecessors, (1032), 206 states have call successors, (206), 23 states have call predecessors, (206), 23 states have return successors, (206), 202 states have call predecessors, (206), 206 states have call successors, (206) [2024-11-13 12:45:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1444 transitions. [2024-11-13 12:45:48,372 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1444 transitions. Word has length 133 [2024-11-13 12:45:48,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:48,375 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1444 transitions. [2024-11-13 12:45:48,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:45:48,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1444 transitions. [2024-11-13 12:45:48,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 12:45:48,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:48,380 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:48,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 12:45:48,380 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:48,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:48,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1479078434, now seen corresponding path program 1 times [2024-11-13 12:45:48,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:48,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741161700] [2024-11-13 12:45:48,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:48,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 12:45:48,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [902054693] [2024-11-13 12:45:48,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:48,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:48,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:48,502 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:45:48,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 12:45:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:45:48,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:45:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:45:49,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:45:49,068 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 12:45:49,069 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 12:45:49,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 12:45:49,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-13 12:45:49,277 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:49,417 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 12:45:49,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 12:45:49 BoogieIcfgContainer [2024-11-13 12:45:49,423 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 12:45:49,424 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 12:45:49,425 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 12:45:49,425 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 12:45:49,426 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:45:34" (3/4) ... [2024-11-13 12:45:49,429 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 12:45:49,430 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 12:45:49,431 INFO L158 Benchmark]: Toolchain (without parser) took 16442.94ms. Allocated memory was 109.1MB in the beginning and 201.3MB in the end (delta: 92.3MB). Free memory was 82.8MB in the beginning and 72.6MB in the end (delta: 10.2MB). Peak memory consumption was 106.7MB. Max. memory is 16.1GB. [2024-11-13 12:45:49,432 INFO L158 Benchmark]: CDTParser took 1.14ms. Allocated memory is still 83.9MB. Free memory is still 39.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:45:49,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.66ms. Allocated memory is still 109.1MB. Free memory was 82.4MB in the beginning and 67.1MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 12:45:49,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 136.14ms. Allocated memory is still 109.1MB. Free memory was 67.1MB in the beginning and 60.7MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:45:49,434 INFO L158 Benchmark]: Boogie Preprocessor took 135.00ms. Allocated memory is still 109.1MB. Free memory was 60.7MB in the beginning and 50.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:45:49,434 INFO L158 Benchmark]: RCFGBuilder took 927.65ms. Allocated memory is still 109.1MB. Free memory was 49.8MB in the beginning and 64.1MB in the end (delta: -14.3MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2024-11-13 12:45:49,434 INFO L158 Benchmark]: TraceAbstraction took 14701.76ms. Allocated memory was 109.1MB in the beginning and 201.3MB in the end (delta: 92.3MB). Free memory was 63.5MB in the beginning and 72.7MB in the end (delta: -9.2MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. [2024-11-13 12:45:49,435 INFO L158 Benchmark]: Witness Printer took 6.12ms. Allocated memory is still 201.3MB. Free memory was 72.7MB in the beginning and 72.6MB in the end (delta: 17.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:45:49,437 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14ms. Allocated memory is still 83.9MB. Free memory is still 39.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 527.66ms. Allocated memory is still 109.1MB. Free memory was 82.4MB in the beginning and 67.1MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 136.14ms. Allocated memory is still 109.1MB. Free memory was 67.1MB in the beginning and 60.7MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 135.00ms. Allocated memory is still 109.1MB. Free memory was 60.7MB in the beginning and 50.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 927.65ms. Allocated memory is still 109.1MB. Free memory was 49.8MB in the beginning and 64.1MB in the end (delta: -14.3MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14701.76ms. Allocated memory was 109.1MB in the beginning and 201.3MB in the end (delta: 92.3MB). Free memory was 63.5MB in the beginning and 72.7MB in the end (delta: -9.2MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. * Witness Printer took 6.12ms. Allocated memory is still 201.3MB. Free memory was 72.7MB in the beginning and 72.6MB in the end (delta: 17.0kB). Peak memory consumption was 8.4MB. 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 someBinaryArithmeticDOUBLEoperation at line 64, overapproximation of bitwiseOr at line 119, overapproximation of bitwiseOr at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_3 = 64; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 2; [L26] unsigned short int var_1_6 = 10; [L27] double var_1_8 = 1.875; [L28] signed long int var_1_9 = -4; [L29] double var_1_10 = 63.5; [L30] double var_1_11 = 255.375; [L31] double var_1_12 = 999999999.525; [L32] double var_1_13 = 63.75; [L33] double var_1_14 = 0.625; [L34] unsigned short int var_1_15 = 5; [L35] signed char var_1_16 = 4; [L36] signed char var_1_17 = 0; [L37] signed char var_1_18 = -2; [L38] signed char var_1_19 = 1; [L39] unsigned short int var_1_20 = 50; [L40] unsigned short int var_1_21 = 0; [L41] unsigned char last_1_var_1_3 = 64; [L42] unsigned short int last_1_var_1_6 = 10; [L43] unsigned short int last_1_var_1_15 = 5; [L44] unsigned short int last_1_var_1_20 = 50; [L45] unsigned short int last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L112] last_1_var_1_3 = var_1_3 [L113] last_1_var_1_6 = var_1_6 [L114] last_1_var_1_15 = var_1_15 [L115] last_1_var_1_20 = var_1_20 [L116] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L126] RET updateLastVariables() [L127] CALL updateVariables() [L81] var_1_4 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L83] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L83] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L84] var_1_5 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L85] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L86] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L86] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L87] var_1_9 = __VERIFIER_nondet_long() [L88] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L88] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L89] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L89] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L90] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L90] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L91] var_1_10 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L92] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L93] var_1_11 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L94] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L95] var_1_12 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L96] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L97] var_1_13 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L98] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L99] var_1_14 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L100] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L101] var_1_17 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L102] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L103] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L103] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L104] var_1_18 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L105] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L106] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L106] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L107] var_1_19 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L108] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L109] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L109] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L127] RET updateVariables() [L128] CALL step() [L49] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L49] signed long int stepLocal_2 = last_1_var_1_20 ^ last_1_var_1_15; [L50] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=65, stepLocal_2=1, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L51] COND FALSE !(stepLocal_2 < -256) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=65, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L54] COND FALSE !(stepLocal_1 <= 50) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L58] var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4))) [L59] signed long int stepLocal_0 = last_1_var_1_21; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L60] COND FALSE !(last_1_var_1_6 < stepLocal_0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L63] COND TRUE var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L64] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L70] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L71] var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) [L72] unsigned short int stepLocal_3 = var_1_6; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L73] EXPR (var_1_3 * var_1_17) & (var_1_1 * var_1_18) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L73] COND FALSE !(stepLocal_3 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) [L76] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21 [L77] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L119] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L119] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L119] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L119-L120] return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.5s, OverallIterations: 11, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 920 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 916 mSDsluCounter, 3718 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2587 mSDsCounter, 286 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 781 IncrementalHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 286 mSolverCounterUnsat, 1131 mSDtfsCounter, 781 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 571 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1012occurred in iteration=10, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 677 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 1674 NumberOfCodeBlocks, 1674 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1265 ConstructedInterpolants, 0 QuantifiedInterpolants, 3953 SizeOfPredicates, 4 NumberOfNonLiveVariables, 323 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 6078/6120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 12:45:49,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-78.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c60f372b7dc1b4532187e57acf518ccbf786ab918ffb900907557784c73c0567 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:45:52,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:45:52,720 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 12:45:52,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:45:52,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:45:52,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:45:52,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:45:52,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:45:52,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:45:52,779 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:45:52,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:45:52,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:45:52,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:45:52,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:45:52,781 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:45:52,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:45:52,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:45:52,782 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:45:52,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:45:52,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:45:52,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:45:52,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:45:52,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:45:52,782 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 12:45:52,783 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 12:45:52,783 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:45:52,784 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 12:45:52,784 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:45:52,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:45:52,784 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:45:52,785 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:45:52,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:45:52,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:45:52,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:45:52,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:45:52,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:45:52,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:45:52,786 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:45:52,786 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 12:45:52,786 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 12:45:52,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:45:52,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:45:52,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:45:52,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:45:52,786 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c60f372b7dc1b4532187e57acf518ccbf786ab918ffb900907557784c73c0567 [2024-11-13 12:45:53,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:45:53,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:45:53,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:45:53,177 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:45:53,177 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:45:53,182 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-78.i Unable to find full path for "g++" [2024-11-13 12:45:55,330 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:45:55,667 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:45:55,667 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-78.i [2024-11-13 12:45:55,685 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/data/c371806dc/b2d56ab40d4543a0884334b664188364/FLAGe71530138 [2024-11-13 12:45:55,706 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/data/c371806dc/b2d56ab40d4543a0884334b664188364 [2024-11-13 12:45:55,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:45:55,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:45:55,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:45:55,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:45:55,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:45:55,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:45:55" (1/1) ... [2024-11-13 12:45:55,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a9d0928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:55, skipping insertion in model container [2024-11-13 12:45:55,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:45:55" (1/1) ... [2024-11-13 12:45:55,758 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:45:55,969 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-78.i[915,928] [2024-11-13 12:45:56,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:45:56,124 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:45:56,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-78.i[915,928] [2024-11-13 12:45:56,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:45:56,223 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:45:56,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:56 WrapperNode [2024-11-13 12:45:56,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:45:56,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:45:56,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:45:56,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:45:56,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:56" (1/1) ... [2024-11-13 12:45:56,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:56" (1/1) ... [2024-11-13 12:45:56,307 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2024-11-13 12:45:56,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:45:56,309 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:45:56,309 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:45:56,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:45:56,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:56" (1/1) ... [2024-11-13 12:45:56,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:56" (1/1) ... [2024-11-13 12:45:56,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:56" (1/1) ... [2024-11-13 12:45:56,358 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 12:45:56,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:56" (1/1) ... [2024-11-13 12:45:56,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:56" (1/1) ... [2024-11-13 12:45:56,383 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:56" (1/1) ... [2024-11-13 12:45:56,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:56" (1/1) ... [2024-11-13 12:45:56,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:56" (1/1) ... [2024-11-13 12:45:56,402 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:56" (1/1) ... [2024-11-13 12:45:56,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:45:56,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:45:56,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:45:56,416 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:45:56,417 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:56" (1/1) ... [2024-11-13 12:45:56,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:45:56,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:56,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:45:56,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:45:56,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:45:56,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 12:45:56,507 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 12:45:56,507 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 12:45:56,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:45:56,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:45:56,640 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:45:56,643 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:46:03,810 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-13 12:46:03,810 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:46:03,822 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:46:03,823 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 12:46:03,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:46:03 BoogieIcfgContainer [2024-11-13 12:46:03,823 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:46:03,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:46:03,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:46:03,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:46:03,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:45:55" (1/3) ... [2024-11-13 12:46:03,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46406ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:46:03, skipping insertion in model container [2024-11-13 12:46:03,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:56" (2/3) ... [2024-11-13 12:46:03,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46406ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:46:03, skipping insertion in model container [2024-11-13 12:46:03,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:46:03" (3/3) ... [2024-11-13 12:46:03,840 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-78.i [2024-11-13 12:46:03,862 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:46:03,864 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-78.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 12:46:03,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:46:03,960 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@10c27a89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:46:03,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 12:46:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 12:46:03,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 12:46:03,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:03,981 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:03,982 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:03,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:03,987 INFO L85 PathProgramCache]: Analyzing trace with hash 755570282, now seen corresponding path program 1 times [2024-11-13 12:46:03,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:04,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573291749] [2024-11-13 12:46:04,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:04,001 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:04,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:04,006 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:46:04,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-13 12:46:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:04,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 12:46:04,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:04,770 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 12:46:04,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:46:04,771 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:04,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573291749] [2024-11-13 12:46:04,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573291749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:46:04,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:46:04,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:46:04,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496387749] [2024-11-13 12:46:04,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:04,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:46:04,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:04,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:46:04,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:46:04,808 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:46:08,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 12:46:08,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:08,995 INFO L93 Difference]: Finished difference Result 107 states and 180 transitions. [2024-11-13 12:46:09,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:46:09,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 117 [2024-11-13 12:46:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:09,039 INFO L225 Difference]: With dead ends: 107 [2024-11-13 12:46:09,039 INFO L226 Difference]: Without dead ends: 53 [2024-11-13 12:46:09,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:46:09,046 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:09,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-11-13 12:46:09,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-13 12:46:09,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-13 12:46:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 12:46:09,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2024-11-13 12:46:09,103 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 117 [2024-11-13 12:46:09,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:09,106 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2024-11-13 12:46:09,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:46:09,106 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2024-11-13 12:46:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 12:46:09,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:09,110 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:09,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-13 12:46:09,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:09,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:09,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:09,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1990222348, now seen corresponding path program 1 times [2024-11-13 12:46:09,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:09,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995837224] [2024-11-13 12:46:09,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:09,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:09,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:09,318 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:46:09,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 12:46:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:09,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 12:46:09,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 12:46:12,413 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:46:12,413 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:12,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995837224] [2024-11-13 12:46:12,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995837224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:46:12,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:46:12,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:46:12,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225523658] [2024-11-13 12:46:12,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:12,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:46:12,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:12,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:46:12,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:46:12,420 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:46:17,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:19,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:23,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:23,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:23,952 INFO L93 Difference]: Finished difference Result 167 states and 241 transitions. [2024-11-13 12:46:23,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:46:23,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-13 12:46:23,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:23,984 INFO L225 Difference]: With dead ends: 167 [2024-11-13 12:46:23,984 INFO L226 Difference]: Without dead ends: 117 [2024-11-13 12:46:23,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:46:23,986 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 54 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:23,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 259 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 71 Invalid, 2 Unknown, 0 Unchecked, 11.3s Time] [2024-11-13 12:46:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-13 12:46:24,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2024-11-13 12:46:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.203125) internal successors, (77), 64 states have internal predecessors, (77), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 12:46:24,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2024-11-13 12:46:24,021 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 118 [2024-11-13 12:46:24,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:24,022 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2024-11-13 12:46:24,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:46:24,023 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2024-11-13 12:46:24,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 12:46:24,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:24,026 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:24,042 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-13 12:46:24,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:24,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:24,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:24,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1310163978, now seen corresponding path program 1 times [2024-11-13 12:46:24,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:24,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130007201] [2024-11-13 12:46:24,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:24,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:24,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:24,233 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:46:24,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-13 12:46:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:24,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 12:46:24,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:27,433 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 12:46:27,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:46:27,434 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:27,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130007201] [2024-11-13 12:46:27,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130007201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:46:27,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:46:27,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:46:27,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991777804] [2024-11-13 12:46:27,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:27,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:46:27,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:27,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:46:27,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:46:27,439 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:46:30,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:32,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:37,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:38,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:41,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:44,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:49,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:50,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:46:50,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:50,774 INFO L93 Difference]: Finished difference Result 274 states and 394 transitions. [2024-11-13 12:46:50,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:46:50,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-13 12:46:50,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:50,811 INFO L225 Difference]: With dead ends: 274 [2024-11-13 12:46:50,811 INFO L226 Difference]: Without dead ends: 224 [2024-11-13 12:46:50,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:46:50,813 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 137 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:50,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 254 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 249 Invalid, 2 Unknown, 0 Unchecked, 23.0s Time] [2024-11-13 12:46:50,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-13 12:46:50,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 190. [2024-11-13 12:46:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 113 states have (on average 1.176991150442478) internal successors, (133), 113 states have internal predecessors, (133), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-13 12:46:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 277 transitions. [2024-11-13 12:46:50,879 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 277 transitions. Word has length 118 [2024-11-13 12:46:50,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:50,880 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 277 transitions. [2024-11-13 12:46:50,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:46:50,880 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 277 transitions. [2024-11-13 12:46:50,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 12:46:50,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:50,883 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:50,893 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-13 12:46:51,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:51,087 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:51,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:51,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1252905676, now seen corresponding path program 1 times [2024-11-13 12:46:51,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:51,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387883199] [2024-11-13 12:46:51,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:51,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:51,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:51,096 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:46:51,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-13 12:46:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:52,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 12:46:52,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-11-13 12:46:54,280 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:57,220 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:57,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387883199] [2024-11-13 12:46:57,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387883199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:57,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831823816] [2024-11-13 12:46:57,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:57,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:57,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:46:57,229 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:46:57,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 12:46:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:57,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 12:46:57,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:59,324 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 12:46:59,324 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:46:59,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831823816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:46:59,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:46:59,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-13 12:46:59,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575545333] [2024-11-13 12:46:59,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:59,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:46:59,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:59,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:46:59,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-13 12:46:59,327 INFO L87 Difference]: Start difference. First operand 190 states and 277 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:47:01,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:47:06,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:47:09,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:47:12,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:47:16,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:47:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:47:16,993 INFO L93 Difference]: Finished difference Result 382 states and 548 transitions. [2024-11-13 12:47:16,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:47:16,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-13 12:47:16,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:47:16,998 INFO L225 Difference]: With dead ends: 382 [2024-11-13 12:47:16,999 INFO L226 Difference]: Without dead ends: 284 [2024-11-13 12:47:17,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-13 12:47:17,001 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 43 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:47:17,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 195 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 2 Unknown, 0 Unchecked, 17.6s Time] [2024-11-13 12:47:17,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-13 12:47:17,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 278. [2024-11-13 12:47:17,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 175 states have (on average 1.2) internal successors, (210), 177 states have internal predecessors, (210), 94 states have call successors, (94), 8 states have call predecessors, (94), 8 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-13 12:47:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 398 transitions. [2024-11-13 12:47:17,069 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 398 transitions. Word has length 118 [2024-11-13 12:47:17,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:47:17,071 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 398 transitions. [2024-11-13 12:47:17,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:47:17,072 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 398 transitions. [2024-11-13 12:47:17,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 12:47:17,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:47:17,078 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:47:17,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 12:47:17,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-13 12:47:17,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:47:17,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:47:17,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:47:17,480 INFO L85 PathProgramCache]: Analyzing trace with hash -609099400, now seen corresponding path program 1 times [2024-11-13 12:47:17,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:47:17,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709858705] [2024-11-13 12:47:17,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:47:17,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:47:17,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:47:17,483 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:47:17,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-13 12:47:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:17,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 12:47:17,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:47:19,800 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 12:47:19,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:47:19,801 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:47:19,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709858705] [2024-11-13 12:47:19,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709858705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:47:19,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:47:19,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:47:19,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938399369] [2024-11-13 12:47:19,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:47:19,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:47:19,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:47:19,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:47:19,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:47:19,803 INFO L87 Difference]: Start difference. First operand 278 states and 398 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:47:23,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:47:27,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:47:31,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 12:47:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:47:31,185 INFO L93 Difference]: Finished difference Result 397 states and 569 transitions. [2024-11-13 12:47:31,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:47:31,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-13 12:47:31,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:47:31,193 INFO L225 Difference]: With dead ends: 397 [2024-11-13 12:47:31,194 INFO L226 Difference]: Without dead ends: 280 [2024-11-13 12:47:31,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:47:31,196 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 13 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:47:31,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 167 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 1 Unknown, 0 Unchecked, 11.3s Time] [2024-11-13 12:47:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-13 12:47:31,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2024-11-13 12:47:31,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 175 states have (on average 1.1942857142857144) internal successors, (209), 177 states have internal predecessors, (209), 94 states have call successors, (94), 8 states have call predecessors, (94), 8 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-13 12:47:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 397 transitions. [2024-11-13 12:47:31,256 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 397 transitions. Word has length 118 [2024-11-13 12:47:31,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:47:31,257 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 397 transitions. [2024-11-13 12:47:31,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 12:47:31,257 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 397 transitions. [2024-11-13 12:47:31,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 12:47:31,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:47:31,260 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:47:31,276 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-13 12:47:31,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:47:31,462 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:47:31,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:47:31,463 INFO L85 PathProgramCache]: Analyzing trace with hash -551841098, now seen corresponding path program 1 times [2024-11-13 12:47:31,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:47:31,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116293773] [2024-11-13 12:47:31,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:47:31,463 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:47:31,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:47:31,465 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:47:31,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c0e8394-a212-41ed-8640-dbfe5227374c/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-13 12:47:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:32,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-13 12:47:32,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:48:23,053 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:48:31,118 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:48:38,516 WARN L286 SmtUtils]: Spent 7.40s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:48:46,635 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:48:52,791 WARN L286 SmtUtils]: Spent 6.16s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:49:00,066 WARN L286 SmtUtils]: Spent 7.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:49:07,696 WARN L286 SmtUtils]: Spent 7.63s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:49:14,600 WARN L286 SmtUtils]: Spent 6.90s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:49:22,713 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:49:29,217 WARN L286 SmtUtils]: Spent 6.50s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:49:37,340 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:49:45,465 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:49:53,561 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:50:01,664 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:50:09,758 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:50:16,335 WARN L286 SmtUtils]: Spent 6.58s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:50:24,420 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:50:32,278 WARN L286 SmtUtils]: Spent 7.86s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:50:40,372 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:50:47,426 WARN L286 SmtUtils]: Spent 7.05s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:50:54,700 WARN L286 SmtUtils]: Spent 7.27s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:51:02,851 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:51:10,929 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:51:19,083 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:51:27,175 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:51:35,261 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:51:43,040 WARN L286 SmtUtils]: Spent 7.78s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:51:51,159 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:52:06,758 WARN L286 SmtUtils]: Spent 7.23s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:52:10,792 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_19~0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (.cse5 ((_ zero_extend 24) c_~var_1_5~0)) (.cse8 ((_ sign_extend 24) c_~var_1_17~0)) (.cse1 ((_ sign_extend 24) c_~var_1_18~0))) (and (bvsge .cse0 (_ bv4294967265 32)) (bvsle .cse1 (_ bv32 32)) (let ((.cse3 (bvadd (_ bv10 32) .cse5)) (.cse4 ((_ zero_extend 24) c_~var_1_4~0))) (let ((.cse2 (bvsgt .cse3 .cse4))) (or (and .cse2 (= ((_ extract 15 0) .cse3) c_~var_1_20~0)) (and (= ((_ extract 15 0) .cse4) c_~var_1_20~0) (not .cse2))))) (= (_ bv0 16) c_~var_1_21~0) (fp.leq c_~var_1_12~0 .cse6) (fp.geq c_~var_1_14~0 .cse7) (bvsle .cse0 (_ bv31 32)) (fp.leq c_~var_1_14~0 .cse6) (fp.geq c_~var_1_13~0 .cse7) (fp.geq c_~var_1_12~0 .cse7) (fp.leq c_~var_1_13~0 .cse6) (bvsge .cse8 (_ bv4294967233 32)) (let ((.cse9 (fp.gt c_~var_1_10~0 c_~var_1_11~0)) (.cse10 (fp.sub c_currentRoundingMode c_~var_1_13~0 c_~var_1_14~0))) (or (and .cse9 (= c_~var_1_8~0 (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_10~0 c_~var_1_12~0) .cse10))) (and (not .cse9) (= c_~var_1_8~0 (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_11~0 c_~var_1_12~0) .cse10))))) (fp.leq c_~var_1_11~0 .cse6) (fp.geq c_~var_1_11~0 .cse7) (bvslt (_ bv64 32) (bvsrem .cse5 c_~var_1_9~0)) (not (bvsgt (_ bv32 32) c_~var_1_9~0)) (bvsle .cse8 (_ bv63 32)) (= c_~var_1_3~0 (_ bv64 8)) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv10 16) c_~var_1_6~0) (= (_ bv0 16) c_~last_1_var_1_21~0) (bvsge .cse1 (_ bv4294967265 32)))) is different from false [2024-11-13 12:52:18,963 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:52:27,061 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:52:33,466 WARN L286 SmtUtils]: Spent 6.40s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:52:41,551 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:52:49,647 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:52:57,740 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:53:05,290 WARN L286 SmtUtils]: Spent 7.55s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:53:12,549 WARN L286 SmtUtils]: Spent 7.26s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:53:20,630 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:53:27,465 WARN L286 SmtUtils]: Spent 6.83s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:53:33,442 WARN L286 SmtUtils]: Spent 5.98s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:53:41,527 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:53:49,331 WARN L286 SmtUtils]: Spent 7.80s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:53:56,347 WARN L286 SmtUtils]: Spent 7.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:54:02,080 WARN L286 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:54:10,167 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:54:17,321 WARN L286 SmtUtils]: Spent 7.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:54:25,395 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:54:32,525 WARN L286 SmtUtils]: Spent 7.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:54:40,618 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:54:47,506 WARN L286 SmtUtils]: Spent 6.89s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:54:55,659 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:55:02,798 WARN L286 SmtUtils]: Spent 7.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:55:10,907 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:55:19,051 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:55:26,442 WARN L286 SmtUtils]: Spent 7.39s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:55:33,088 WARN L286 SmtUtils]: Spent 6.65s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:55:41,204 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:55:48,578 WARN L286 SmtUtils]: Spent 7.37s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:56:01,594 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:56:08,710 WARN L286 SmtUtils]: Spent 7.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:56:16,798 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:56:24,078 WARN L286 SmtUtils]: Spent 7.28s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:56:32,201 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:56:40,360 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:56:48,071 WARN L286 SmtUtils]: Spent 7.71s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:56:52,104 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_19~0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (.cse5 ((_ zero_extend 24) c_~var_1_5~0)) (.cse8 ((_ sign_extend 24) c_~var_1_17~0)) (.cse1 ((_ sign_extend 24) c_~var_1_18~0))) (and (bvsge .cse0 (_ bv4294967265 32)) (bvsle .cse1 (_ bv32 32)) (let ((.cse3 (bvadd (_ bv10 32) .cse5)) (.cse4 ((_ zero_extend 24) c_~var_1_4~0))) (let ((.cse2 (bvsgt .cse3 .cse4))) (or (and .cse2 (= ((_ extract 15 0) .cse3) c_~var_1_20~0)) (and (= ((_ extract 15 0) .cse4) c_~var_1_20~0) (not .cse2))))) (= (_ bv0 16) c_~var_1_21~0) (fp.leq c_~var_1_12~0 .cse6) (fp.geq c_~var_1_14~0 .cse7) (bvsle .cse0 (_ bv31 32)) (fp.leq c_~var_1_14~0 .cse6) (fp.geq c_~var_1_13~0 .cse7) (fp.geq c_~var_1_12~0 .cse7) (fp.leq c_~var_1_13~0 .cse6) (bvsge .cse8 (_ bv4294967233 32)) (let ((.cse9 (bvslt .cse0 (_ bv0 32)))) (or (and (= c_~var_1_16~0 ((_ extract 7 0) (bvadd .cse0 .cse8 .cse1))) (not .cse9)) (and (= ((_ extract 7 0) (bvadd .cse8 .cse1 (bvneg .cse0))) c_~var_1_16~0) .cse9))) (let ((.cse10 (fp.gt c_~var_1_10~0 c_~var_1_11~0)) (.cse11 (fp.sub c_currentRoundingMode c_~var_1_13~0 c_~var_1_14~0))) (or (and .cse10 (= c_~var_1_8~0 (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_10~0 c_~var_1_12~0) .cse11))) (and (not .cse10) (= c_~var_1_8~0 (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_11~0 c_~var_1_12~0) .cse11))))) (fp.leq c_~var_1_11~0 .cse6) (fp.geq c_~var_1_11~0 .cse7) (let ((.cse12 ((_ sign_extend 24) c_~var_1_16~0))) (let ((.cse13 (bvslt .cse12 (_ bv0 32)))) (or (and (= c_~var_1_1~0 (bvneg .cse12)) .cse13) (and (not .cse13) (= .cse12 c_~var_1_1~0))))) (bvslt (_ bv64 32) (bvsrem .cse5 c_~var_1_9~0)) (not (bvsgt (_ bv32 32) c_~var_1_9~0)) (bvsle .cse8 (_ bv63 32)) (= c_~var_1_3~0 (_ bv64 8)) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv10 16) c_~var_1_6~0) (= (_ bv0 16) c_~last_1_var_1_21~0) (bvsge .cse1 (_ bv4294967265 32)))) is different from false [2024-11-13 12:57:00,331 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:57:08,055 WARN L286 SmtUtils]: Spent 7.72s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:57:16,161 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:57:24,317 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:57:32,269 WARN L286 SmtUtils]: Spent 7.95s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:57:40,138 WARN L286 SmtUtils]: Spent 7.87s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:57:48,282 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:57:54,669 WARN L286 SmtUtils]: Spent 6.39s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:58:02,504 WARN L286 SmtUtils]: Spent 7.83s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:58:10,613 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:58:18,722 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:58:26,842 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:58:34,932 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:58:42,383 WARN L286 SmtUtils]: Spent 7.45s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:58:50,532 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:58:58,642 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:59:05,439 WARN L286 SmtUtils]: Spent 6.80s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:59:12,949 WARN L286 SmtUtils]: Spent 7.51s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:59:21,147 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:59:29,236 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:59:35,748 WARN L286 SmtUtils]: Spent 6.51s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:59:41,972 WARN L286 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:59:49,346 WARN L286 SmtUtils]: Spent 7.37s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 12:59:55,762 WARN L286 SmtUtils]: Spent 6.42s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:00:03,841 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:00:11,970 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:00:20,087 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:00:26,801 WARN L286 SmtUtils]: Spent 6.71s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)