./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.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_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 f19691bed5efac00db0d1847b045469616a042925c91020b77da6e1bd979a486 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:29:11,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:29:11,594 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 15:29:11,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:29:11,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:29:11,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:29:11,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:29:11,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:29:11,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:29:11,653 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:29:11,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:29:11,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:29:11,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:29:11,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:29:11,657 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:29:11,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:29:11,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:29:11,658 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:29:11,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:29:11,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:29:11,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:29:11,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:29:11,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:29:11,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:29:11,659 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:29:11,659 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:29:11,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:29:11,659 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:29:11,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:29:11,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:29:11,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:29:11,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:29:11,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:29:11,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:29:11,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:29:11,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:29:11,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:29:11,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:29:11,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:29:11,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:29:11,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:29:11,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:29:11,662 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_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 -> f19691bed5efac00db0d1847b045469616a042925c91020b77da6e1bd979a486 [2024-11-13 15:29:12,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:29:12,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:29:12,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:29:12,048 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:29:12,048 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:29:12,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i Unable to find full path for "g++" [2024-11-13 15:29:14,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:29:14,754 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:29:14,755 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i [2024-11-13 15:29:14,767 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/data/740ef3275/48c1ec3ddbb64bc08597713160fdea70/FLAG5c3f57eca [2024-11-13 15:29:14,785 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/data/740ef3275/48c1ec3ddbb64bc08597713160fdea70 [2024-11-13 15:29:14,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:29:14,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:29:14,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:29:14,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:29:14,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:29:14,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:29:14" (1/1) ... [2024-11-13 15:29:14,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c84acd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:14, skipping insertion in model container [2024-11-13 15:29:14,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:29:14" (1/1) ... [2024-11-13 15:29:14,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:29:15,064 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_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i[919,932] [2024-11-13 15:29:15,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:29:15,168 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:29:15,183 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_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i[919,932] [2024-11-13 15:29:15,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:29:15,265 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:29:15,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:15 WrapperNode [2024-11-13 15:29:15,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:29:15,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:29:15,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:29:15,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:29:15,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:15" (1/1) ... [2024-11-13 15:29:15,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:15" (1/1) ... [2024-11-13 15:29:15,367 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 255 [2024-11-13 15:29:15,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:29:15,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:29:15,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:29:15,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:29:15,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:15" (1/1) ... [2024-11-13 15:29:15,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:15" (1/1) ... [2024-11-13 15:29:15,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:15" (1/1) ... [2024-11-13 15:29:15,423 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 15:29:15,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:15" (1/1) ... [2024-11-13 15:29:15,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:15" (1/1) ... [2024-11-13 15:29:15,444 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:15" (1/1) ... [2024-11-13 15:29:15,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:15" (1/1) ... [2024-11-13 15:29:15,462 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:15" (1/1) ... [2024-11-13 15:29:15,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:15" (1/1) ... [2024-11-13 15:29:15,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:29:15,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:29:15,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:29:15,476 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:29:15,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:15" (1/1) ... [2024-11-13 15:29:15,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:29:15,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:29:15,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:29:15,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:29:15,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:29:15,569 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:29:15,569 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:29:15,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:29:15,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:29:15,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:29:15,741 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:29:15,744 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:29:16,430 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-13 15:29:16,430 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:29:16,442 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:29:16,443 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:29:16,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:29:16 BoogieIcfgContainer [2024-11-13 15:29:16,443 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:29:16,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:29:16,446 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:29:16,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:29:16,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:29:14" (1/3) ... [2024-11-13 15:29:16,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b18bcd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:29:16, skipping insertion in model container [2024-11-13 15:29:16,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:15" (2/3) ... [2024-11-13 15:29:16,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b18bcd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:29:16, skipping insertion in model container [2024-11-13 15:29:16,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:29:16" (3/3) ... [2024-11-13 15:29:16,455 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i [2024-11-13 15:29:16,475 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:29:16,477 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:29:16,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:29:16,568 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;@46fa3d52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:29:16,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:29:16,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 66 states have internal predecessors, (93), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 15:29:16,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-13 15:29:16,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:29:16,616 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:29:16,617 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:29:16,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:29:16,622 INFO L85 PathProgramCache]: Analyzing trace with hash -239915899, now seen corresponding path program 1 times [2024-11-13 15:29:16,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:29:16,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139496777] [2024-11-13 15:29:16,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:16,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:29:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:29:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:29:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:29:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:29:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:29:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:29:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:29:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:29:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:29:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:29:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:29:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:29:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:29:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:29:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:29:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:29:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:29:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:29:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-13 15:29:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-13 15:29:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 15:29:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 15:29:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 15:29:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 15:29:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-13 15:29:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-13 15:29:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-13 15:29:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-13 15:29:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-13 15:29:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-13 15:29:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-13 15:29:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-13 15:29:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-13 15:29:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-13 15:29:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-13 15:29:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-13 15:29:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-13 15:29:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-13 15:29:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-13 15:29:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-13 15:29:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-13 15:29:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-13 15:29:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-13 15:29:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-11-13 15:29:17,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:29:17,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139496777] [2024-11-13 15:29:17,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139496777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:29:17,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:29:17,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:29:17,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071373304] [2024-11-13 15:29:17,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:29:17,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:29:17,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:29:17,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:29:17,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:29:17,596 INFO L87 Difference]: Start difference. First operand has 112 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 66 states have internal predecessors, (93), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-13 15:29:17,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:29:17,643 INFO L93 Difference]: Finished difference Result 217 states and 400 transitions. [2024-11-13 15:29:17,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:29:17,646 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) Word has length 265 [2024-11-13 15:29:17,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:29:17,655 INFO L225 Difference]: With dead ends: 217 [2024-11-13 15:29:17,655 INFO L226 Difference]: Without dead ends: 108 [2024-11-13 15:29:17,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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 15:29:17,664 INFO L432 NwaCegarLoop]: 174 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, 174 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 15:29:17,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:29:17,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-13 15:29:17,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-13 15:29:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 62 states have internal predecessors, (86), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 15:29:17,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 174 transitions. [2024-11-13 15:29:17,749 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 174 transitions. Word has length 265 [2024-11-13 15:29:17,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:29:17,750 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 174 transitions. [2024-11-13 15:29:17,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-13 15:29:17,754 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 174 transitions. [2024-11-13 15:29:17,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-13 15:29:17,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:29:17,764 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:29:17,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:29:17,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:29:17,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:29:17,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1204174383, now seen corresponding path program 1 times [2024-11-13 15:29:17,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:29:17,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033336695] [2024-11-13 15:29:17,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:17,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:29:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:29:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:29:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:29:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:29:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:29:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:29:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:29:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:29:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:29:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:29:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:29:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:29:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:29:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:29:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:29:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:29:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:29:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:29:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-13 15:29:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-13 15:29:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 15:29:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 15:29:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 15:29:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 15:29:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-13 15:29:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-13 15:29:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-13 15:29:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-13 15:29:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-13 15:29:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-13 15:29:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-13 15:29:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-13 15:29:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-13 15:29:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-13 15:29:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-13 15:29:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-13 15:29:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-13 15:29:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-13 15:29:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-13 15:29:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-13 15:29:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-13 15:29:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-13 15:29:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-13 15:29:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:18,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-11-13 15:29:18,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:29:18,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033336695] [2024-11-13 15:29:18,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033336695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:29:18,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:29:18,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:29:18,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457214248] [2024-11-13 15:29:18,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:29:18,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:29:18,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:29:18,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:29:18,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:29:18,623 INFO L87 Difference]: Start difference. First operand 108 states and 174 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 15:29:18,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:29:18,831 INFO L93 Difference]: Finished difference Result 309 states and 499 transitions. [2024-11-13 15:29:18,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:29:18,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 265 [2024-11-13 15:29:18,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:29:18,840 INFO L225 Difference]: With dead ends: 309 [2024-11-13 15:29:18,840 INFO L226 Difference]: Without dead ends: 204 [2024-11-13 15:29:18,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 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 15:29:18,847 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 148 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:29:18,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 441 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:29:18,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-13 15:29:18,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2024-11-13 15:29:18,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 111 states have internal predecessors, (146), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-13 15:29:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 322 transitions. [2024-11-13 15:29:18,953 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 322 transitions. Word has length 265 [2024-11-13 15:29:18,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:29:18,955 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 322 transitions. [2024-11-13 15:29:18,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 15:29:18,955 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 322 transitions. [2024-11-13 15:29:18,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-13 15:29:18,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:29:18,969 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:29:18,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:29:18,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:29:18,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:29:18,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1968127488, now seen corresponding path program 1 times [2024-11-13 15:29:18,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:29:18,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72009005] [2024-11-13 15:29:18,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:18,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:29:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:29:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:29:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:29:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:29:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:29:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:29:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:29:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:29:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:29:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:29:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:29:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:29:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:29:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:29:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:29:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:29:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:29:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:29:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-13 15:29:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-13 15:29:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 15:29:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 15:29:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 15:29:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 15:29:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-13 15:29:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-13 15:29:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-13 15:29:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-13 15:29:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-13 15:29:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-13 15:29:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-13 15:29:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-13 15:29:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-13 15:29:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-13 15:29:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-13 15:29:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-13 15:29:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-13 15:29:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-13 15:29:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-13 15:29:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-13 15:29:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-13 15:29:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-13 15:29:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-13 15:29:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-11-13 15:29:19,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:29:19,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72009005] [2024-11-13 15:29:19,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72009005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:29:19,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:29:19,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:29:19,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353363130] [2024-11-13 15:29:19,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:29:19,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:29:19,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:29:19,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:29:19,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:29:19,586 INFO L87 Difference]: Start difference. First operand 202 states and 322 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-13 15:29:19,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:29:19,697 INFO L93 Difference]: Finished difference Result 401 states and 641 transitions. [2024-11-13 15:29:19,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:29:19,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 266 [2024-11-13 15:29:19,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:29:19,703 INFO L225 Difference]: With dead ends: 401 [2024-11-13 15:29:19,704 INFO L226 Difference]: Without dead ends: 202 [2024-11-13 15:29:19,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 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 15:29:19,706 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 146 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:29:19,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 163 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:29:19,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-13 15:29:19,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-11-13 15:29:19,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 111 states have internal predecessors, (145), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-13 15:29:19,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 321 transitions. [2024-11-13 15:29:19,777 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 321 transitions. Word has length 266 [2024-11-13 15:29:19,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:29:19,778 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 321 transitions. [2024-11-13 15:29:19,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-13 15:29:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 321 transitions. [2024-11-13 15:29:19,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-13 15:29:19,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:29:19,788 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:29:19,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:29:19,789 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:29:19,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:29:19,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1740033794, now seen corresponding path program 1 times [2024-11-13 15:29:19,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:29:19,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003740615] [2024-11-13 15:29:19,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:19,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:29:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:29:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:29:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:29:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:29:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:29:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:29:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:29:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:29:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:29:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:29:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:29:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:29:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:29:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:29:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:29:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:29:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:29:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:29:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-13 15:29:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-13 15:29:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 15:29:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 15:29:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 15:29:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 15:29:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-13 15:29:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-13 15:29:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-13 15:29:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-13 15:29:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-13 15:29:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-13 15:29:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-13 15:29:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-13 15:29:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-13 15:29:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-13 15:29:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-13 15:29:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-13 15:29:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-13 15:29:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-13 15:29:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-13 15:29:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-13 15:29:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-13 15:29:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-13 15:29:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-13 15:29:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-11-13 15:29:20,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:29:20,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003740615] [2024-11-13 15:29:20,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003740615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:29:20,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:29:20,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:29:20,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205803222] [2024-11-13 15:29:20,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:29:20,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:29:20,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:29:20,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:29:20,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:29:20,682 INFO L87 Difference]: Start difference. First operand 202 states and 321 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 15:29:20,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:29:20,832 INFO L93 Difference]: Finished difference Result 504 states and 806 transitions. [2024-11-13 15:29:20,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:29:20,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 266 [2024-11-13 15:29:20,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:29:20,842 INFO L225 Difference]: With dead ends: 504 [2024-11-13 15:29:20,842 INFO L226 Difference]: Without dead ends: 305 [2024-11-13 15:29:20,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 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 15:29:20,848 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 94 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:29:20,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 320 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:29:20,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-13 15:29:20,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2024-11-13 15:29:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 167 states have (on average 1.3173652694610778) internal successors, (220), 167 states have internal predecessors, (220), 132 states have call successors, (132), 3 states have call predecessors, (132), 3 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-13 15:29:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 484 transitions. [2024-11-13 15:29:20,946 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 484 transitions. Word has length 266 [2024-11-13 15:29:20,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:29:20,947 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 484 transitions. [2024-11-13 15:29:20,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 15:29:20,948 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 484 transitions. [2024-11-13 15:29:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-13 15:29:20,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:29:20,956 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:29:20,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:29:20,956 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:29:20,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:29:20,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1430675819, now seen corresponding path program 1 times [2024-11-13 15:29:20,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:29:20,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672075363] [2024-11-13 15:29:20,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:20,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:29:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:29:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:29:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:29:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:29:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:29:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:29:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:29:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:29:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:29:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:29:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:29:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:29:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:29:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:29:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:29:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:29:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:29:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:29:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-13 15:29:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-13 15:29:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 15:29:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 15:29:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 15:29:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 15:29:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-13 15:29:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-13 15:29:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-13 15:29:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-13 15:29:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-13 15:29:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-13 15:29:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-13 15:29:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-13 15:29:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-13 15:29:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-13 15:29:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-13 15:29:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-13 15:29:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-13 15:29:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-13 15:29:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-13 15:29:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-13 15:29:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-13 15:29:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-13 15:29:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-13 15:29:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:21,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-11-13 15:29:21,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:29:21,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672075363] [2024-11-13 15:29:21,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672075363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:29:21,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:29:21,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:29:21,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404147580] [2024-11-13 15:29:21,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:29:21,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:29:21,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:29:21,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:29:21,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:29:21,736 INFO L87 Difference]: Start difference. First operand 303 states and 484 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 15:29:22,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:29:22,178 INFO L93 Difference]: Finished difference Result 690 states and 1105 transitions. [2024-11-13 15:29:22,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:29:22,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 267 [2024-11-13 15:29:22,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:29:22,187 INFO L225 Difference]: With dead ends: 690 [2024-11-13 15:29:22,188 INFO L226 Difference]: Without dead ends: 390 [2024-11-13 15:29:22,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 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 15:29:22,191 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 63 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:29:22,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 390 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:29:22,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-13 15:29:22,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 386. [2024-11-13 15:29:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 205 states have (on average 1.2829268292682927) internal successors, (263), 205 states have internal predecessors, (263), 176 states have call successors, (176), 4 states have call predecessors, (176), 4 states have return successors, (176), 176 states have call predecessors, (176), 176 states have call successors, (176) [2024-11-13 15:29:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 615 transitions. [2024-11-13 15:29:22,286 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 615 transitions. Word has length 267 [2024-11-13 15:29:22,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:29:22,287 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 615 transitions. [2024-11-13 15:29:22,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 15:29:22,288 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 615 transitions. [2024-11-13 15:29:22,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 15:29:22,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:29:22,292 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:29:22,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:29:22,292 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:29:22,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:29:22,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1156030062, now seen corresponding path program 1 times [2024-11-13 15:29:22,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:29:22,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011522876] [2024-11-13 15:29:22,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:22,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:29:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:29:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:29:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:29:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:29:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:29:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:29:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:29:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:29:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:29:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:29:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:29:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:29:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:29:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:29:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:29:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:29:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:29:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:29:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-13 15:29:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-13 15:29:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 15:29:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 15:29:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 15:29:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 15:29:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-13 15:29:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-13 15:29:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-13 15:29:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-13 15:29:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-13 15:29:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-13 15:29:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-13 15:29:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-13 15:29:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-13 15:29:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-13 15:29:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:22,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-13 15:29:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:23,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-13 15:29:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:23,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-13 15:29:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:23,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-13 15:29:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:23,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-13 15:29:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:23,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-13 15:29:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:23,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-13 15:29:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:23,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-13 15:29:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:23,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-13 15:29:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:23,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-11-13 15:29:23,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:29:23,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011522876] [2024-11-13 15:29:23,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011522876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:29:23,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:29:23,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:29:23,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137662361] [2024-11-13 15:29:23,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:29:23,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:29:23,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:29:23,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:29:23,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:29:23,052 INFO L87 Difference]: Start difference. First operand 386 states and 615 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 15:29:23,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:29:23,272 INFO L93 Difference]: Finished difference Result 699 states and 1120 transitions. [2024-11-13 15:29:23,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:29:23,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 268 [2024-11-13 15:29:23,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:29:23,279 INFO L225 Difference]: With dead ends: 699 [2024-11-13 15:29:23,280 INFO L226 Difference]: Without dead ends: 399 [2024-11-13 15:29:23,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:29:23,285 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 170 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:29:23,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 330 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:29:23,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-13 15:29:23,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 389. [2024-11-13 15:29:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 208 states have (on average 1.2884615384615385) internal successors, (268), 208 states have internal predecessors, (268), 176 states have call successors, (176), 4 states have call predecessors, (176), 4 states have return successors, (176), 176 states have call predecessors, (176), 176 states have call successors, (176) [2024-11-13 15:29:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 620 transitions. [2024-11-13 15:29:23,382 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 620 transitions. Word has length 268 [2024-11-13 15:29:23,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:29:23,382 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 620 transitions. [2024-11-13 15:29:23,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 15:29:23,383 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 620 transitions. [2024-11-13 15:29:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 15:29:23,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:29:23,389 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:29:23,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:29:23,389 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:29:23,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:29:23,390 INFO L85 PathProgramCache]: Analyzing trace with hash -897864624, now seen corresponding path program 1 times [2024-11-13 15:29:23,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:29:23,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61578376] [2024-11-13 15:29:23,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:23,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:29:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:29:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:29:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:29:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:29:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:29:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:29:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:29:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:29:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:29:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:29:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:29:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:29:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:29:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:29:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:29:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:29:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:29:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:29:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-13 15:29:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-13 15:29:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 15:29:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 15:29:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 15:29:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 15:29:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-13 15:29:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-13 15:29:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-13 15:29:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-13 15:29:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-13 15:29:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-13 15:29:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-13 15:29:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-13 15:29:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-13 15:29:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-13 15:29:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-13 15:29:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-13 15:29:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-13 15:29:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-13 15:29:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-13 15:29:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-13 15:29:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-13 15:29:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-13 15:29:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-13 15:29:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-11-13 15:29:24,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:29:24,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61578376] [2024-11-13 15:29:24,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61578376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:29:24,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:29:24,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:29:24,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952356173] [2024-11-13 15:29:24,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:29:24,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:29:24,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:29:24,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:29:24,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:29:24,470 INFO L87 Difference]: Start difference. First operand 389 states and 620 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-13 15:29:25,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:29:25,023 INFO L93 Difference]: Finished difference Result 707 states and 1124 transitions. [2024-11-13 15:29:25,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:29:25,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 268 [2024-11-13 15:29:25,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:29:25,029 INFO L225 Difference]: With dead ends: 707 [2024-11-13 15:29:25,029 INFO L226 Difference]: Without dead ends: 404 [2024-11-13 15:29:25,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:29:25,032 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 108 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:29:25,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 588 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:29:25,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-13 15:29:25,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 398. [2024-11-13 15:29:25,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 216 states have (on average 1.287037037037037) internal successors, (278), 216 states have internal predecessors, (278), 176 states have call successors, (176), 5 states have call predecessors, (176), 5 states have return successors, (176), 176 states have call predecessors, (176), 176 states have call successors, (176) [2024-11-13 15:29:25,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 630 transitions. [2024-11-13 15:29:25,110 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 630 transitions. Word has length 268 [2024-11-13 15:29:25,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:29:25,111 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 630 transitions. [2024-11-13 15:29:25,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-13 15:29:25,111 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 630 transitions. [2024-11-13 15:29:25,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 15:29:25,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:29:25,116 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:29:25,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:29:25,117 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:29:25,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:29:25,117 INFO L85 PathProgramCache]: Analyzing trace with hash -105832962, now seen corresponding path program 1 times [2024-11-13 15:29:25,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:29:25,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533374928] [2024-11-13 15:29:25,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:25,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:29:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:29:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:29:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:29:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:29:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:29:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:29:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:29:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:29:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:29:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:29:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:29:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:29:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:29:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:29:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 15:29:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:29:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 15:29:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:29:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:29:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-13 15:29:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-13 15:29:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 15:29:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 15:29:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 15:29:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 15:29:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-13 15:29:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-13 15:29:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-13 15:29:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-13 15:29:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-13 15:29:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-13 15:29:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-13 15:29:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-13 15:29:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-13 15:29:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-13 15:29:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-13 15:29:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-13 15:29:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-13 15:29:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-13 15:29:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-13 15:29:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-13 15:29:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-13 15:29:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-13 15:29:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-13 15:29:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:25,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 69 proven. 60 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2024-11-13 15:29:25,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:29:25,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533374928] [2024-11-13 15:29:25,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533374928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:29:25,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419236857] [2024-11-13 15:29:25,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:25,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:29:25,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:29:25,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:29:25,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:29:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:26,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 15:29:26,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:29:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 2417 proven. 60 refuted. 0 times theorem prover too weak. 1307 trivial. 0 not checked. [2024-11-13 15:29:27,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:29:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 69 proven. 60 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2024-11-13 15:29:28,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419236857] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:29:28,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:29:28,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-13 15:29:28,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409173514] [2024-11-13 15:29:28,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:29:28,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 15:29:28,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:29:28,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 15:29:28,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:29:28,083 INFO L87 Difference]: Start difference. First operand 398 states and 630 transitions. Second operand has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 6 states have call successors, (116), 3 states have call predecessors, (116), 6 states have return successors, (116), 6 states have call predecessors, (116), 6 states have call successors, (116) [2024-11-13 15:29:28,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:29:28,722 INFO L93 Difference]: Finished difference Result 724 states and 1133 transitions. [2024-11-13 15:29:28,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:29:28,723 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 6 states have call successors, (116), 3 states have call predecessors, (116), 6 states have return successors, (116), 6 states have call predecessors, (116), 6 states have call successors, (116) Word has length 268 [2024-11-13 15:29:28,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:29:28,729 INFO L225 Difference]: With dead ends: 724 [2024-11-13 15:29:28,729 INFO L226 Difference]: Without dead ends: 424 [2024-11-13 15:29:28,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:29:28,734 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 184 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:29:28,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 268 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:29:28,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-13 15:29:28,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 414. [2024-11-13 15:29:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 228 states have (on average 1.2587719298245614) internal successors, (287), 228 states have internal predecessors, (287), 176 states have call successors, (176), 9 states have call predecessors, (176), 9 states have return successors, (176), 176 states have call predecessors, (176), 176 states have call successors, (176) [2024-11-13 15:29:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 639 transitions. [2024-11-13 15:29:28,846 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 639 transitions. Word has length 268 [2024-11-13 15:29:28,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:29:28,847 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 639 transitions. [2024-11-13 15:29:28,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 6 states have call successors, (116), 3 states have call predecessors, (116), 6 states have return successors, (116), 6 states have call predecessors, (116), 6 states have call successors, (116) [2024-11-13 15:29:28,847 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 639 transitions. [2024-11-13 15:29:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-13 15:29:28,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:29:28,854 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:29:28,881 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 15:29:29,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:29:29,056 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:29:29,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:29:29,056 INFO L85 PathProgramCache]: Analyzing trace with hash -727724306, now seen corresponding path program 1 times [2024-11-13 15:29:29,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:29:29,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755048544] [2024-11-13 15:29:29,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:29,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:29:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 15:29:29,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1858422381] [2024-11-13 15:29:29,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:29,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:29:29,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:29:29,281 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:29:29,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:29:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:29:29,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:29:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:29:29,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:29:29,995 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 15:29:29,996 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 15:29:30,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 15:29:30,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:29:30,204 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:29:30,530 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:29:30,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:29:30 BoogieIcfgContainer [2024-11-13 15:29:30,534 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:29:30,535 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:29:30,535 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:29:30,536 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:29:30,537 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:29:16" (3/4) ... [2024-11-13 15:29:30,540 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 15:29:30,541 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:29:30,542 INFO L158 Benchmark]: Toolchain (without parser) took 15751.77ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 92.1MB in the beginning and 168.1MB in the end (delta: -76.0MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2024-11-13 15:29:30,542 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 117.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:29:30,543 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.90ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 76.5MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 15:29:30,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.55ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 73.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:29:30,543 INFO L158 Benchmark]: Boogie Preprocessor took 101.89ms. Allocated memory is still 117.4MB. Free memory was 73.6MB in the beginning and 70.4MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:29:30,544 INFO L158 Benchmark]: RCFGBuilder took 968.18ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 45.0MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 15:29:30,544 INFO L158 Benchmark]: TraceAbstraction took 14088.41ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 44.4MB in the beginning and 168.1MB in the end (delta: -123.7MB). Peak memory consumption was 91.5MB. Max. memory is 16.1GB. [2024-11-13 15:29:30,545 INFO L158 Benchmark]: Witness Printer took 5.68ms. Allocated memory is still 226.5MB. Free memory was 168.1MB in the beginning and 168.1MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:29:30,547 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 117.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 474.90ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 76.5MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.55ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 73.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 101.89ms. Allocated memory is still 117.4MB. Free memory was 73.6MB in the beginning and 70.4MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 968.18ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 45.0MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14088.41ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 44.4MB in the beginning and 168.1MB in the end (delta: -123.7MB). Peak memory consumption was 91.5MB. Max. memory is 16.1GB. * Witness Printer took 5.68ms. Allocated memory is still 226.5MB. Free memory was 168.1MB in the beginning and 168.1MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 217, overapproximation of someBinaryFLOATComparisonOperation at line 212, overapproximation of someBinaryFLOATComparisonOperation at line 184, overapproximation of someBinaryFLOATComparisonOperation at line 186, overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 217, overapproximation of someBinaryDOUBLEComparisonOperation at line 190, overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryArithmeticFLOAToperation at line 108. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 0; [L26] signed short int var_1_9 = 0; [L27] signed short int var_1_10 = 8; [L28] signed char var_1_11 = 1; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = -2; [L31] signed char var_1_14 = 8; [L32] signed char var_1_15 = 0; [L33] signed char var_1_16 = 10; [L34] signed char var_1_17 = 32; [L35] unsigned char var_1_18 = 0; [L36] signed char var_1_19 = -1; [L37] signed short int var_1_20 = 100; [L38] signed short int var_1_22 = 29265; [L39] float var_1_23 = 31.6; [L40] float var_1_24 = 9.2; [L41] float var_1_25 = 15.6; [L42] float var_1_26 = 25.25; [L43] unsigned long int var_1_27 = 256; [L44] double var_1_29 = 15.86; [L45] double var_1_30 = 64.25; [L46] signed short int var_1_31 = 10; [L47] signed short int var_1_34 = 16; [L48] signed short int var_1_35 = 8; [L49] signed short int var_1_37 = 64; [L50] signed short int var_1_38 = 128; [L51] float var_1_39 = 4.7; [L52] unsigned short int var_1_40 = 100; [L53] signed short int var_1_41 = 4; [L54] unsigned long int var_1_43 = 64; [L55] unsigned long int var_1_44 = 5; [L56] float var_1_45 = 31.6; [L57] float var_1_46 = 24.875; [L58] unsigned short int var_1_47 = 64; [L59] double var_1_48 = 16.75; VAL [isInitial=0, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L221] isInitial = 1 [L222] FCALL initially() [L223] COND TRUE 1 [L224] FCALL updateLastVariables() [L225] CALL updateVariables() [L146] var_1_6 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_7=0, var_1_8=0, var_1_9=0] [L147] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_7=0, var_1_8=0, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L148] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L149] var_1_7 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=0] [L150] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=0] [L151] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=0] [L152] var_1_9 = __VERIFIER_nondet_short() [L153] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L153] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L154] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L154] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L155] var_1_10 = __VERIFIER_nondet_short() [L156] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L156] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L157] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L157] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L158] var_1_12 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L159] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L160] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L160] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L161] var_1_13 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L162] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L163] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L163] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L164] var_1_14 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L165] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L166] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L166] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L167] var_1_15 = __VERIFIER_nondet_char() [L168] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L168] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L169] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L169] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L170] var_1_16 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L171] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L172] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L172] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L173] var_1_17 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L174] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L175] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L175] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L176] var_1_19 = __VERIFIER_nondet_char() [L177] CALL assume_abort_if_not(var_1_19 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L177] RET assume_abort_if_not(var_1_19 >= -128) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L178] CALL assume_abort_if_not(var_1_19 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L178] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L179] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L179] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L180] var_1_22 = __VERIFIER_nondet_short() [L181] CALL assume_abort_if_not(var_1_22 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L181] RET assume_abort_if_not(var_1_22 >= 16382) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L182] CALL assume_abort_if_not(var_1_22 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L182] RET assume_abort_if_not(var_1_22 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L183] var_1_24 = __VERIFIER_nondet_float() [L184] CALL assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L184] RET assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L185] var_1_25 = __VERIFIER_nondet_float() [L186] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L186] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L187] var_1_26 = __VERIFIER_nondet_float() [L188] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L188] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L189] var_1_30 = __VERIFIER_nondet_double() [L190] CALL assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L190] RET assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=16, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L191] var_1_34 = __VERIFIER_nondet_short() [L192] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L192] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L193] CALL assume_abort_if_not(var_1_34 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L193] RET assume_abort_if_not(var_1_34 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=8, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L194] var_1_35 = __VERIFIER_nondet_short() [L195] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L195] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L196] CALL assume_abort_if_not(var_1_35 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L196] RET assume_abort_if_not(var_1_35 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=64, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L197] var_1_37 = __VERIFIER_nondet_short() [L198] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L198] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L199] CALL assume_abort_if_not(var_1_37 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L199] RET assume_abort_if_not(var_1_37 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=128, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L200] var_1_38 = __VERIFIER_nondet_short() [L201] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L201] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L202] CALL assume_abort_if_not(var_1_38 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L202] RET assume_abort_if_not(var_1_38 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=64, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L203] var_1_43 = __VERIFIER_nondet_ulong() [L204] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L204] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L205] CALL assume_abort_if_not(var_1_43 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L205] RET assume_abort_if_not(var_1_43 <= 4294967295) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L206] CALL assume_abort_if_not(var_1_43 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=1, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=1, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L206] RET assume_abort_if_not(var_1_43 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=1, var_1_44=5, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L207] var_1_44 = __VERIFIER_nondet_ulong() [L208] CALL assume_abort_if_not(var_1_44 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=1, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=1, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L208] RET assume_abort_if_not(var_1_44 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=1, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L209] CALL assume_abort_if_not(var_1_44 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=1, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=1, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L209] RET assume_abort_if_not(var_1_44 <= 4294967295) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=1, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L210] CALL assume_abort_if_not(var_1_44 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L210] RET assume_abort_if_not(var_1_44 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_46=199/8, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L211] var_1_46 = __VERIFIER_nondet_float() [L212] CALL assume_abort_if_not((var_1_46 >= -461168.6018427382800e+13F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 4611686.018427382800e+12F && var_1_46 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L212] RET assume_abort_if_not((var_1_46 >= -461168.6018427382800e+13F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 4611686.018427382800e+12F && var_1_46 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L225] RET updateVariables() [L226] CALL step() [L63] var_1_29 = var_1_30 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L64] COND FALSE !(var_1_18 && var_1_18) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L67] COND FALSE !(((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) > var_1_34) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L75] COND FALSE !(var_1_23 < var_1_30) [L80] var_1_39 = 15.6f VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=78/5, var_1_40=100, var_1_41=4, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L82] var_1_40 = var_1_35 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L83] COND FALSE !(\read(var_1_18)) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L90] EXPR var_1_34 | var_1_8 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L90] COND FALSE !(var_1_20 > (var_1_34 | var_1_8)) [L97] var_1_41 = var_1_38 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=78/5, var_1_40=0, var_1_41=0, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L100] COND FALSE !(var_1_1 || var_1_18) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=78/5, var_1_40=0, var_1_41=0, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=257, var_1_8=0, var_1_9=16323] [L103] var_1_47 = var_1_37 [L104] var_1_48 = var_1_46 [L105] var_1_8 = (var_1_9 - (2 + var_1_10)) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=78/5, var_1_40=0, var_1_41=0, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_46=3, var_1_47=0, var_1_48=3, var_1_6=0, var_1_7=257, var_1_8=16320, var_1_9=16323] [L106] COND TRUE var_1_22 != var_1_12 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=78/5, var_1_40=0, var_1_41=0, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_46=3, var_1_47=0, var_1_48=3, var_1_6=0, var_1_7=257, var_1_8=16320, var_1_9=16323] [L107] COND TRUE var_1_10 <= var_1_17 [L108] var_1_23 = (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=78/5, var_1_40=0, var_1_41=0, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_46=3, var_1_47=0, var_1_48=3, var_1_6=0, var_1_7=257, var_1_8=16320, var_1_9=16323] [L113] COND FALSE !(! ((var_1_9 - var_1_22) > var_1_12)) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=78/5, var_1_40=0, var_1_41=0, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_46=3, var_1_47=0, var_1_48=3, var_1_6=0, var_1_7=257, var_1_8=16320, var_1_9=16323] [L116] COND FALSE !(var_1_23 == var_1_23) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=100, var_1_22=16383, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=78/5, var_1_40=0, var_1_41=0, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_46=3, var_1_47=0, var_1_48=3, var_1_6=0, var_1_7=257, var_1_8=16320, var_1_9=16323] [L121] COND TRUE (- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23) [L122] var_1_20 = ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=16328, var_1_22=16383, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=78/5, var_1_40=0, var_1_41=0, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_46=3, var_1_47=0, var_1_48=3, var_1_6=0, var_1_7=257, var_1_8=16320, var_1_9=16323] [L126] COND FALSE !(\read(var_1_18)) [L129] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=257, var_1_20=16328, var_1_22=16383, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=78/5, var_1_40=0, var_1_41=0, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_46=3, var_1_47=0, var_1_48=3, var_1_6=0, var_1_7=257, var_1_8=16320, var_1_9=16323] [L131] COND TRUE \read(var_1_1) [L132] var_1_11 = (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=257, var_1_20=16328, var_1_22=16383, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=78/5, var_1_40=0, var_1_41=0, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_46=3, var_1_47=0, var_1_48=3, var_1_6=0, var_1_7=257, var_1_8=16320, var_1_9=16323] [L226] RET step() [L227] CALL, EXPR property() [L217-L218] return ((((((var_1_18 ? (var_1_1 == ((unsigned char) (((-128 <= var_1_20) || (var_1_23 >= var_1_23)) && var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) && (var_1_8 == ((signed short int) (var_1_9 - (2 + var_1_10))))) && (var_1_1 ? (var_1_11 == ((signed char) (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) : ((var_1_27 >= var_1_14) ? (var_1_11 == ((signed char) ((var_1_15 + var_1_16) - var_1_17))) : (var_1_7 ? (var_1_11 == ((signed char) var_1_16)) : (var_1_11 == ((signed char) var_1_12)))))) && ((var_1_23 == var_1_23) ? ((var_1_15 >= (var_1_27 / var_1_19)) ? (var_1_18 == ((unsigned char) var_1_7)) : 1) : 1)) && (((- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23)) ? (var_1_20 == ((signed short int) ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10))) : (var_1_20 == ((signed short int) var_1_19)))) && ((var_1_22 != var_1_12) ? ((var_1_10 <= var_1_17) ? (var_1_23 == ((float) (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))))) : 1) : (var_1_23 == ((float) var_1_25)))) && ((! ((var_1_9 - var_1_22) > var_1_12)) ? (var_1_27 == ((unsigned long int) var_1_15)) : 1) ; VAL [\result=0, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=257, var_1_20=16328, var_1_22=16383, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=78/5, var_1_40=0, var_1_41=0, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_46=3, var_1_47=0, var_1_48=3, var_1_6=0, var_1_7=257, var_1_8=16320, var_1_9=16323] [L227] RET, EXPR property() [L227] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=257, var_1_20=16328, var_1_22=16383, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=78/5, var_1_40=0, var_1_41=0, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_46=3, var_1_47=0, var_1_48=3, var_1_6=0, var_1_7=257, var_1_8=16320, var_1_9=16323] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=-62, var_1_13=62, var_1_14=62, var_1_15=52, var_1_16=2, var_1_17=2, var_1_18=0, var_1_19=5, var_1_1=257, var_1_20=16328, var_1_22=16383, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=10, var_1_34=100, var_1_35=0, var_1_37=0, var_1_38=0, var_1_39=78/5, var_1_40=0, var_1_41=0, var_1_43=1, var_1_44=1, var_1_45=158/5, var_1_46=3, var_1_47=0, var_1_48=3, var_1_6=0, var_1_7=257, var_1_8=16320, var_1_9=16323] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 9, TraceHistogramMax: 44, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 936 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 913 mSDsluCounter, 2674 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1277 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 521 IncrementalHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 1397 mSDtfsCounter, 521 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1314 GetRequests, 1288 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=414occurred in iteration=8, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 8 MinimizatonAttempts, 34 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 2939 NumberOfCodeBlocks, 2939 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2659 ConstructedInterpolants, 0 QuantifiedInterpolants, 5862 SizeOfPredicates, 3 NumberOfNonLiveVariables, 596 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 37660/37840 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 15:29:30,590 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 f19691bed5efac00db0d1847b045469616a042925c91020b77da6e1bd979a486 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:29:34,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:29:34,211 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 15:29:34,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:29:34,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:29:34,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:29:34,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:29:34,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:29:34,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:29:34,275 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:29:34,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:29:34,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:29:34,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:29:34,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:29:34,279 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:29:34,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:29:34,279 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:29:34,279 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:29:34,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:29:34,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:29:34,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:29:34,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:29:34,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:29:34,282 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:29:34,282 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 15:29:34,282 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:29:34,282 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 15:29:34,282 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:29:34,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:29:34,283 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:29:34,283 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:29:34,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:29:34,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:29:34,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:29:34,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:29:34,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:29:34,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:29:34,285 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:29:34,285 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 15:29:34,285 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 15:29:34,285 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:29:34,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:29:34,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:29:34,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:29:34,286 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_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 -> f19691bed5efac00db0d1847b045469616a042925c91020b77da6e1bd979a486 [2024-11-13 15:29:34,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:29:34,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:29:34,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:29:34,710 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:29:34,710 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:29:34,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i Unable to find full path for "g++" [2024-11-13 15:29:37,127 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:29:37,405 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:29:37,406 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i [2024-11-13 15:29:37,418 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/data/4ba21a29a/78efa4d444a44b8d8a5a5b31f527b256/FLAGcc4ce6c35 [2024-11-13 15:29:37,438 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/data/4ba21a29a/78efa4d444a44b8d8a5a5b31f527b256 [2024-11-13 15:29:37,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:29:37,444 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:29:37,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:29:37,446 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:29:37,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:29:37,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:29:37" (1/1) ... [2024-11-13 15:29:37,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10f5b6ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:37, skipping insertion in model container [2024-11-13 15:29:37,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:29:37" (1/1) ... [2024-11-13 15:29:37,484 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:29:37,716 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_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i[919,932] [2024-11-13 15:29:37,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:29:37,884 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:29:37,900 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_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i[919,932] [2024-11-13 15:29:38,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:29:38,045 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:29:38,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:38 WrapperNode [2024-11-13 15:29:38,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:29:38,049 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:29:38,049 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:29:38,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:29:38,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:38" (1/1) ... [2024-11-13 15:29:38,084 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:38" (1/1) ... [2024-11-13 15:29:38,134 INFO L138 Inliner]: procedures = 27, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 232 [2024-11-13 15:29:38,135 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:29:38,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:29:38,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:29:38,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:29:38,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:38" (1/1) ... [2024-11-13 15:29:38,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:38" (1/1) ... [2024-11-13 15:29:38,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:38" (1/1) ... [2024-11-13 15:29:38,172 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 15:29:38,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:38" (1/1) ... [2024-11-13 15:29:38,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:38" (1/1) ... [2024-11-13 15:29:38,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:38" (1/1) ... [2024-11-13 15:29:38,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:38" (1/1) ... [2024-11-13 15:29:38,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:38" (1/1) ... [2024-11-13 15:29:38,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:38" (1/1) ... [2024-11-13 15:29:38,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:29:38,205 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:29:38,206 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:29:38,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:29:38,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:38" (1/1) ... [2024-11-13 15:29:38,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:29:38,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:29:38,257 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:29:38,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:29:38,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:29:38,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 15:29:38,300 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:29:38,300 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:29:38,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:29:38,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:29:38,485 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:29:38,488 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:29:42,511 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-13 15:29:42,512 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:29:42,531 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:29:42,534 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:29:42,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:29:42 BoogieIcfgContainer [2024-11-13 15:29:42,535 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:29:42,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:29:42,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:29:42,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:29:42,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:29:37" (1/3) ... [2024-11-13 15:29:42,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497a6240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:29:42, skipping insertion in model container [2024-11-13 15:29:42,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:29:38" (2/3) ... [2024-11-13 15:29:42,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497a6240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:29:42, skipping insertion in model container [2024-11-13 15:29:42,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:29:42" (3/3) ... [2024-11-13 15:29:42,547 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i [2024-11-13 15:29:42,565 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:29:42,567 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-29.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:29:42,638 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:29:42,653 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;@555c4946, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:29:42,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:29:42,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 15:29:42,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-13 15:29:42,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:29:42,683 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:29:42,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:29:42,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:29:42,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2138072955, now seen corresponding path program 1 times [2024-11-13 15:29:42,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:29:42,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197995698] [2024-11-13 15:29:42,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:42,706 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 15:29:42,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:29:42,709 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:29:42,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:29:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:43,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 15:29:43,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:29:43,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1094 proven. 0 refuted. 0 times theorem prover too weak. 2690 trivial. 0 not checked. [2024-11-13 15:29:43,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:29:43,646 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:29:43,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197995698] [2024-11-13 15:29:43,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197995698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:29:43,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:29:43,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:29:43,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731883932] [2024-11-13 15:29:43,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:29:43,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:29:43,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:29:43,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:29:43,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:29:43,699 INFO L87 Difference]: Start difference. First operand has 109 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-13 15:29:43,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:29:43,746 INFO L93 Difference]: Finished difference Result 211 states and 390 transitions. [2024-11-13 15:29:43,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:29:43,749 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 265 [2024-11-13 15:29:43,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:29:43,757 INFO L225 Difference]: With dead ends: 211 [2024-11-13 15:29:43,758 INFO L226 Difference]: Without dead ends: 105 [2024-11-13 15:29:43,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 264 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 15:29:43,767 INFO L432 NwaCegarLoop]: 168 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, 168 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 15:29:43,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:29:43,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-13 15:29:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-13 15:29:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 59 states have internal predecessors, (80), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 15:29:43,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 168 transitions. [2024-11-13 15:29:43,840 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 168 transitions. Word has length 265 [2024-11-13 15:29:43,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:29:43,841 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 168 transitions. [2024-11-13 15:29:43,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-13 15:29:43,842 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 168 transitions. [2024-11-13 15:29:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-13 15:29:43,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:29:43,857 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:29:43,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:29:44,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:29:44,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:29:44,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:29:44,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1173814471, now seen corresponding path program 1 times [2024-11-13 15:29:44,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:29:44,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591947672] [2024-11-13 15:29:44,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:44,061 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 15:29:44,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:29:44,065 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:29:44,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:29:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:44,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 15:29:44,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:29:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-11-13 15:29:46,456 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:29:46,456 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:29:46,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591947672] [2024-11-13 15:29:46,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591947672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:29:46,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:29:46,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:29:46,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685557701] [2024-11-13 15:29:46,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:29:46,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:29:46,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:29:46,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:29:46,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:29:46,461 INFO L87 Difference]: Start difference. First operand 105 states and 168 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 15:29:47,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:29:48,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:29:48,149 INFO L93 Difference]: Finished difference Result 303 states and 487 transitions. [2024-11-13 15:29:48,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:29:48,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 265 [2024-11-13 15:29:48,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:29:48,165 INFO L225 Difference]: With dead ends: 303 [2024-11-13 15:29:48,165 INFO L226 Difference]: Without dead ends: 201 [2024-11-13 15:29:48,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 263 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 15:29:48,172 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 42 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:29:48,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 305 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 15:29:48,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-13 15:29:48,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2024-11-13 15:29:48,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 108 states have (on average 1.3148148148148149) internal successors, (142), 108 states have internal predecessors, (142), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-13 15:29:48,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 318 transitions. [2024-11-13 15:29:48,259 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 318 transitions. Word has length 265 [2024-11-13 15:29:48,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:29:48,262 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 318 transitions. [2024-11-13 15:29:48,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 15:29:48,264 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 318 transitions. [2024-11-13 15:29:48,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-13 15:29:48,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:29:48,275 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:29:48,293 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:29:48,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:29:48,476 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:29:48,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:29:48,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1161127395, now seen corresponding path program 1 times [2024-11-13 15:29:48,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:29:48,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974583975] [2024-11-13 15:29:48,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:48,478 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 15:29:48,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:29:48,481 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:29:48,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:29:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:49,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 15:29:49,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:29:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-11-13 15:29:50,864 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:29:50,864 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:29:50,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974583975] [2024-11-13 15:29:50,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974583975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:29:50,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:29:50,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:29:50,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830873027] [2024-11-13 15:29:50,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:29:50,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:29:50,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:29:50,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:29:50,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:29:50,873 INFO L87 Difference]: Start difference. First operand 199 states and 318 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 15:29:52,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:29:53,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:29:53,408 INFO L93 Difference]: Finished difference Result 659 states and 1053 transitions. [2024-11-13 15:29:53,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:29:53,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 266 [2024-11-13 15:29:53,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:29:53,419 INFO L225 Difference]: With dead ends: 659 [2024-11-13 15:29:53,421 INFO L226 Difference]: Without dead ends: 463 [2024-11-13 15:29:53,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:29:53,426 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 198 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:29:53,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 381 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-13 15:29:53,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-13 15:29:53,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 369. [2024-11-13 15:29:53,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 188 states have (on average 1.25) internal successors, (235), 188 states have internal predecessors, (235), 176 states have call successors, (176), 4 states have call predecessors, (176), 4 states have return successors, (176), 176 states have call predecessors, (176), 176 states have call successors, (176) [2024-11-13 15:29:53,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 587 transitions. [2024-11-13 15:29:53,542 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 587 transitions. Word has length 266 [2024-11-13 15:29:53,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:29:53,544 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 587 transitions. [2024-11-13 15:29:53,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 15:29:53,544 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 587 transitions. [2024-11-13 15:29:53,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-13 15:29:53,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:29:53,549 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:29:53,565 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:29:53,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:29:53,750 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:29:53,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:29:53,751 INFO L85 PathProgramCache]: Analyzing trace with hash -902961957, now seen corresponding path program 1 times [2024-11-13 15:29:53,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:29:53,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465007230] [2024-11-13 15:29:53,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:53,752 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 15:29:53,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:29:53,756 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:29:53,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:29:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:54,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 15:29:54,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:29:55,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1929 proven. 60 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2024-11-13 15:29:55,086 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:29:55,264 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:29:55,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465007230] [2024-11-13 15:29:55,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465007230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:29:55,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543369713] [2024-11-13 15:29:55,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:55,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:29:55,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:29:55,278 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:29:55,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 15:29:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:55,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 15:29:55,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:29:55,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-11-13 15:29:55,731 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:29:55,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543369713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:29:55,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:29:55,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-13 15:29:55,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583337047] [2024-11-13 15:29:55,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:29:55,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:29:55,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:29:55,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:29:55,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:29:55,734 INFO L87 Difference]: Start difference. First operand 369 states and 587 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 15:29:58,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:29:58,989 INFO L93 Difference]: Finished difference Result 1095 states and 1743 transitions. [2024-11-13 15:29:58,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:29:58,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 266 [2024-11-13 15:29:58,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:29:58,998 INFO L225 Difference]: With dead ends: 1095 [2024-11-13 15:29:58,998 INFO L226 Difference]: Without dead ends: 729 [2024-11-13 15:29:59,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:29:59,001 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 154 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:29:59,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 459 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-13 15:29:59,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-11-13 15:29:59,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 727. [2024-11-13 15:29:59,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 366 states have (on average 1.2131147540983607) internal successors, (444), 366 states have internal predecessors, (444), 352 states have call successors, (352), 8 states have call predecessors, (352), 8 states have return successors, (352), 352 states have call predecessors, (352), 352 states have call successors, (352) [2024-11-13 15:29:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1148 transitions. [2024-11-13 15:29:59,112 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1148 transitions. Word has length 266 [2024-11-13 15:29:59,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:29:59,113 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1148 transitions. [2024-11-13 15:29:59,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 15:29:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1148 transitions. [2024-11-13 15:29:59,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-13 15:29:59,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:29:59,117 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:29:59,149 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 15:29:59,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:29:59,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:29:59,518 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:29:59,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:29:59,518 INFO L85 PathProgramCache]: Analyzing trace with hash 872045405, now seen corresponding path program 1 times [2024-11-13 15:29:59,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:29:59,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861202451] [2024-11-13 15:29:59,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:59,519 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 15:29:59,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:29:59,521 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:29:59,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:29:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:59,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 15:29:59,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:30:00,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1929 proven. 60 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2024-11-13 15:30:00,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:30:00,933 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:30:00,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861202451] [2024-11-13 15:30:00,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861202451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:30:00,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669967509] [2024-11-13 15:30:00,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:00,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:30:00,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:30:00,937 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:30:00,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 15:30:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:01,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 15:30:01,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:30:01,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1929 proven. 60 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2024-11-13 15:30:01,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:30:02,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669967509] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:30:02,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:30:02,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-13 15:30:02,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459246885] [2024-11-13 15:30:02,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:30:02,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:30:02,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:30:02,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:30:02,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:30:02,046 INFO L87 Difference]: Start difference. First operand 727 states and 1148 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (44), 2 states have call predecessors, (44), 3 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-13 15:30:04,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:30:05,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:05,043 INFO L93 Difference]: Finished difference Result 1499 states and 2333 transitions. [2024-11-13 15:30:05,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:30:05,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (44), 2 states have call predecessors, (44), 3 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 266 [2024-11-13 15:30:05,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:05,072 INFO L225 Difference]: With dead ends: 1499 [2024-11-13 15:30:05,073 INFO L226 Difference]: Without dead ends: 775 [2024-11-13 15:30:05,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 567 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:30:05,077 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 78 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:05,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 261 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-13 15:30:05,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-11-13 15:30:05,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 759. [2024-11-13 15:30:05,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 390 states have (on average 1.1897435897435897) internal successors, (464), 390 states have internal predecessors, (464), 352 states have call successors, (352), 16 states have call predecessors, (352), 16 states have return successors, (352), 352 states have call predecessors, (352), 352 states have call successors, (352) [2024-11-13 15:30:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1168 transitions. [2024-11-13 15:30:05,192 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1168 transitions. Word has length 266 [2024-11-13 15:30:05,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:05,193 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1168 transitions. [2024-11-13 15:30:05,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (44), 2 states have call predecessors, (44), 3 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-13 15:30:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1168 transitions. [2024-11-13 15:30:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-13 15:30:05,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:05,200 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:30:05,236 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 15:30:05,410 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:30:05,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:30:05,601 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:30:05,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:05,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1033002595, now seen corresponding path program 1 times [2024-11-13 15:30:05,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:30:05,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812882023] [2024-11-13 15:30:05,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:05,603 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 15:30:05,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:30:05,604 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:30:05,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 (9)] Waiting until timeout for monitored process [2024-11-13 15:30:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:06,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 15:30:06,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:30:38,121 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true [2024-11-13 15:30:48,475 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))))) is different from true [2024-11-13 15:30:54,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1935 proven. 144 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2024-11-13 15:30:54,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:32:32,102 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:32:32,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812882023] [2024-11-13 15:32:32,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812882023] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:32:32,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907734948] [2024-11-13 15:32:32,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:32:32,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:32:32,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:32:32,105 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:32:32,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 15:32:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:33,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 15:32:33,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:33:01,577 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (or (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse0) (fp.geq ~var_1_24~0 .cse1) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse0) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse3) (fp.leq ~var_1_24~0 .cse2))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse0) (fp.geq ~var_1_24~0 .cse1) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (fp.leq ~var_1_24~0 .cse2) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse0) (fp.geq ~var_1_26~0 .cse1) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (fp.leq ~var_1_24~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse0) (fp.geq ~var_1_24~0 .cse1) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse0) (fp.geq ~var_1_26~0 .cse1) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse3) (fp.leq ~var_1_24~0 .cse2) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse2) (fp.geq ~var_1_26~0 .cse3) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse0) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse0) (fp.geq ~var_1_24~0 .cse1)))))) is different from true [2024-11-13 15:33:11,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1979 proven. 99 refuted. 0 times theorem prover too weak. 1706 trivial. 0 not checked. [2024-11-13 15:33:11,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:33:40,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907734948] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:33:40,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:33:40,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 15 [2024-11-13 15:33:40,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339206263] [2024-11-13 15:33:40,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:33:40,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 15:33:40,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:33:40,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 15:33:40,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=202, Unknown=13, NotChecked=96, Total=380 [2024-11-13 15:33:40,076 INFO L87 Difference]: Start difference. First operand 759 states and 1168 transitions. Second operand has 16 states, 16 states have (on average 5.625) internal successors, (90), 15 states have internal predecessors, (90), 5 states have call successors, (61), 5 states have call predecessors, (61), 7 states have return successors, (62), 5 states have call predecessors, (62), 5 states have call successors, (62) [2024-11-13 15:34:00,514 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse2)) (.cse1 (fp.neg .cse3)) (.cse4 (fp.neg .cse7)) (.cse5 (fp.neg .cse6))) (and (or (and (fp.leq c_~var_1_25~0 .cse0) (fp.geq c_~var_1_25~0 .cse1)) (and (fp.geq c_~var_1_25~0 .cse2) (fp.leq c_~var_1_25~0 .cse3))) (or (and (fp.geq c_~var_1_26~0 .cse2) (fp.leq c_~var_1_26~0 .cse3)) (and (fp.leq c_~var_1_26~0 .cse0) (fp.geq c_~var_1_26~0 .cse1))) (or (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (fp.geq ~var_1_26~0 .cse7) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse4) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse5) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse7) (fp.leq ~var_1_24~0 .cse6))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (fp.geq ~var_1_26~0 .cse7) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse7) (fp.leq ~var_1_24~0 .cse6) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse4) (fp.geq ~var_1_26~0 .cse5) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse7) (fp.leq ~var_1_24~0 .cse6) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (fp.geq ~var_1_26~0 .cse7) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse4) (fp.geq ~var_1_26~0 .cse5) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse7) (fp.leq ~var_1_24~0 .cse6) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (fp.geq ~var_1_26~0 .cse7) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse4) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse5) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5)))) (or (and (fp.leq c_~var_1_24~0 .cse3) (fp.geq c_~var_1_24~0 .cse2)) (and (fp.leq c_~var_1_24~0 .cse0) (fp.geq c_~var_1_24~0 .cse1))) (let ((.cse8 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse4) (fp.geq ~var_1_26~0 .cse5))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse7) (fp.leq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse7) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse6))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse7) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse4) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5))) (fp.leq ~var_1_25~0 .cse4))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse7) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse6))) (fp.geq ~var_1_25~0 .cse5) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse5) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse4))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse7) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse7) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse6))) (fp.leq ~var_1_25~0 .cse6))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse7) (fp.leq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5))) .cse8)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse5) (fp.leq ~var_1_25~0 .cse4) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (fp.geq ~var_1_26~0 .cse7) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse5) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse5) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5))) (fp.leq ~var_1_25~0 .cse4))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse7) (fp.leq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse7) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse4) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse7) (fp.leq ~var_1_24~0 .cse6))) (fp.leq ~var_1_25~0 .cse4))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse7) (fp.leq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse4) (fp.geq ~var_1_24~0 .cse5))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse7) (fp.leq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse7) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse6))) .cse8)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse6) (fp.geq ~var_1_26~0 .cse7) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse7) (fp.leq ~var_1_24~0 .cse6))) (fp.leq ~var_1_25~0 .cse4))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-13 15:34:04,601 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (and (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))) (or (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))))) is different from false [2024-11-13 15:34:08,607 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (and (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))) (or (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (fp.geq ~var_1_26~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))))) is different from true [2024-11-13 15:34:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:34:13,503 INFO L93 Difference]: Finished difference Result 2387 states and 3594 transitions. [2024-11-13 15:34:13,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 15:34:13,511 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 15 states have internal predecessors, (90), 5 states have call successors, (61), 5 states have call predecessors, (61), 7 states have return successors, (62), 5 states have call predecessors, (62), 5 states have call successors, (62) Word has length 267 [2024-11-13 15:34:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:34:13,530 INFO L225 Difference]: With dead ends: 2387 [2024-11-13 15:34:13,531 INFO L226 Difference]: Without dead ends: 1631 [2024-11-13 15:34:13,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 644 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 121.9s TimeCoverageRelationStatistics Valid=114, Invalid=267, Unknown=19, NotChecked=200, Total=600 [2024-11-13 15:34:13,537 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 134 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1067 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:34:13,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 772 Invalid, 1730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 607 Invalid, 0 Unknown, 1067 Unchecked, 8.5s Time] [2024-11-13 15:34:13,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2024-11-13 15:34:13,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1613. [2024-11-13 15:34:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 852 states have (on average 1.176056338028169) internal successors, (1002), 852 states have internal predecessors, (1002), 704 states have call successors, (704), 56 states have call predecessors, (704), 56 states have return successors, (704), 704 states have call predecessors, (704), 704 states have call successors, (704) [2024-11-13 15:34:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2410 transitions. [2024-11-13 15:34:13,786 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2410 transitions. Word has length 267 [2024-11-13 15:34:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:34:13,787 INFO L471 AbstractCegarLoop]: Abstraction has 1613 states and 2410 transitions. [2024-11-13 15:34:13,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 15 states have internal predecessors, (90), 5 states have call successors, (61), 5 states have call predecessors, (61), 7 states have return successors, (62), 5 states have call predecessors, (62), 5 states have call successors, (62) [2024-11-13 15:34:13,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2410 transitions. [2024-11-13 15:34:13,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-13 15:34:13,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:34:13,792 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:34:13,829 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-13 15:34:14,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 (9)] Ended with exit code 0 [2024-11-13 15:34:14,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:34:14,194 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:34:14,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:34:14,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1713060965, now seen corresponding path program 1 times [2024-11-13 15:34:14,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:34:14,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965220498] [2024-11-13 15:34:14,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:34:14,195 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 15:34:14,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:34:14,197 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:34:14,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 (11)] Waiting until timeout for monitored process [2024-11-13 15:34:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:34:14,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 15:34:14,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:34:51,008 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true [2024-11-13 15:35:01,598 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))))) is different from true [2024-11-13 15:35:07,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1935 proven. 144 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2024-11-13 15:35:07,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:36:51,024 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:36:51,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965220498] [2024-11-13 15:36:51,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965220498] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:36:51,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118200958] [2024-11-13 15:36:51,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:36:51,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:36:51,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:36:51,026 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:36:51,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 15:36:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:36:52,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 15:36:52,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:37:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1935 proven. 144 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2024-11-13 15:37:38,670 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:38:31,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118200958] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:38:31,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:38:31,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2024-11-13 15:38:31,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631323197] [2024-11-13 15:38:31,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:38:31,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 15:38:31,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:38:31,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 15:38:31,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=152, Unknown=10, NotChecked=54, Total=272 [2024-11-13 15:38:31,316 INFO L87 Difference]: Start difference. First operand 1613 states and 2410 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (44), 4 states have call predecessors, (44), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-11-13 15:39:52,101 WARN L286 SmtUtils]: Spent 36.33s on a formula simplification. DAG size of input: 110 DAG size of output: 235 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:41:00,234 WARN L286 SmtUtils]: Spent 35.42s on a formula simplification. DAG size of input: 102 DAG size of output: 212 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:41:04,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:41:06,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:41:10,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:41:14,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:41:18,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:41:19,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:41:21,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:41:22,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:41:22,085 INFO L93 Difference]: Finished difference Result 2501 states and 3687 transitions. [2024-11-13 15:41:22,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 15:41:22,091 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (44), 4 states have call predecessors, (44), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) Word has length 267 [2024-11-13 15:41:22,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:41:22,105 INFO L225 Difference]: With dead ends: 2501 [2024-11-13 15:41:22,106 INFO L226 Difference]: Without dead ends: 1745 [2024-11-13 15:41:22,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 755 GetRequests, 735 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 213.0s TimeCoverageRelationStatistics Valid=105, Invalid=257, Unknown=26, NotChecked=74, Total=462 [2024-11-13 15:41:22,111 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 124 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 15 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 360 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:41:22,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 251 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 274 Invalid, 4 Unknown, 360 Unchecked, 24.5s Time] [2024-11-13 15:41:22,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2024-11-13 15:41:22,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1711. [2024-11-13 15:41:22,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 926 states have (on average 1.16414686825054) internal successors, (1078), 926 states have internal predecessors, (1078), 704 states have call successors, (704), 80 states have call predecessors, (704), 80 states have return successors, (704), 704 states have call predecessors, (704), 704 states have call successors, (704) [2024-11-13 15:41:22,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2486 transitions. [2024-11-13 15:41:22,351 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2486 transitions. Word has length 267 [2024-11-13 15:41:22,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:41:22,353 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 2486 transitions. [2024-11-13 15:41:22,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (44), 4 states have call predecessors, (44), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-11-13 15:41:22,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2486 transitions. [2024-11-13 15:41:22,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-13 15:41:22,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:41:22,357 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:41:22,395 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 15:41:22,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 (11)] Forceful destruction successful, exit code 0 [2024-11-13 15:41:22,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:41:22,758 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:41:22,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:41:22,759 INFO L85 PathProgramCache]: Analyzing trace with hash 639975585, now seen corresponding path program 1 times [2024-11-13 15:41:22,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:41:22,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771357891] [2024-11-13 15:41:22,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:22,760 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 15:41:22,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:41:22,762 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:41:22,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 (13)] Waiting until timeout for monitored process [2024-11-13 15:41:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:23,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 15:41:23,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:41:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-11-13 15:41:24,948 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:41:24,948 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:41:24,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771357891] [2024-11-13 15:41:24,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771357891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:41:24,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:41:24,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:41:24,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107911799] [2024-11-13 15:41:24,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:41:24,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:41:24,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:41:24,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:41:24,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:41:24,950 INFO L87 Difference]: Start difference. First operand 1711 states and 2486 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 15:41:28,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:41:29,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:41:29,105 INFO L93 Difference]: Finished difference Result 2999 states and 4363 transitions. [2024-11-13 15:41:29,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:41:29,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 267 [2024-11-13 15:41:29,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:41:29,120 INFO L225 Difference]: With dead ends: 2999 [2024-11-13 15:41:29,120 INFO L226 Difference]: Without dead ends: 1291 [2024-11-13 15:41:29,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 265 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 15:41:29,129 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 34 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:41:29,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 338 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-13 15:41:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2024-11-13 15:41:29,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1289. [2024-11-13 15:41:29,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 700 states have (on average 1.17) internal successors, (819), 700 states have internal predecessors, (819), 528 states have call successors, (528), 60 states have call predecessors, (528), 60 states have return successors, (528), 528 states have call predecessors, (528), 528 states have call successors, (528) [2024-11-13 15:41:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1875 transitions. [2024-11-13 15:41:29,338 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1875 transitions. Word has length 267 [2024-11-13 15:41:29,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:41:29,339 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1875 transitions. [2024-11-13 15:41:29,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-13 15:41:29,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1875 transitions. [2024-11-13 15:41:29,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 15:41:29,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:41:29,343 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:41:29,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 (13)] Forceful destruction successful, exit code 0 [2024-11-13 15:41:29,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:41:29,544 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:41:29,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:41:29,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1447829977, now seen corresponding path program 1 times [2024-11-13 15:41:29,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:41:29,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735280410] [2024-11-13 15:41:29,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:29,545 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 15:41:29,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:41:29,551 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:41:29,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 (14)] Waiting until timeout for monitored process [2024-11-13 15:41:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:30,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 15:41:30,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:41:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 213 proven. 126 refuted. 0 times theorem prover too weak. 3445 trivial. 0 not checked. [2024-11-13 15:41:31,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:41:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 3 proven. 126 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2024-11-13 15:41:33,160 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:41:33,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735280410] [2024-11-13 15:41:33,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735280410] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:41:33,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:41:33,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-13 15:41:33,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981861955] [2024-11-13 15:41:33,161 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:41:33,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:41:33,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:41:33,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:41:33,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:41:33,164 INFO L87 Difference]: Start difference. First operand 1289 states and 1875 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (86), 2 states have call predecessors, (86), 4 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87) [2024-11-13 15:41:36,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:41:36,331 INFO L93 Difference]: Finished difference Result 2383 states and 3427 transitions. [2024-11-13 15:41:36,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 15:41:36,338 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (86), 2 states have call predecessors, (86), 4 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87) Word has length 268 [2024-11-13 15:41:36,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:41:36,350 INFO L225 Difference]: With dead ends: 2383 [2024-11-13 15:41:36,350 INFO L226 Difference]: Without dead ends: 1097 [2024-11-13 15:41:36,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 528 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-13 15:41:36,358 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 137 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:41:36,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 386 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-13 15:41:36,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2024-11-13 15:41:36,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1029. [2024-11-13 15:41:36,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 578 states have (on average 1.1730103806228374) internal successors, (678), 578 states have internal predecessors, (678), 396 states have call successors, (396), 54 states have call predecessors, (396), 54 states have return successors, (396), 396 states have call predecessors, (396), 396 states have call successors, (396) [2024-11-13 15:41:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1470 transitions. [2024-11-13 15:41:36,551 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1470 transitions. Word has length 268 [2024-11-13 15:41:36,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:41:36,552 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1470 transitions. [2024-11-13 15:41:36,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (86), 2 states have call predecessors, (86), 4 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87) [2024-11-13 15:41:36,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1470 transitions. [2024-11-13 15:41:36,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 15:41:36,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:41:36,555 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:41:36,571 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 (14)] Ended with exit code 0 [2024-11-13 15:41:36,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:41:36,755 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:41:36,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:41:36,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1390571675, now seen corresponding path program 1 times [2024-11-13 15:41:36,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:41:36,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033104758] [2024-11-13 15:41:36,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:36,757 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 15:41:36,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:41:36,761 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:41:36,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 (15)] Waiting until timeout for monitored process [2024-11-13 15:41:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:37,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 15:41:37,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:41:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 418 proven. 240 refuted. 0 times theorem prover too weak. 3126 trivial. 0 not checked. [2024-11-13 15:41:41,670 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:41:43,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 6 proven. 123 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2024-11-13 15:41:43,179 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:41:43,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033104758] [2024-11-13 15:41:43,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033104758] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:41:43,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:41:43,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-11-13 15:41:43,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077972925] [2024-11-13 15:41:43,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:41:43,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:41:43,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:41:43,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:41:43,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:41:43,182 INFO L87 Difference]: Start difference. First operand 1029 states and 1470 transitions. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 3 states have call successors, (85), 3 states have call predecessors, (85), 5 states have return successors, (86), 3 states have call predecessors, (86), 3 states have call successors, (86) [2024-11-13 15:41:47,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:41:49,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:41:49,798 INFO L93 Difference]: Finished difference Result 2176 states and 3040 transitions. [2024-11-13 15:41:49,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 15:41:49,806 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 3 states have call successors, (85), 3 states have call predecessors, (85), 5 states have return successors, (86), 3 states have call predecessors, (86), 3 states have call successors, (86) Word has length 268 [2024-11-13 15:41:49,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:41:49,815 INFO L225 Difference]: With dead ends: 2176 [2024-11-13 15:41:49,815 INFO L226 Difference]: Without dead ends: 1150 [2024-11-13 15:41:49,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 525 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2024-11-13 15:41:49,820 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 175 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:41:49,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 693 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-13 15:41:49,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-13 15:41:50,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1101. [2024-11-13 15:41:50,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 632 states have (on average 1.125) internal successors, (711), 632 states have internal predecessors, (711), 396 states have call successors, (396), 72 states have call predecessors, (396), 72 states have return successors, (396), 396 states have call predecessors, (396), 396 states have call successors, (396) [2024-11-13 15:41:50,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1503 transitions. [2024-11-13 15:41:50,030 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1503 transitions. Word has length 268 [2024-11-13 15:41:50,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:41:50,032 INFO L471 AbstractCegarLoop]: Abstraction has 1101 states and 1503 transitions. [2024-11-13 15:41:50,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 3 states have call successors, (85), 3 states have call predecessors, (85), 5 states have return successors, (86), 3 states have call predecessors, (86), 3 states have call successors, (86) [2024-11-13 15:41:50,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1503 transitions. [2024-11-13 15:41:50,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 15:41:50,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:41:50,036 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:41:50,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 (15)] Ended with exit code 0 [2024-11-13 15:41:50,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:41:50,237 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:41:50,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:41:50,237 INFO L85 PathProgramCache]: Analyzing trace with hash 2095048995, now seen corresponding path program 1 times [2024-11-13 15:41:50,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:41:50,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054322953] [2024-11-13 15:41:50,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:41:50,238 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 15:41:50,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:41:50,240 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 15:41:50,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c87df8f-5c7c-4f8c-9ae1-fb2084caddb8/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 (16)] Waiting until timeout for monitored process [2024-11-13 15:41:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:41:50,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 15:41:50,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:42:24,236 WARN L286 SmtUtils]: Spent 6.26s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:42:50,336 WARN L286 SmtUtils]: Spent 10.97s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:43:00,778 WARN L286 SmtUtils]: Spent 5.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 15:43:28,919 WARN L286 SmtUtils]: Spent 5.66s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)