./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX --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 a8e8864fbe413b3462ae8de456d5394de90101cbca5bf1017bcb2949274e710c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:20:27,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:20:28,022 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:20:28,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:20:28,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:20:28,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:20:28,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:20:28,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:20:28,084 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:20:28,084 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:20:28,085 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:20:28,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:20:28,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:20:28,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:20:28,089 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:20:28,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:20:28,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:20:28,091 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:20:28,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:20:28,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:20:28,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:20:28,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:20:28,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:20:28,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:20:28,096 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:20:28,096 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:20:28,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:20:28,097 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:20:28,098 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:20:28,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:20:28,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:20:28,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:20:28,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:20:28,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:20:28,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:20:28,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:20:28,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:20:28,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:20:28,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:20:28,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:20:28,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:20:28,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:20:28,105 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_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/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_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX 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 -> a8e8864fbe413b3462ae8de456d5394de90101cbca5bf1017bcb2949274e710c [2024-11-08 16:20:28,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:20:28,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:20:28,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:20:28,584 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:20:28,585 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:20:28,587 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i Unable to find full path for "g++" [2024-11-08 16:20:31,351 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:20:31,735 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:20:31,736 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i [2024-11-08 16:20:31,756 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/data/38a730a17/877d097e5a344c5eba7f3c12e1fc7dd0/FLAG73baf70a1 [2024-11-08 16:20:31,780 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/data/38a730a17/877d097e5a344c5eba7f3c12e1fc7dd0 [2024-11-08 16:20:31,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:20:31,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:20:31,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:20:31,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:20:31,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:20:31,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:20:31" (1/1) ... [2024-11-08 16:20:31,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfdaa61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:31, skipping insertion in model container [2024-11-08 16:20:31,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:20:31" (1/1) ... [2024-11-08 16:20:31,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:20:32,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i[916,929] [2024-11-08 16:20:32,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:20:32,228 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:20:32,248 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i[916,929] [2024-11-08 16:20:32,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:20:32,322 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:20:32,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:32 WrapperNode [2024-11-08 16:20:32,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:20:32,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:20:32,324 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:20:32,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:20:32,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:32" (1/1) ... [2024-11-08 16:20:32,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:32" (1/1) ... [2024-11-08 16:20:32,397 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2024-11-08 16:20:32,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:20:32,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:20:32,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:20:32,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:20:32,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:32" (1/1) ... [2024-11-08 16:20:32,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:32" (1/1) ... [2024-11-08 16:20:32,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:32" (1/1) ... [2024-11-08 16:20:32,445 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 16:20:32,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:32" (1/1) ... [2024-11-08 16:20:32,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:32" (1/1) ... [2024-11-08 16:20:32,457 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:32" (1/1) ... [2024-11-08 16:20:32,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:32" (1/1) ... [2024-11-08 16:20:32,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:32" (1/1) ... [2024-11-08 16:20:32,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:32" (1/1) ... [2024-11-08 16:20:32,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:20:32,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:20:32,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:20:32,476 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:20:32,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:32" (1/1) ... [2024-11-08 16:20:32,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:20:32,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:20:32,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:20:32,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:20:32,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:20:32,608 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:20:32,609 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:20:32,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:20:32,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:20:32,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:20:32,760 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:20:32,769 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:20:33,327 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-08 16:20:33,328 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:20:33,357 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:20:33,360 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:20:33,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:20:33 BoogieIcfgContainer [2024-11-08 16:20:33,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:20:33,367 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:20:33,367 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:20:33,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:20:33,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:20:31" (1/3) ... [2024-11-08 16:20:33,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d77b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:20:33, skipping insertion in model container [2024-11-08 16:20:33,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:32" (2/3) ... [2024-11-08 16:20:33,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d77b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:20:33, skipping insertion in model container [2024-11-08 16:20:33,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:20:33" (3/3) ... [2024-11-08 16:20:33,379 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-9.i [2024-11-08 16:20:33,405 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:20:33,405 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:20:33,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:20:33,503 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@d0f0228, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:20:33,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:20:33,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 61 states have internal predecessors, (83), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 16:20:33,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 16:20:33,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:20:33,530 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:20:33,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:20:33,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:20:33,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2041280897, now seen corresponding path program 1 times [2024-11-08 16:20:33,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:20:33,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297719365] [2024-11-08 16:20:33,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:20:33,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:20:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:20:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:20:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:20:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:20:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:20:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:20:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:20:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:20:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:20:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:20:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:20:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:20:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:20:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:20:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 16:20:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 16:20:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 16:20:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 16:20:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:20:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 16:20:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 16:20:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:34,314 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 16:20:34,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:20:34,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297719365] [2024-11-08 16:20:34,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297719365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:20:34,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:20:34,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:20:34,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081929793] [2024-11-08 16:20:34,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:20:34,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:20:34,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:20:34,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:20:34,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:20:34,388 INFO L87 Difference]: Start difference. First operand has 84 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 61 states have internal predecessors, (83), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 16:20:34,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:20:34,436 INFO L93 Difference]: Finished difference Result 161 states and 265 transitions. [2024-11-08 16:20:34,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:20:34,441 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 143 [2024-11-08 16:20:34,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:20:34,456 INFO L225 Difference]: With dead ends: 161 [2024-11-08 16:20:34,457 INFO L226 Difference]: Without dead ends: 80 [2024-11-08 16:20:34,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:20:34,470 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:20:34,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:20:34,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-08 16:20:34,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-08 16:20:34,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 16:20:34,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2024-11-08 16:20:34,552 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 143 [2024-11-08 16:20:34,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:20:34,553 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2024-11-08 16:20:34,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 16:20:34,554 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2024-11-08 16:20:34,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 16:20:34,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:20:34,570 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:20:34,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:20:34,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:20:34,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:20:34,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1414722247, now seen corresponding path program 1 times [2024-11-08 16:20:34,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:20:34,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192077065] [2024-11-08 16:20:34,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:20:34,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:20:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:20:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:20:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:20:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:20:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:20:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:20:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:20:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:20:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:20:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:20:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:20:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:20:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:20:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:20:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 16:20:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 16:20:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 16:20:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 16:20:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:20:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 16:20:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 16:20:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 16:20:35,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:20:35,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192077065] [2024-11-08 16:20:35,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192077065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:20:35,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:20:35,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:20:35,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695881054] [2024-11-08 16:20:35,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:20:35,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:20:35,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:20:35,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:20:35,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:20:35,223 INFO L87 Difference]: Start difference. First operand 80 states and 118 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 16:20:35,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:20:35,290 INFO L93 Difference]: Finished difference Result 158 states and 235 transitions. [2024-11-08 16:20:35,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:20:35,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 143 [2024-11-08 16:20:35,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:20:35,299 INFO L225 Difference]: With dead ends: 158 [2024-11-08 16:20:35,300 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 16:20:35,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:20:35,307 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:20:35,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:20:35,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 16:20:35,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-08 16:20:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 58 states have internal predecessors, (77), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 16:20:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 119 transitions. [2024-11-08 16:20:35,341 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 119 transitions. Word has length 143 [2024-11-08 16:20:35,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:20:35,344 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 119 transitions. [2024-11-08 16:20:35,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 16:20:35,344 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 119 transitions. [2024-11-08 16:20:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 16:20:35,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:20:35,354 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:20:35,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:20:35,354 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:20:35,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:20:35,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1151604900, now seen corresponding path program 1 times [2024-11-08 16:20:35,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:20:35,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783486075] [2024-11-08 16:20:35,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:20:35,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:20:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:43,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:20:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:43,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:20:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:43,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:20:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:43,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:20:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:43,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:20:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:43,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:20:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:43,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:20:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:43,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:20:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:43,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:20:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:43,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:20:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:43,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:20:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:43,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:20:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:43,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:20:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:43,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:20:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:43,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 16:20:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:43,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 16:20:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:43,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 16:20:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:43,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 16:20:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:43,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:20:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:44,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 16:20:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:44,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 16:20:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 16:20:44,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:20:44,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783486075] [2024-11-08 16:20:44,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783486075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:20:44,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:20:44,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 16:20:44,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690158263] [2024-11-08 16:20:44,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:20:44,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 16:20:44,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:20:44,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 16:20:44,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:20:44,057 INFO L87 Difference]: Start difference. First operand 81 states and 119 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-08 16:20:47,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:20:47,873 INFO L93 Difference]: Finished difference Result 275 states and 388 transitions. [2024-11-08 16:20:47,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:20:47,874 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 144 [2024-11-08 16:20:47,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:20:47,879 INFO L225 Difference]: With dead ends: 275 [2024-11-08 16:20:47,879 INFO L226 Difference]: Without dead ends: 197 [2024-11-08 16:20:47,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-08 16:20:47,883 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 724 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:20:47,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 649 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 16:20:47,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-08 16:20:47,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 138. [2024-11-08 16:20:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 111 states have (on average 1.3783783783783783) internal successors, (153), 112 states have internal predecessors, (153), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:20:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 199 transitions. [2024-11-08 16:20:47,925 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 199 transitions. Word has length 144 [2024-11-08 16:20:47,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:20:47,926 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 199 transitions. [2024-11-08 16:20:47,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-08 16:20:47,927 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 199 transitions. [2024-11-08 16:20:47,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 16:20:47,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:20:47,931 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:20:47,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:20:47,932 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:20:47,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:20:47,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1738410914, now seen corresponding path program 1 times [2024-11-08 16:20:47,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:20:47,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113997491] [2024-11-08 16:20:47,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:20:47,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:20:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:20:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:20:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:20:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:20:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:20:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:20:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:20:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:20:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:20:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:20:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:20:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:20:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:20:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:20:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 16:20:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 16:20:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 16:20:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 16:20:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:20:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 16:20:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 16:20:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 16:20:50,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:20:50,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113997491] [2024-11-08 16:20:50,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113997491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:20:50,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:20:50,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:20:50,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607770603] [2024-11-08 16:20:50,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:20:50,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:20:50,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:20:50,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:20:50,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:20:50,931 INFO L87 Difference]: Start difference. First operand 138 states and 199 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 16:20:51,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:20:51,630 INFO L93 Difference]: Finished difference Result 319 states and 452 transitions. [2024-11-08 16:20:51,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:20:51,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2024-11-08 16:20:51,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:20:51,636 INFO L225 Difference]: With dead ends: 319 [2024-11-08 16:20:51,639 INFO L226 Difference]: Without dead ends: 184 [2024-11-08 16:20:51,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:20:51,646 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 116 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:20:51,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 519 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:20:51,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-08 16:20:51,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 138. [2024-11-08 16:20:51,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 111 states have (on average 1.3783783783783783) internal successors, (153), 112 states have internal predecessors, (153), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:20:51,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 199 transitions. [2024-11-08 16:20:51,697 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 199 transitions. Word has length 144 [2024-11-08 16:20:51,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:20:51,698 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 199 transitions. [2024-11-08 16:20:51,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 16:20:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 199 transitions. [2024-11-08 16:20:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 16:20:51,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:20:51,702 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:20:51,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:20:51,703 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:20:51,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:20:51,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2122294042, now seen corresponding path program 1 times [2024-11-08 16:20:51,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:20:51,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803258962] [2024-11-08 16:20:51,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:20:51,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:20:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:20:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:20:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:20:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:20:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:20:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:20:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:20:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:20:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:20:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:20:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:20:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:20:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:20:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:20:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 16:20:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 16:20:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 16:20:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 16:20:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:20:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 16:20:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 16:20:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:52,972 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 16:20:52,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:20:52,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803258962] [2024-11-08 16:20:52,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803258962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:20:52,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:20:52,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:20:52,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714784212] [2024-11-08 16:20:52,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:20:52,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:20:52,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:20:52,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:20:52,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:20:52,980 INFO L87 Difference]: Start difference. First operand 138 states and 199 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 16:20:53,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:20:53,843 INFO L93 Difference]: Finished difference Result 309 states and 436 transitions. [2024-11-08 16:20:53,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:20:53,844 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2024-11-08 16:20:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:20:53,847 INFO L225 Difference]: With dead ends: 309 [2024-11-08 16:20:53,847 INFO L226 Difference]: Without dead ends: 174 [2024-11-08 16:20:53,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:20:53,849 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 92 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:20:53,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 799 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 16:20:53,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-08 16:20:53,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 123. [2024-11-08 16:20:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 96 states have (on average 1.34375) internal successors, (129), 97 states have internal predecessors, (129), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:20:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2024-11-08 16:20:53,877 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 144 [2024-11-08 16:20:53,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:20:53,878 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2024-11-08 16:20:53,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 16:20:53,879 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2024-11-08 16:20:53,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 16:20:53,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:20:53,881 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:20:53,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:20:53,882 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:20:53,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:20:53,882 INFO L85 PathProgramCache]: Analyzing trace with hash 436743002, now seen corresponding path program 1 times [2024-11-08 16:20:53,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:20:53,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973054795] [2024-11-08 16:20:53,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:20:53,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:20:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:20:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:20:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:20:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:20:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:20:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:20:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:20:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:20:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:20:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:20:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:20:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:20:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:20:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:20:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 16:20:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 16:20:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 16:20:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 16:20:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:20:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 16:20:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 16:20:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 16:20:55,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:20:55,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973054795] [2024-11-08 16:20:55,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973054795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:20:55,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:20:55,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:20:55,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625677175] [2024-11-08 16:20:55,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:20:55,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:20:55,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:20:55,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:20:55,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:20:55,920 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 16:20:56,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:20:56,473 INFO L93 Difference]: Finished difference Result 304 states and 422 transitions. [2024-11-08 16:20:56,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:20:56,474 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2024-11-08 16:20:56,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:20:56,476 INFO L225 Difference]: With dead ends: 304 [2024-11-08 16:20:56,477 INFO L226 Difference]: Without dead ends: 184 [2024-11-08 16:20:56,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:20:56,479 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 126 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:20:56,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 937 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:20:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-08 16:20:56,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 151. [2024-11-08 16:20:56,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 120 states have (on average 1.35) internal successors, (162), 121 states have internal predecessors, (162), 25 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 16:20:56,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 212 transitions. [2024-11-08 16:20:56,516 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 212 transitions. Word has length 144 [2024-11-08 16:20:56,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:20:56,516 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 212 transitions. [2024-11-08 16:20:56,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 16:20:56,517 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 212 transitions. [2024-11-08 16:20:56,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 16:20:56,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:20:56,518 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:20:56,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:20:56,520 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:20:56,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:20:56,521 INFO L85 PathProgramCache]: Analyzing trace with hash -584325352, now seen corresponding path program 1 times [2024-11-08 16:20:56,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:20:56,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313894826] [2024-11-08 16:20:56,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:20:56,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:20:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:20:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:20:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:20:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:20:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:20:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:20:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:20:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:20:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:20:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:20:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:20:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:20:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:20:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:20:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 16:20:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 16:20:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 16:20:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 16:20:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:20:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 16:20:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 16:20:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 16:20:57,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:20:57,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313894826] [2024-11-08 16:20:57,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313894826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:20:57,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:20:57,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:20:57,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614621810] [2024-11-08 16:20:57,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:20:57,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:20:57,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:20:57,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:20:57,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:20:57,662 INFO L87 Difference]: Start difference. First operand 151 states and 212 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 16:20:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:20:58,557 INFO L93 Difference]: Finished difference Result 334 states and 461 transitions. [2024-11-08 16:20:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:20:58,559 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2024-11-08 16:20:58,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:20:58,563 INFO L225 Difference]: With dead ends: 334 [2024-11-08 16:20:58,563 INFO L226 Difference]: Without dead ends: 186 [2024-11-08 16:20:58,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:20:58,565 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 102 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:20:58,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1059 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 16:20:58,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-08 16:20:58,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 136. [2024-11-08 16:20:58,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 105 states have (on average 1.3142857142857143) internal successors, (138), 106 states have internal predecessors, (138), 25 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 16:20:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 188 transitions. [2024-11-08 16:20:58,616 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 188 transitions. Word has length 144 [2024-11-08 16:20:58,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:20:58,618 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 188 transitions. [2024-11-08 16:20:58,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 16:20:58,618 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 188 transitions. [2024-11-08 16:20:58,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:20:58,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:20:58,621 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:20:58,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:20:58,622 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:20:58,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:20:58,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1162564951, now seen corresponding path program 1 times [2024-11-08 16:20:58,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:20:58,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585708938] [2024-11-08 16:20:58,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:20:58,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:20:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:20:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:20:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:20:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:20:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:20:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:20:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:20:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:20:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:20:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:20:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:20:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:20:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:20:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:20:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 16:20:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 16:20:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 16:20:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 16:20:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:20:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 16:20:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 16:20:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 16:20:59,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:20:59,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585708938] [2024-11-08 16:20:59,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585708938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:20:59,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:20:59,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:20:59,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623810751] [2024-11-08 16:20:59,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:20:59,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:20:59,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:20:59,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:20:59,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:20:59,633 INFO L87 Difference]: Start difference. First operand 136 states and 188 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 16:21:00,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:21:00,152 INFO L93 Difference]: Finished difference Result 344 states and 480 transitions. [2024-11-08 16:21:00,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:21:00,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 146 [2024-11-08 16:21:00,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:21:00,156 INFO L225 Difference]: With dead ends: 344 [2024-11-08 16:21:00,156 INFO L226 Difference]: Without dead ends: 211 [2024-11-08 16:21:00,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:21:00,158 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 41 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:21:00,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 461 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:21:00,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-08 16:21:00,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 173. [2024-11-08 16:21:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 142 states have (on average 1.380281690140845) internal successors, (196), 143 states have internal predecessors, (196), 25 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 16:21:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 246 transitions. [2024-11-08 16:21:00,196 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 246 transitions. Word has length 146 [2024-11-08 16:21:00,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:21:00,197 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 246 transitions. [2024-11-08 16:21:00,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 16:21:00,197 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 246 transitions. [2024-11-08 16:21:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:21:00,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:21:00,200 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:21:00,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:21:00,201 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:21:00,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:21:00,201 INFO L85 PathProgramCache]: Analyzing trace with hash 860799671, now seen corresponding path program 1 times [2024-11-08 16:21:00,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:21:00,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476722396] [2024-11-08 16:21:00,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:21:00,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:21:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:21:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:21:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:21:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:21:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:21:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:21:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:21:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:21:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:21:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:21:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:21:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:21:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:21:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:21:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 16:21:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 16:21:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 16:21:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 16:21:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:21:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 16:21:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 16:21:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,694 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-08 16:21:00,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:21:00,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476722396] [2024-11-08 16:21:00,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476722396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:21:00,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048085626] [2024-11-08 16:21:00,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:21:00,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:21:00,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:21:00,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:21:00,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 16:21:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:00,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 16:21:00,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:21:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 456 proven. 54 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-11-08 16:21:01,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:21:01,741 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-08 16:21:01,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048085626] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:21:01,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:21:01,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2024-11-08 16:21:01,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813237908] [2024-11-08 16:21:01,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:21:01,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:21:01,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:21:01,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:21:01,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:21:01,745 INFO L87 Difference]: Start difference. First operand 173 states and 246 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 6 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (58), 6 states have call predecessors, (58), 6 states have call successors, (58) [2024-11-08 16:21:02,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:21:02,108 INFO L93 Difference]: Finished difference Result 357 states and 500 transitions. [2024-11-08 16:21:02,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:21:02,109 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 6 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (58), 6 states have call predecessors, (58), 6 states have call successors, (58) Word has length 146 [2024-11-08 16:21:02,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:21:02,111 INFO L225 Difference]: With dead ends: 357 [2024-11-08 16:21:02,112 INFO L226 Difference]: Without dead ends: 187 [2024-11-08 16:21:02,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:21:02,113 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 153 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:21:02,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 189 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:21:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-08 16:21:02,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2024-11-08 16:21:02,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 151 states have (on average 1.3311258278145695) internal successors, (201), 152 states have internal predecessors, (201), 25 states have call successors, (25), 8 states have call predecessors, (25), 8 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 16:21:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 251 transitions. [2024-11-08 16:21:02,151 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 251 transitions. Word has length 146 [2024-11-08 16:21:02,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:21:02,152 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 251 transitions. [2024-11-08 16:21:02,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 6 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (58), 6 states have call predecessors, (58), 6 states have call successors, (58) [2024-11-08 16:21:02,152 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 251 transitions. [2024-11-08 16:21:02,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:21:02,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:21:02,154 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:21:02,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 16:21:02,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-08 16:21:02,356 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:21:02,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:21:02,357 INFO L85 PathProgramCache]: Analyzing trace with hash -419064007, now seen corresponding path program 1 times [2024-11-08 16:21:02,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:21:02,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226676857] [2024-11-08 16:21:02,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:21:02,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:21:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 16:21:02,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [827476365] [2024-11-08 16:21:02,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:21:02,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:21:02,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:21:02,501 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:21:02,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 16:21:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:21:02,792 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:21:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:21:02,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:21:02,973 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:21:02,974 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:21:03,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 16:21:03,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 16:21:03,181 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:21:03,317 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:21:03,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:21:03 BoogieIcfgContainer [2024-11-08 16:21:03,320 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:21:03,320 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:21:03,320 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:21:03,321 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:21:03,321 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:20:33" (3/4) ... [2024-11-08 16:21:03,324 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:21:03,325 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:21:03,325 INFO L158 Benchmark]: Toolchain (without parser) took 31539.32ms. Allocated memory was 184.5MB in the beginning and 408.9MB in the end (delta: 224.4MB). Free memory was 146.0MB in the beginning and 366.0MB in the end (delta: -220.0MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2024-11-08 16:21:03,326 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 130.0MB. Free memory was 95.1MB in the beginning and 95.1MB in the end (delta: 31.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:21:03,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.01ms. Allocated memory is still 184.5MB. Free memory was 145.6MB in the beginning and 130.2MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 16:21:03,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.92ms. Allocated memory is still 184.5MB. Free memory was 130.2MB in the beginning and 127.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:21:03,327 INFO L158 Benchmark]: Boogie Preprocessor took 72.00ms. Allocated memory is still 184.5MB. Free memory was 127.4MB in the beginning and 124.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:21:03,327 INFO L158 Benchmark]: RCFGBuilder took 886.12ms. Allocated memory is still 184.5MB. Free memory was 123.9MB in the beginning and 103.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 16:21:03,328 INFO L158 Benchmark]: TraceAbstraction took 29952.78ms. Allocated memory was 184.5MB in the beginning and 408.9MB in the end (delta: 224.4MB). Free memory was 102.3MB in the beginning and 367.0MB in the end (delta: -264.7MB). Peak memory consumption was 199.1MB. Max. memory is 16.1GB. [2024-11-08 16:21:03,328 INFO L158 Benchmark]: Witness Printer took 4.53ms. Allocated memory is still 408.9MB. Free memory was 367.0MB in the beginning and 366.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:21:03,330 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.46ms. Allocated memory is still 130.0MB. Free memory was 95.1MB in the beginning and 95.1MB in the end (delta: 31.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 533.01ms. Allocated memory is still 184.5MB. Free memory was 145.6MB in the beginning and 130.2MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.92ms. Allocated memory is still 184.5MB. Free memory was 130.2MB in the beginning and 127.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.00ms. Allocated memory is still 184.5MB. Free memory was 127.4MB in the beginning and 124.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 886.12ms. Allocated memory is still 184.5MB. Free memory was 123.9MB in the beginning and 103.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 29952.78ms. Allocated memory was 184.5MB in the beginning and 408.9MB in the end (delta: 224.4MB). Free memory was 102.3MB in the beginning and 367.0MB in the end (delta: -264.7MB). Peak memory consumption was 199.1MB. Max. memory is 16.1GB. * Witness Printer took 4.53ms. Allocated memory is still 408.9MB. Free memory was 367.0MB in the beginning and 366.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 125. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed char var_1_2 = 100; [L24] signed short int var_1_3 = 1; [L25] signed long int var_1_4 = -16; [L26] signed long int var_1_5 = -64; [L27] signed char var_1_6 = 10; [L28] signed char var_1_7 = 5; [L29] double var_1_8 = 16.25; [L30] double var_1_9 = 1.8; [L31] unsigned char var_1_10 = 32; [L32] unsigned char var_1_11 = 64; [L33] unsigned short int var_1_12 = 16; [L34] unsigned long int var_1_13 = 128; [L35] unsigned char var_1_15 = 1; [L36] unsigned short int var_1_16 = 256; [L37] unsigned short int var_1_17 = 8; [L38] signed char var_1_18 = -2; VAL [isInitial=0, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=100, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L129] isInitial = 1 [L130] FCALL initially() [L131] COND TRUE 1 [L132] FCALL updateLastVariables() [L133] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] var_1_3 = __VERIFIER_nondet_short() [L93] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] var_1_4 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L96] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] var_1_5 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L99] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L100] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L100] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L101] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L102] var_1_6 = __VERIFIER_nondet_char() [L103] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L103] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L104] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L104] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L105] var_1_7 = __VERIFIER_nondet_char() [L106] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L106] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L107] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L107] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L108] var_1_8 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6, var_1_9=9/5] [L109] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6, var_1_9=9/5] [L110] var_1_9 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L111] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L112] var_1_11 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L113] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L114] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L114] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L115] var_1_15 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L116] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L117] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L117] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L118] var_1_17 = __VERIFIER_nondet_ushort() [L119] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L119] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L120] CALL assume_abort_if_not(var_1_17 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L120] RET assume_abort_if_not(var_1_17 <= 65535) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L133] RET updateVariables() [L134] CALL step() [L42] EXPR var_1_2 >> var_1_3 VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L42] signed long int stepLocal_1 = var_1_2 >> var_1_3; [L43] EXPR var_1_3 << (var_1_6 - var_1_7) VAL [isInitial=1, stepLocal_1=0, var_1_10=32, var_1_11=0, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L43] signed long int stepLocal_0 = var_1_3 << (var_1_6 - var_1_7); [L44] COND FALSE !(stepLocal_1 == (var_1_4 / var_1_5)) VAL [isInitial=1, stepLocal_0=1, var_1_10=32, var_1_11=0, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L51] signed char stepLocal_2 = var_1_6; VAL [isInitial=1, stepLocal_0=1, stepLocal_2=6, var_1_10=32, var_1_11=0, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L52] COND FALSE !(stepLocal_2 <= (var_1_4 + var_1_7)) [L55] var_1_10 = (var_1_3 + var_1_7) VAL [isInitial=1, stepLocal_0=1, var_1_10=7, var_1_11=0, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L57] COND TRUE ((var_1_6 >> 2) * var_1_10) > var_1_4 [L58] var_1_12 = var_1_6 VAL [isInitial=1, stepLocal_0=1, var_1_10=7, var_1_11=0, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L60] EXPR 1 << var_1_2 VAL [isInitial=1, stepLocal_0=1, var_1_10=7, var_1_11=0, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L60] COND TRUE (1 << var_1_2) != (-500 / -100) [L61] COND FALSE !((var_1_6 - var_1_3) >= (var_1_10 + 256)) [L64] var_1_13 = var_1_12 VAL [isInitial=1, stepLocal_0=1, var_1_10=7, var_1_11=0, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L69] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L70] unsigned short int stepLocal_3 = var_1_17; VAL [isInitial=1, stepLocal_0=1, stepLocal_3=22, stepLocal_4=0, var_1_10=7, var_1_11=0, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_17=22, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L71] COND FALSE !((- var_1_9) <= var_1_8) [L84] var_1_16 = var_1_10 VAL [isInitial=1, stepLocal_0=1, stepLocal_3=22, stepLocal_4=0, var_1_10=7, var_1_11=0, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=7, var_1_17=22, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L86] var_1_18 = var_1_3 VAL [isInitial=1, stepLocal_0=1, stepLocal_3=22, stepLocal_4=0, var_1_10=7, var_1_11=0, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=7, var_1_17=22, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L134] RET step() [L135] CALL, EXPR property() [L125] EXPR var_1_2 >> var_1_3 VAL [isInitial=1, var_1_10=7, var_1_11=0, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=7, var_1_17=22, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L125] EXPR ((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, var_1_10=7, var_1_11=0, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=7, var_1_17=22, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L125] EXPR (((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, var_1_10=7, var_1_11=0, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=7, var_1_17=22, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L125] EXPR 1 << var_1_2 VAL [isInitial=1, var_1_10=7, var_1_11=0, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=7, var_1_17=22, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L125] EXPR (((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, var_1_10=7, var_1_11=0, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=7, var_1_17=22, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L125-L126] return (((((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_2) ? ((var_1_17 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=7, var_1_11=0, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=7, var_1_17=22, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] [L19] reach_error() VAL [isInitial=1, var_1_10=7, var_1_11=0, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=7, var_1_17=22, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=1, var_1_6=6, var_1_7=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.7s, OverallIterations: 10, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1356 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1354 mSDsluCounter, 4960 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3806 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2089 IncrementalHoareTripleChecker+Invalid, 2214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 1154 mSDtfsCounter, 2089 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 789 GetRequests, 720 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=9, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 279 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 18.8s InterpolantComputationTime, 1736 NumberOfCodeBlocks, 1736 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1579 ConstructedInterpolants, 0 QuantifiedInterpolants, 7585 SizeOfPredicates, 4 NumberOfNonLiveVariables, 331 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 9078/9240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 16:21:03,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX --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 a8e8864fbe413b3462ae8de456d5394de90101cbca5bf1017bcb2949274e710c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:21:06,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:21:06,179 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:21:06,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:21:06,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:21:06,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:21:06,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:21:06,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:21:06,229 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:21:06,230 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:21:06,231 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:21:06,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:21:06,232 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:21:06,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:21:06,233 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:21:06,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:21:06,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:21:06,235 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:21:06,236 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:21:06,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:21:06,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:21:06,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:21:06,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:21:06,241 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:21:06,242 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:21:06,242 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:21:06,242 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:21:06,242 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:21:06,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:21:06,243 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:21:06,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:21:06,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:21:06,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:21:06,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:21:06,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:21:06,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:21:06,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:21:06,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:21:06,248 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:21:06,248 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:21:06,248 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:21:06,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:21:06,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:21:06,249 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:21:06,249 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_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/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_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX 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 -> a8e8864fbe413b3462ae8de456d5394de90101cbca5bf1017bcb2949274e710c [2024-11-08 16:21:06,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:21:06,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:21:06,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:21:06,713 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:21:06,714 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:21:06,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i Unable to find full path for "g++" [2024-11-08 16:21:09,099 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:21:09,458 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:21:09,459 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i [2024-11-08 16:21:09,468 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/data/c5e7b99fd/d08ee7af631944939aacc822fdfff3b3/FLAGb6b01c5ff [2024-11-08 16:21:09,482 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/data/c5e7b99fd/d08ee7af631944939aacc822fdfff3b3 [2024-11-08 16:21:09,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:21:09,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:21:09,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:21:09,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:21:09,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:21:09,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:21:09" (1/1) ... [2024-11-08 16:21:09,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3078e341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:09, skipping insertion in model container [2024-11-08 16:21:09,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:21:09" (1/1) ... [2024-11-08 16:21:09,537 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:21:09,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i[916,929] [2024-11-08 16:21:09,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:21:09,852 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:21:09,865 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i[916,929] [2024-11-08 16:21:09,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:21:09,956 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:21:09,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:09 WrapperNode [2024-11-08 16:21:09,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:21:09,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:21:09,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:21:09,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:21:09,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:09" (1/1) ... [2024-11-08 16:21:09,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:09" (1/1) ... [2024-11-08 16:21:10,025 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-11-08 16:21:10,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:21:10,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:21:10,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:21:10,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:21:10,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:09" (1/1) ... [2024-11-08 16:21:10,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:09" (1/1) ... [2024-11-08 16:21:10,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:09" (1/1) ... [2024-11-08 16:21:10,072 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 16:21:10,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:09" (1/1) ... [2024-11-08 16:21:10,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:09" (1/1) ... [2024-11-08 16:21:10,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:09" (1/1) ... [2024-11-08 16:21:10,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:09" (1/1) ... [2024-11-08 16:21:10,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:09" (1/1) ... [2024-11-08 16:21:10,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:09" (1/1) ... [2024-11-08 16:21:10,108 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:21:10,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:21:10,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:21:10,113 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:21:10,113 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:09" (1/1) ... [2024-11-08 16:21:10,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:21:10,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:21:10,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:21:10,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:21:10,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:21:10,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:21:10,180 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:21:10,180 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:21:10,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:21:10,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:21:10,294 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:21:10,297 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:21:10,714 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 16:21:10,715 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:21:10,728 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:21:10,728 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:21:10,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:21:10 BoogieIcfgContainer [2024-11-08 16:21:10,729 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:21:10,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:21:10,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:21:10,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:21:10,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:21:09" (1/3) ... [2024-11-08 16:21:10,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cc699b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:21:10, skipping insertion in model container [2024-11-08 16:21:10,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:21:09" (2/3) ... [2024-11-08 16:21:10,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cc699b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:21:10, skipping insertion in model container [2024-11-08 16:21:10,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:21:10" (3/3) ... [2024-11-08 16:21:10,737 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-9.i [2024-11-08 16:21:10,752 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:21:10,753 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:21:10,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:21:10,818 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1fe70864, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:21:10,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:21:10,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 16:21:10,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 16:21:10,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:21:10,836 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:21:10,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:21:10,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:21:10,842 INFO L85 PathProgramCache]: Analyzing trace with hash -606243327, now seen corresponding path program 1 times [2024-11-08 16:21:10,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:21:10,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016769400] [2024-11-08 16:21:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:21:10,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:21:10,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:21:10,858 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:21:10,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 16:21:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:11,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 16:21:11,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:21:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-08 16:21:11,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:21:11,224 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:21:11,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016769400] [2024-11-08 16:21:11,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016769400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:21:11,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:21:11,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:21:11,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481706350] [2024-11-08 16:21:11,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:21:11,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:21:11,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:21:11,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:21:11,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:21:11,278 INFO L87 Difference]: Start difference. First operand has 64 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 16:21:11,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:21:11,327 INFO L93 Difference]: Finished difference Result 121 states and 209 transitions. [2024-11-08 16:21:11,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:21:11,330 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 133 [2024-11-08 16:21:11,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:21:11,337 INFO L225 Difference]: With dead ends: 121 [2024-11-08 16:21:11,338 INFO L226 Difference]: Without dead ends: 60 [2024-11-08 16:21:11,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:21:11,347 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:21:11,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:21:11,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-08 16:21:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-08 16:21:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 16:21:11,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2024-11-08 16:21:11,419 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 133 [2024-11-08 16:21:11,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:21:11,422 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2024-11-08 16:21:11,422 INFO L472 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 16:21:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2024-11-08 16:21:11,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 16:21:11,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:21:11,435 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:21:11,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 16:21:11,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:21:11,636 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:21:11,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:21:11,637 INFO L85 PathProgramCache]: Analyzing trace with hash -888296745, now seen corresponding path program 1 times [2024-11-08 16:21:11,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:21:11,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876464297] [2024-11-08 16:21:11,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:21:11,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:21:11,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:21:11,642 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:21:11,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b266998-7b55-4cc2-8c04-8292f37ea487/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 16:21:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:21:11,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 16:21:11,938 INFO L278 TraceCheckSpWp]: Computing forward predicates...