./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ --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 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:31:55,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:31:55,243 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 22:31:55,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:31:55,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:31:55,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:31:55,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:31:55,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:31:55,296 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 22:31:55,302 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 22:31:55,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:31:55,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:31:55,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:31:55,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:31:55,306 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:31:55,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:31:55,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 22:31:55,307 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:31:55,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 22:31:55,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:31:55,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:31:55,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 22:31:55,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:31:55,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 22:31:55,310 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:31:55,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 22:31:55,311 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:31:55,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:31:55,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:31:55,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 22:31:55,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:31:55,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:31:55,314 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:31:55,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:31:55,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 22:31:55,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 22:31:55,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 22:31:55,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:31:55,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:31:55,316 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 22:31:55,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:31:55,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:31:55,317 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ 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 -> 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 [2023-11-23 22:31:55,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:31:55,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:31:55,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:31:55,687 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:31:55,688 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:31:55,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i [2023-11-23 22:31:58,804 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:31:59,063 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:31:59,064 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i [2023-11-23 22:31:59,083 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/data/1e83391e4/08964fa453494533bbff539a89a2c1e4/FLAG39845dcdd [2023-11-23 22:31:59,101 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/data/1e83391e4/08964fa453494533bbff539a89a2c1e4 [2023-11-23 22:31:59,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:31:59,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:31:59,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:31:59,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:31:59,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:31:59,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:31:59" (1/1) ... [2023-11-23 22:31:59,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469ebd89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:59, skipping insertion in model container [2023-11-23 22:31:59,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:31:59" (1/1) ... [2023-11-23 22:31:59,189 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:31:59,414 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i[913,926] [2023-11-23 22:31:59,509 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:31:59,524 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:31:59,540 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i[913,926] [2023-11-23 22:31:59,580 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:31:59,602 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:31:59,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:59 WrapperNode [2023-11-23 22:31:59,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:31:59,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:31:59,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:31:59,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:31:59,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:59" (1/1) ... [2023-11-23 22:31:59,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:59" (1/1) ... [2023-11-23 22:31:59,696 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2023-11-23 22:31:59,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:31:59,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:31:59,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:31:59,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:31:59,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:59" (1/1) ... [2023-11-23 22:31:59,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:59" (1/1) ... [2023-11-23 22:31:59,718 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:59" (1/1) ... [2023-11-23 22:31:59,754 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-23 22:31:59,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:59" (1/1) ... [2023-11-23 22:31:59,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:59" (1/1) ... [2023-11-23 22:31:59,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:59" (1/1) ... [2023-11-23 22:31:59,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:59" (1/1) ... [2023-11-23 22:31:59,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:59" (1/1) ... [2023-11-23 22:31:59,818 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:59" (1/1) ... [2023-11-23 22:31:59,823 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:31:59,824 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:31:59,824 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:31:59,824 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:31:59,825 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:59" (1/1) ... [2023-11-23 22:31:59,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:31:59,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:31:59,875 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:31:59,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:31:59,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:31:59,922 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 22:31:59,924 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 22:31:59,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 22:31:59,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:31:59,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:32:00,057 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:32:00,059 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:32:00,656 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:32:00,702 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:32:00,706 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 22:32:00,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:32:00 BoogieIcfgContainer [2023-11-23 22:32:00,707 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:32:00,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:32:00,712 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:32:00,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:32:00,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:31:59" (1/3) ... [2023-11-23 22:32:00,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6c62e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:32:00, skipping insertion in model container [2023-11-23 22:32:00,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:59" (2/3) ... [2023-11-23 22:32:00,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6c62e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:32:00, skipping insertion in model container [2023-11-23 22:32:00,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:32:00" (3/3) ... [2023-11-23 22:32:00,720 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-63.i [2023-11-23 22:32:00,739 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:32:00,740 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 22:32:00,801 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:32:00,808 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@39fd6b98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:32:00,808 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 22:32:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 22:32:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-23 22:32:00,827 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:32:00,828 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:32:00,829 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:32:00,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:32:00,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1333531042, now seen corresponding path program 1 times [2023-11-23 22:32:00,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:32:00,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736560492] [2023-11-23 22:32:00,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:32:00,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:32:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:32:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:32:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:32:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:32:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:32:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:32:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:32:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:32:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 22:32:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 22:32:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 22:32:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 22:32:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 22:32:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 22:32:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 22:32:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 22:32:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:32:01,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:32:01,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736560492] [2023-11-23 22:32:01,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736560492] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:32:01,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:32:01,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:32:01,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107204806] [2023-11-23 22:32:01,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:32:01,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 22:32:01,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:32:01,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 22:32:01,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 22:32:01,419 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-23 22:32:01,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:32:01,470 INFO L93 Difference]: Finished difference Result 121 states and 206 transitions. [2023-11-23 22:32:01,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 22:32:01,473 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 112 [2023-11-23 22:32:01,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:32:01,483 INFO L225 Difference]: With dead ends: 121 [2023-11-23 22:32:01,484 INFO L226 Difference]: Without dead ends: 60 [2023-11-23 22:32:01,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 22:32:01,493 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:32:01,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:32:01,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-23 22:32:01,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-11-23 22:32:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 22:32:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 91 transitions. [2023-11-23 22:32:01,573 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 91 transitions. Word has length 112 [2023-11-23 22:32:01,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:32:01,575 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 91 transitions. [2023-11-23 22:32:01,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-23 22:32:01,576 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 91 transitions. [2023-11-23 22:32:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-23 22:32:01,586 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:32:01,586 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:32:01,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 22:32:01,587 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:32:01,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:32:01,588 INFO L85 PathProgramCache]: Analyzing trace with hash 646606634, now seen corresponding path program 1 times [2023-11-23 22:32:01,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:32:01,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330160556] [2023-11-23 22:32:01,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:32:01,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:32:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:32:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:32:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:32:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:32:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:32:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:32:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:01,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:32:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:32:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 22:32:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 22:32:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 22:32:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 22:32:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 22:32:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 22:32:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 22:32:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 22:32:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,070 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:32:02,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:32:02,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330160556] [2023-11-23 22:32:02,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330160556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:32:02,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:32:02,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:32:02,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211375897] [2023-11-23 22:32:02,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:32:02,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:32:02,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:32:02,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:32:02,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:32:02,075 INFO L87 Difference]: Start difference. First operand 60 states and 91 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:32:02,141 INFO L93 Difference]: Finished difference Result 143 states and 218 transitions. [2023-11-23 22:32:02,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:32:02,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2023-11-23 22:32:02,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:32:02,145 INFO L225 Difference]: With dead ends: 143 [2023-11-23 22:32:02,145 INFO L226 Difference]: Without dead ends: 84 [2023-11-23 22:32:02,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:32:02,149 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 27 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:32:02,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 175 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:32:02,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-23 22:32:02,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 71. [2023-11-23 22:32:02,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 53 states have internal predecessors, (76), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 22:32:02,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2023-11-23 22:32:02,166 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 112 [2023-11-23 22:32:02,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:32:02,168 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2023-11-23 22:32:02,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:02,169 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2023-11-23 22:32:02,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-23 22:32:02,171 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:32:02,172 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:32:02,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 22:32:02,172 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:32:02,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:32:02,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1962809622, now seen corresponding path program 1 times [2023-11-23 22:32:02,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:32:02,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257686386] [2023-11-23 22:32:02,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:32:02,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:32:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:32:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:32:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:32:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:32:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:32:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:32:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:32:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:32:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 22:32:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 22:32:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 22:32:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 22:32:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 22:32:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 22:32:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 22:32:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 22:32:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,839 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:32:02,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:32:02,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257686386] [2023-11-23 22:32:02,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257686386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:32:02,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:32:02,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 22:32:02,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870009186] [2023-11-23 22:32:02,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:32:02,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:32:02,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:32:02,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:32:02,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:32:02,844 INFO L87 Difference]: Start difference. First operand 71 states and 108 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:03,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:32:03,145 INFO L93 Difference]: Finished difference Result 209 states and 318 transitions. [2023-11-23 22:32:03,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:32:03,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2023-11-23 22:32:03,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:32:03,149 INFO L225 Difference]: With dead ends: 209 [2023-11-23 22:32:03,149 INFO L226 Difference]: Without dead ends: 139 [2023-11-23 22:32:03,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:32:03,152 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 200 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 22:32:03,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 161 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 22:32:03,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-23 22:32:03,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 91. [2023-11-23 22:32:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 73 states have (on average 1.452054794520548) internal successors, (106), 73 states have internal predecessors, (106), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 22:32:03,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 138 transitions. [2023-11-23 22:32:03,176 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 138 transitions. Word has length 112 [2023-11-23 22:32:03,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:32:03,177 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 138 transitions. [2023-11-23 22:32:03,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 138 transitions. [2023-11-23 22:32:03,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-23 22:32:03,180 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:32:03,180 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:32:03,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 22:32:03,181 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:32:03,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:32:03,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2073992236, now seen corresponding path program 1 times [2023-11-23 22:32:03,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:32:03,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884092990] [2023-11-23 22:32:03,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:32:03,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:32:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:03,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:32:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:03,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:32:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:03,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:32:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:03,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:32:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:03,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:32:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:03,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:32:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:03,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:32:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:03,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:32:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:03,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 22:32:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:03,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 22:32:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:03,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 22:32:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:03,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 22:32:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:03,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 22:32:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:03,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 22:32:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:03,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 22:32:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:03,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 22:32:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:32:03,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:32:03,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884092990] [2023-11-23 22:32:03,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884092990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:32:03,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:32:03,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 22:32:03,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050367252] [2023-11-23 22:32:03,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:32:03,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:32:03,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:32:03,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:32:03,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:32:03,717 INFO L87 Difference]: Start difference. First operand 91 states and 138 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:04,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:32:04,032 INFO L93 Difference]: Finished difference Result 270 states and 404 transitions. [2023-11-23 22:32:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 22:32:04,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2023-11-23 22:32:04,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:32:04,042 INFO L225 Difference]: With dead ends: 270 [2023-11-23 22:32:04,042 INFO L226 Difference]: Without dead ends: 180 [2023-11-23 22:32:04,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:32:04,057 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 208 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 22:32:04,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 315 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 22:32:04,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-23 22:32:04,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 102. [2023-11-23 22:32:04,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 84 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 22:32:04,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2023-11-23 22:32:04,108 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 112 [2023-11-23 22:32:04,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:32:04,111 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2023-11-23 22:32:04,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:04,111 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2023-11-23 22:32:04,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-23 22:32:04,118 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:32:04,119 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:32:04,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 22:32:04,120 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:32:04,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:32:04,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1321040424, now seen corresponding path program 1 times [2023-11-23 22:32:04,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:32:04,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654146489] [2023-11-23 22:32:04,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:32:04,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:32:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:04,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:32:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:04,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:32:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:04,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:32:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:04,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:32:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:04,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:32:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:04,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:32:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:04,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:32:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:04,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:32:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:04,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 22:32:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:04,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 22:32:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:04,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 22:32:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:04,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 22:32:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:04,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 22:32:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:04,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 22:32:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:04,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 22:32:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:04,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 22:32:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:32:04,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:32:04,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654146489] [2023-11-23 22:32:04,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654146489] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:32:04,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:32:04,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 22:32:04,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024134255] [2023-11-23 22:32:04,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:32:04,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:32:04,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:32:04,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:32:04,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:32:04,607 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:04,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:32:04,949 INFO L93 Difference]: Finished difference Result 298 states and 442 transitions. [2023-11-23 22:32:04,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:32:04,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2023-11-23 22:32:04,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:32:04,952 INFO L225 Difference]: With dead ends: 298 [2023-11-23 22:32:04,953 INFO L226 Difference]: Without dead ends: 197 [2023-11-23 22:32:04,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:32:04,962 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 192 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 22:32:04,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 95 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 22:32:04,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-11-23 22:32:05,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 104. [2023-11-23 22:32:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 86 states have internal predecessors, (122), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 22:32:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2023-11-23 22:32:05,006 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 112 [2023-11-23 22:32:05,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:32:05,010 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2023-11-23 22:32:05,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:05,011 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2023-11-23 22:32:05,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-23 22:32:05,018 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:32:05,018 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:32:05,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 22:32:05,018 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:32:05,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:32:05,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1062874986, now seen corresponding path program 1 times [2023-11-23 22:32:05,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:32:05,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548168997] [2023-11-23 22:32:05,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:32:05,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:32:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:05,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:32:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:05,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:32:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:05,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:32:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:05,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:32:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:05,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:32:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:05,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:32:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:05,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:32:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:05,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:32:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:05,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 22:32:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:05,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 22:32:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:05,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 22:32:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:05,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 22:32:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:05,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 22:32:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:05,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 22:32:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:05,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 22:32:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:05,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 22:32:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:05,707 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:32:05,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:32:05,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548168997] [2023-11-23 22:32:05,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548168997] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:32:05,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:32:05,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 22:32:05,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034798806] [2023-11-23 22:32:05,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:32:05,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 22:32:05,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:32:05,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 22:32:05,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:32:05,711 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:06,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:32:06,133 INFO L93 Difference]: Finished difference Result 270 states and 398 transitions. [2023-11-23 22:32:06,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 22:32:06,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2023-11-23 22:32:06,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:32:06,136 INFO L225 Difference]: With dead ends: 270 [2023-11-23 22:32:06,136 INFO L226 Difference]: Without dead ends: 167 [2023-11-23 22:32:06,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-23 22:32:06,138 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 86 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 22:32:06,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 640 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 22:32:06,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-11-23 22:32:06,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2023-11-23 22:32:06,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 98 states have internal predecessors, (139), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 22:32:06,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 171 transitions. [2023-11-23 22:32:06,168 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 171 transitions. Word has length 112 [2023-11-23 22:32:06,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:32:06,168 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 171 transitions. [2023-11-23 22:32:06,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 171 transitions. [2023-11-23 22:32:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 22:32:06,170 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:32:06,170 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:32:06,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 22:32:06,171 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:32:06,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:32:06,171 INFO L85 PathProgramCache]: Analyzing trace with hash -234745676, now seen corresponding path program 1 times [2023-11-23 22:32:06,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:32:06,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428428705] [2023-11-23 22:32:06,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:32:06,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:32:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:06,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:32:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:06,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:32:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:06,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:32:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:06,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:32:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:06,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:32:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:06,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:32:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:06,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:32:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:06,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:32:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:06,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 22:32:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:06,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 22:32:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:06,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 22:32:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:06,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 22:32:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:06,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 22:32:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:06,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 22:32:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:06,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 22:32:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:06,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 22:32:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:32:06,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:32:06,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428428705] [2023-11-23 22:32:06,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428428705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:32:06,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:32:06,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 22:32:06,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551518078] [2023-11-23 22:32:06,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:32:06,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:32:06,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:32:06,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:32:06,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:32:06,597 INFO L87 Difference]: Start difference. First operand 116 states and 171 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:06,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:32:06,979 INFO L93 Difference]: Finished difference Result 377 states and 556 transitions. [2023-11-23 22:32:06,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:32:06,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-11-23 22:32:06,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:32:06,986 INFO L225 Difference]: With dead ends: 377 [2023-11-23 22:32:06,986 INFO L226 Difference]: Without dead ends: 262 [2023-11-23 22:32:06,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:32:06,989 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 112 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 22:32:06,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 298 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 22:32:06,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-11-23 22:32:07,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 225. [2023-11-23 22:32:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 190 states have (on average 1.3894736842105264) internal successors, (264), 190 states have internal predecessors, (264), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-23 22:32:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 328 transitions. [2023-11-23 22:32:07,091 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 328 transitions. Word has length 113 [2023-11-23 22:32:07,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:32:07,092 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 328 transitions. [2023-11-23 22:32:07,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:07,093 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 328 transitions. [2023-11-23 22:32:07,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 22:32:07,095 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:32:07,095 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:32:07,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 22:32:07,096 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:32:07,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:32:07,097 INFO L85 PathProgramCache]: Analyzing trace with hash 294085926, now seen corresponding path program 1 times [2023-11-23 22:32:07,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:32:07,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609526786] [2023-11-23 22:32:07,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:32:07,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:32:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:32:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:32:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:32:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:32:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:32:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:32:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:32:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:32:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 22:32:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 22:32:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 22:32:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 22:32:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 22:32:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 22:32:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 22:32:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 22:32:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,252 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:32:07,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:32:07,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609526786] [2023-11-23 22:32:07,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609526786] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:32:07,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:32:07,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:32:07,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009949662] [2023-11-23 22:32:07,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:32:07,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:32:07,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:32:07,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:32:07,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:32:07,255 INFO L87 Difference]: Start difference. First operand 225 states and 328 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:07,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:32:07,411 INFO L93 Difference]: Finished difference Result 540 states and 787 transitions. [2023-11-23 22:32:07,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:32:07,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-11-23 22:32:07,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:32:07,416 INFO L225 Difference]: With dead ends: 540 [2023-11-23 22:32:07,416 INFO L226 Difference]: Without dead ends: 316 [2023-11-23 22:32:07,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:32:07,419 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 67 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:32:07,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 208 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:32:07,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-11-23 22:32:07,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 232. [2023-11-23 22:32:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 197 states have (on average 1.380710659898477) internal successors, (272), 197 states have internal predecessors, (272), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-23 22:32:07,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 336 transitions. [2023-11-23 22:32:07,501 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 336 transitions. Word has length 113 [2023-11-23 22:32:07,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:32:07,502 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 336 transitions. [2023-11-23 22:32:07,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:07,502 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 336 transitions. [2023-11-23 22:32:07,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 22:32:07,504 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:32:07,504 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:32:07,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 22:32:07,504 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:32:07,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:32:07,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1798271025, now seen corresponding path program 1 times [2023-11-23 22:32:07,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:32:07,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904986318] [2023-11-23 22:32:07,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:32:07,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:32:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:32:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:32:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:32:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:32:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:32:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:32:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:32:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:32:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 22:32:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 22:32:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 22:32:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 22:32:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 22:32:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 22:32:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 22:32:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 22:32:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:32:07,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:32:07,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904986318] [2023-11-23 22:32:07,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904986318] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:32:07,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:32:07,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:32:07,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744830917] [2023-11-23 22:32:07,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:32:07,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:32:07,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:32:07,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:32:07,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:32:07,675 INFO L87 Difference]: Start difference. First operand 232 states and 336 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:07,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:32:07,895 INFO L93 Difference]: Finished difference Result 545 states and 789 transitions. [2023-11-23 22:32:07,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:32:07,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-11-23 22:32:07,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:32:07,899 INFO L225 Difference]: With dead ends: 545 [2023-11-23 22:32:07,899 INFO L226 Difference]: Without dead ends: 314 [2023-11-23 22:32:07,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:32:07,903 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 70 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:32:07,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 175 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:32:07,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2023-11-23 22:32:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 212. [2023-11-23 22:32:07,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 177 states have (on average 1.3615819209039548) internal successors, (241), 177 states have internal predecessors, (241), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-23 22:32:07,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 305 transitions. [2023-11-23 22:32:07,998 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 305 transitions. Word has length 113 [2023-11-23 22:32:07,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:32:08,000 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 305 transitions. [2023-11-23 22:32:08,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 305 transitions. [2023-11-23 22:32:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 22:32:08,002 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:32:08,002 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:32:08,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 22:32:08,003 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:32:08,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:32:08,003 INFO L85 PathProgramCache]: Analyzing trace with hash 582902774, now seen corresponding path program 1 times [2023-11-23 22:32:08,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:32:08,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057512975] [2023-11-23 22:32:08,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:32:08,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:32:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:08,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:32:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:08,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:32:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:08,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:32:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:08,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:32:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:08,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:32:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:08,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:32:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:08,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:32:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:08,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:32:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:08,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 22:32:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:08,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 22:32:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:08,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 22:32:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:08,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 22:32:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:08,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 22:32:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:08,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 22:32:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:08,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 22:32:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:08,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 22:32:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:08,747 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:32:08,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:32:08,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057512975] [2023-11-23 22:32:08,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057512975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:32:08,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:32:08,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 22:32:08,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631606564] [2023-11-23 22:32:08,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:32:08,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 22:32:08,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:32:08,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 22:32:08,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-23 22:32:08,751 INFO L87 Difference]: Start difference. First operand 212 states and 305 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:09,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:32:09,467 INFO L93 Difference]: Finished difference Result 501 states and 704 transitions. [2023-11-23 22:32:09,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 22:32:09,467 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-11-23 22:32:09,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:32:09,470 INFO L225 Difference]: With dead ends: 501 [2023-11-23 22:32:09,470 INFO L226 Difference]: Without dead ends: 290 [2023-11-23 22:32:09,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-11-23 22:32:09,472 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 78 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 22:32:09,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 489 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 22:32:09,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-11-23 22:32:09,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 210. [2023-11-23 22:32:09,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 175 states have (on average 1.2914285714285714) internal successors, (226), 175 states have internal predecessors, (226), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-23 22:32:09,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 290 transitions. [2023-11-23 22:32:09,545 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 290 transitions. Word has length 113 [2023-11-23 22:32:09,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:32:09,545 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 290 transitions. [2023-11-23 22:32:09,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:09,546 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 290 transitions. [2023-11-23 22:32:09,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-23 22:32:09,548 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:32:09,548 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:32:09,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 22:32:09,548 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:32:09,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:32:09,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1538284443, now seen corresponding path program 1 times [2023-11-23 22:32:09,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:32:09,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73915001] [2023-11-23 22:32:09,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:32:09,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:32:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:10,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:32:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:10,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:32:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:10,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:32:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:10,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:32:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:10,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:32:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:10,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:32:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:10,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:32:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:10,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:32:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:10,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 22:32:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:10,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 22:32:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:10,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 22:32:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:10,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 22:32:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:10,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 22:32:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:10,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 22:32:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:10,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 22:32:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:10,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 22:32:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:10,106 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:32:10,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:32:10,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73915001] [2023-11-23 22:32:10,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73915001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:32:10,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:32:10,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 22:32:10,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294826897] [2023-11-23 22:32:10,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:32:10,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 22:32:10,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:32:10,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 22:32:10,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-23 22:32:10,109 INFO L87 Difference]: Start difference. First operand 210 states and 290 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:10,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:32:10,970 INFO L93 Difference]: Finished difference Result 518 states and 716 transitions. [2023-11-23 22:32:10,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 22:32:10,970 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2023-11-23 22:32:10,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:32:10,973 INFO L225 Difference]: With dead ends: 518 [2023-11-23 22:32:10,973 INFO L226 Difference]: Without dead ends: 309 [2023-11-23 22:32:10,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-11-23 22:32:10,975 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 185 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 22:32:10,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 602 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 22:32:10,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-11-23 22:32:11,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 218. [2023-11-23 22:32:11,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 183 states have (on average 1.289617486338798) internal successors, (236), 183 states have internal predecessors, (236), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-23 22:32:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 300 transitions. [2023-11-23 22:32:11,051 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 300 transitions. Word has length 114 [2023-11-23 22:32:11,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:32:11,051 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 300 transitions. [2023-11-23 22:32:11,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 300 transitions. [2023-11-23 22:32:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-23 22:32:11,053 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:32:11,054 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:32:11,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 22:32:11,054 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:32:11,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:32:11,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1105564529, now seen corresponding path program 1 times [2023-11-23 22:32:11,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:32:11,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714142522] [2023-11-23 22:32:11,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:32:11,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:32:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:11,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:32:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:11,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:32:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:11,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:32:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:11,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:32:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:11,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:32:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:11,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:32:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:11,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:32:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:11,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:32:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:11,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 22:32:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:11,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 22:32:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:11,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 22:32:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:11,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 22:32:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:11,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 22:32:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:11,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 22:32:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:11,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 22:32:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:11,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 22:32:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:32:11,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:32:11,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714142522] [2023-11-23 22:32:11,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714142522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:32:11,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:32:11,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:32:11,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849600408] [2023-11-23 22:32:11,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:32:11,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:32:11,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:32:11,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:32:11,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:32:11,182 INFO L87 Difference]: Start difference. First operand 218 states and 300 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:11,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:32:11,383 INFO L93 Difference]: Finished difference Result 551 states and 757 transitions. [2023-11-23 22:32:11,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:32:11,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2023-11-23 22:32:11,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:32:11,386 INFO L225 Difference]: With dead ends: 551 [2023-11-23 22:32:11,387 INFO L226 Difference]: Without dead ends: 334 [2023-11-23 22:32:11,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:32:11,388 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 76 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 160 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.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:32:11,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 160 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:32:11,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-11-23 22:32:11,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 246. [2023-11-23 22:32:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 211 states have (on average 1.2748815165876777) internal successors, (269), 211 states have internal predecessors, (269), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-23 22:32:11,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 333 transitions. [2023-11-23 22:32:11,493 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 333 transitions. Word has length 114 [2023-11-23 22:32:11,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:32:11,494 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 333 transitions. [2023-11-23 22:32:11,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 333 transitions. [2023-11-23 22:32:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-23 22:32:11,498 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:32:11,498 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:32:11,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 22:32:11,498 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:32:11,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:32:11,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1103717487, now seen corresponding path program 1 times [2023-11-23 22:32:11,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:32:11,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652750439] [2023-11-23 22:32:11,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:32:11,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:32:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:32:11,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:32:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:32:11,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:32:11,724 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 22:32:11,725 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 22:32:11,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 22:32:11,730 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:32:11,738 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 22:32:11,843 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-23 22:32:11,844 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-23 22:32:11,845 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-23 22:32:11,846 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-23 22:32:11,846 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-23 22:32:11,846 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-23 22:32:11,846 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-23 22:32:11,847 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated [2023-11-23 22:32:11,847 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated [2023-11-23 22:32:11,847 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-23 22:32:11,850 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-23 22:32:11,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:32:11 BoogieIcfgContainer [2023-11-23 22:32:11,877 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 22:32:11,878 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 22:32:11,878 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 22:32:11,878 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 22:32:11,878 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:32:00" (3/4) ... [2023-11-23 22:32:11,880 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-23 22:32:11,881 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 22:32:11,882 INFO L158 Benchmark]: Toolchain (without parser) took 12776.29ms. Allocated memory was 136.3MB in the beginning and 247.5MB in the end (delta: 111.1MB). Free memory was 94.2MB in the beginning and 138.2MB in the end (delta: -44.0MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. [2023-11-23 22:32:11,882 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 102.8MB. Free memory is still 50.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 22:32:11,882 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.04ms. Allocated memory is still 136.3MB. Free memory was 94.2MB in the beginning and 79.9MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-23 22:32:11,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.50ms. Allocated memory is still 136.3MB. Free memory was 79.9MB in the beginning and 76.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 22:32:11,883 INFO L158 Benchmark]: Boogie Preprocessor took 125.17ms. Allocated memory is still 136.3MB. Free memory was 76.4MB in the beginning and 109.5MB in the end (delta: -33.1MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2023-11-23 22:32:11,884 INFO L158 Benchmark]: RCFGBuilder took 883.69ms. Allocated memory is still 136.3MB. Free memory was 109.5MB in the beginning and 85.9MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-23 22:32:11,885 INFO L158 Benchmark]: TraceAbstraction took 11166.96ms. Allocated memory was 136.3MB in the beginning and 247.5MB in the end (delta: 111.1MB). Free memory was 85.3MB in the beginning and 138.2MB in the end (delta: -52.9MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2023-11-23 22:32:11,885 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 247.5MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 22:32:11,887 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.29ms. Allocated memory is still 102.8MB. Free memory is still 50.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.04ms. Allocated memory is still 136.3MB. Free memory was 94.2MB in the beginning and 79.9MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.50ms. Allocated memory is still 136.3MB. Free memory was 79.9MB in the beginning and 76.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.17ms. Allocated memory is still 136.3MB. Free memory was 76.4MB in the beginning and 109.5MB in the end (delta: -33.1MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * RCFGBuilder took 883.69ms. Allocated memory is still 136.3MB. Free memory was 109.5MB in the beginning and 85.9MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11166.96ms. Allocated memory was 136.3MB in the beginning and 247.5MB in the end (delta: 111.1MB). Free memory was 85.3MB in the beginning and 138.2MB in the end (delta: -52.9MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. * Witness Printer took 3.73ms. Allocated memory is still 247.5MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of shiftRight at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] signed long int last_1_var_1_1 = 64; [L44] unsigned char last_1_var_1_13 = 64; [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L120] last_1_var_1_1 = var_1_1 [L121] last_1_var_1_13 = var_1_13 [L131] RET updateLastVariables() [L132] CALL updateVariables() [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L92] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L95] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L97] var_1_16 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L98] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L100] var_1_18 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L101] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L102] var_1_19 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L103] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L104] var_1_20 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L105] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L106] var_1_21 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L107] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L108] var_1_22 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L109] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L110] var_1_23 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L112] var_1_27 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L113] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L115] var_1_28 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L116] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L132] RET updateVariables() [L133] CALL step() [L48] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L49] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L52] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L53] COND FALSE !(\read(var_1_7)) [L56] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L58] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L61] var_1_32 = var_1_16 [L62] var_1_30 = var_1_32 [L63] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L64] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L64] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L65] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L67] COND TRUE var_1_11 >= var_1_30 [L68] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L70] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L70] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L71] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L79] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L80] COND TRUE ! var_1_7 [L81] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124-L125] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-184, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 13, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1301 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1301 mSDsluCounter, 3406 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2035 mSDsCounter, 235 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1300 IncrementalHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 235 mSolverCounterUnsat, 1371 mSDtfsCounter, 1300 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 490 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=246occurred in iteration=12, InterpolantAutomatonStates: 74, 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, 12 MinimizatonAttempts, 765 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1466 NumberOfCodeBlocks, 1466 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1340 ConstructedInterpolants, 0 QuantifiedInterpolants, 3395 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 5760/5760 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-23 22:32:11,949 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ --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 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:32:14,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:32:14,802 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-23 22:32:14,809 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:32:14,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:32:14,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:32:14,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:32:14,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:32:14,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 22:32:14,873 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 22:32:14,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:32:14,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:32:14,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:32:14,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:32:14,878 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:32:14,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:32:14,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 22:32:14,880 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:32:14,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:32:14,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:32:14,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 22:32:14,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:32:14,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 22:32:14,884 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 22:32:14,884 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 22:32:14,885 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 22:32:14,885 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:32:14,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 22:32:14,886 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:32:14,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:32:14,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:32:14,889 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 22:32:14,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:32:14,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:32:14,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:32:14,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:32:14,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 22:32:14,892 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-23 22:32:14,892 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 22:32:14,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:32:14,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:32:14,893 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 22:32:14,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:32:14,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:32:14,894 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-23 22:32:14,895 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ 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 -> 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 [2023-11-23 22:32:15,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:32:15,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:32:15,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:32:15,403 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:32:15,403 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:32:15,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i [2023-11-23 22:32:18,790 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:32:19,099 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:32:19,100 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i [2023-11-23 22:32:19,115 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/data/a6b3de837/ab3ab44110d243fb9e75e538b457bdd2/FLAGb25ecf8b5 [2023-11-23 22:32:19,133 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/data/a6b3de837/ab3ab44110d243fb9e75e538b457bdd2 [2023-11-23 22:32:19,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:32:19,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:32:19,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:32:19,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:32:19,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:32:19,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:32:19" (1/1) ... [2023-11-23 22:32:19,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f696b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19, skipping insertion in model container [2023-11-23 22:32:19,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:32:19" (1/1) ... [2023-11-23 22:32:19,195 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:32:19,352 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i[913,926] [2023-11-23 22:32:19,452 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:32:19,479 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:32:19,496 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i[913,926] [2023-11-23 22:32:19,551 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:32:19,571 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:32:19,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19 WrapperNode [2023-11-23 22:32:19,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:32:19,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:32:19,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:32:19,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:32:19,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (1/1) ... [2023-11-23 22:32:19,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (1/1) ... [2023-11-23 22:32:19,630 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2023-11-23 22:32:19,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:32:19,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:32:19,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:32:19,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:32:19,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (1/1) ... [2023-11-23 22:32:19,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (1/1) ... [2023-11-23 22:32:19,650 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (1/1) ... [2023-11-23 22:32:19,673 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-23 22:32:19,676 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (1/1) ... [2023-11-23 22:32:19,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (1/1) ... [2023-11-23 22:32:19,690 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (1/1) ... [2023-11-23 22:32:19,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (1/1) ... [2023-11-23 22:32:19,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (1/1) ... [2023-11-23 22:32:19,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (1/1) ... [2023-11-23 22:32:19,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:32:19,736 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:32:19,736 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:32:19,736 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:32:19,737 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (1/1) ... [2023-11-23 22:32:19,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:32:19,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:32:19,790 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:32:19,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:32:19,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:32:19,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-23 22:32:19,864 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 22:32:19,864 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 22:32:19,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:32:19,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:32:19,998 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:32:20,000 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:32:24,799 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:32:24,856 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:32:24,857 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 22:32:24,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:32:24 BoogieIcfgContainer [2023-11-23 22:32:24,857 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:32:24,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:32:24,860 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:32:24,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:32:24,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:32:19" (1/3) ... [2023-11-23 22:32:24,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503c5e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:32:24, skipping insertion in model container [2023-11-23 22:32:24,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:19" (2/3) ... [2023-11-23 22:32:24,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503c5e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:32:24, skipping insertion in model container [2023-11-23 22:32:24,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:32:24" (3/3) ... [2023-11-23 22:32:24,867 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-63.i [2023-11-23 22:32:24,886 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:32:24,886 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 22:32:24,935 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:32:24,942 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@824e6fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:32:24,943 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 22:32:24,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 22:32:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-23 22:32:24,961 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:32:24,961 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:32:24,962 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:32:24,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:32:24,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1106764813, now seen corresponding path program 1 times [2023-11-23 22:32:24,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 22:32:24,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905744514] [2023-11-23 22:32:24,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:32:24,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 22:32:24,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 22:32:24,988 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 22:32:25,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-23 22:32:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:25,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-23 22:32:25,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:32:25,627 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2023-11-23 22:32:25,627 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:32:25,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 22:32:25,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905744514] [2023-11-23 22:32:25,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [905744514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:32:25,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:32:25,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:32:25,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721357922] [2023-11-23 22:32:25,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:32:25,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 22:32:25,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 22:32:25,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 22:32:25,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 22:32:25,672 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-23 22:32:27,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 22:32:27,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:32:27,808 INFO L93 Difference]: Finished difference Result 101 states and 172 transitions. [2023-11-23 22:32:27,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 22:32:27,832 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2023-11-23 22:32:27,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:32:27,840 INFO L225 Difference]: With dead ends: 101 [2023-11-23 22:32:27,841 INFO L226 Difference]: Without dead ends: 50 [2023-11-23 22:32:27,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 22:32:27,848 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:32:27,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2023-11-23 22:32:27,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-23 22:32:27,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-23 22:32:27,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 22:32:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2023-11-23 22:32:27,897 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 106 [2023-11-23 22:32:27,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:32:27,898 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2023-11-23 22:32:27,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-23 22:32:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2023-11-23 22:32:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-23 22:32:27,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:32:27,902 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:32:27,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-23 22:32:28,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 22:32:28,115 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:32:28,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:32:28,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1542581721, now seen corresponding path program 1 times [2023-11-23 22:32:28,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 22:32:28,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888094816] [2023-11-23 22:32:28,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:32:28,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 22:32:28,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 22:32:28,120 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 22:32:28,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-23 22:32:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:28,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 22:32:28,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:32:28,690 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:32:28,690 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:32:28,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 22:32:28,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888094816] [2023-11-23 22:32:28,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888094816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:32:28,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:32:28,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:32:28,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182995014] [2023-11-23 22:32:28,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:32:28,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:32:28,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 22:32:28,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:32:28,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:32:28,695 INFO L87 Difference]: Start difference. First operand 50 states and 74 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:30,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 22:32:31,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:32:31,817 INFO L93 Difference]: Finished difference Result 113 states and 167 transitions. [2023-11-23 22:32:31,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:32:31,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2023-11-23 22:32:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:32:31,820 INFO L225 Difference]: With dead ends: 113 [2023-11-23 22:32:31,820 INFO L226 Difference]: Without dead ends: 64 [2023-11-23 22:32:31,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:32:31,824 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 12 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:32:31,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 131 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2023-11-23 22:32:31,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-23 22:32:31,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2023-11-23 22:32:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 22:32:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2023-11-23 22:32:31,839 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 106 [2023-11-23 22:32:31,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:32:31,841 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2023-11-23 22:32:31,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:32:31,842 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2023-11-23 22:32:31,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-23 22:32:31,844 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:32:31,845 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:32:31,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-23 22:32:32,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 22:32:32,046 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:32:32,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:32:32,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1850619289, now seen corresponding path program 1 times [2023-11-23 22:32:32,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 22:32:32,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394980803] [2023-11-23 22:32:32,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:32:32,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 22:32:32,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 22:32:32,049 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 22:32:32,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a00a1c2b-809e-4917-b514-b8297e1198e3/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-23 22:32:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:32,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-23 22:32:32,546 INFO L285 TraceCheckSpWp]: Computing forward predicates...