./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b099ead-d91b-4456-beac-ae44002852c9/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b099ead-d91b-4456-beac-ae44002852c9/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_9b099ead-d91b-4456-beac-ae44002852c9/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b099ead-d91b-4456-beac-ae44002852c9/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-82.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b099ead-d91b-4456-beac-ae44002852c9/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_9b099ead-d91b-4456-beac-ae44002852c9/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 94517564427e872c49cfdf1d666acd8c5b1d1d7f855fe0e11d067a0d3a0e2e28 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:53:24,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:53:24,425 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b099ead-d91b-4456-beac-ae44002852c9/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 18:53:24,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:53:24,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:53:24,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:53:24,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:53:24,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:53:24,462 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:53:24,462 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:53:24,463 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:53:24,463 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:53:24,464 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:53:24,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:53:24,465 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:53:24,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:53:24,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:53:24,467 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:53:24,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:53:24,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:53:24,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:53:24,469 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:53:24,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:53:24,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:53:24,470 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:53:24,471 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:53:24,471 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:53:24,472 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:53:24,475 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:53:24,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:53:24,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:53:24,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:53:24,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:53:24,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:53:24,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:53:24,482 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:53:24,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:53:24,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:53:24,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:53:24,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:53:24,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:53:24,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:53:24,487 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_9b099ead-d91b-4456-beac-ae44002852c9/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_9b099ead-d91b-4456-beac-ae44002852c9/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 -> 94517564427e872c49cfdf1d666acd8c5b1d1d7f855fe0e11d067a0d3a0e2e28 [2024-11-08 18:53:24,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:53:24,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:53:24,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:53:24,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:53:24,849 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:53:24,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b099ead-d91b-4456-beac-ae44002852c9/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-82.i Unable to find full path for "g++" [2024-11-08 18:53:27,478 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:53:27,782 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:53:27,783 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b099ead-d91b-4456-beac-ae44002852c9/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-82.i [2024-11-08 18:53:27,792 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b099ead-d91b-4456-beac-ae44002852c9/bin/uautomizer-verify-jihMAELWvX/data/108fd7707/037711fa02c64bc097768afd883c1011/FLAG58be8e3ed [2024-11-08 18:53:27,810 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b099ead-d91b-4456-beac-ae44002852c9/bin/uautomizer-verify-jihMAELWvX/data/108fd7707/037711fa02c64bc097768afd883c1011 [2024-11-08 18:53:27,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:53:27,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:53:27,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:53:27,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:53:27,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:53:27,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:53:27" (1/1) ... [2024-11-08 18:53:27,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b49845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:53:27, skipping insertion in model container [2024-11-08 18:53:27,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:53:27" (1/1) ... [2024-11-08 18:53:27,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:53:28,162 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_9b099ead-d91b-4456-beac-ae44002852c9/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-82.i[915,928] [2024-11-08 18:53:28,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:53:28,232 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:53:28,249 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_9b099ead-d91b-4456-beac-ae44002852c9/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-82.i[915,928] [2024-11-08 18:53:28,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:53:28,305 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:53:28,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:53:28 WrapperNode [2024-11-08 18:53:28,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:53:28,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:53:28,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:53:28,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:53:28,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:53:28" (1/1) ... [2024-11-08 18:53:28,330 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:53:28" (1/1) ... [2024-11-08 18:53:28,375 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2024-11-08 18:53:28,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:53:28,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:53:28,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:53:28,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:53:28,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:53:28" (1/1) ... [2024-11-08 18:53:28,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:53:28" (1/1) ... [2024-11-08 18:53:28,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:53:28" (1/1) ... [2024-11-08 18:53:28,443 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 18:53:28,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:53:28" (1/1) ... [2024-11-08 18:53:28,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:53:28" (1/1) ... [2024-11-08 18:53:28,458 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:53:28" (1/1) ... [2024-11-08 18:53:28,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:53:28" (1/1) ... [2024-11-08 18:53:28,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:53:28" (1/1) ... [2024-11-08 18:53:28,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:53:28" (1/1) ... [2024-11-08 18:53:28,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:53:28,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:53:28,487 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:53:28,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:53:28,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:53:28" (1/1) ... [2024-11-08 18:53:28,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:53:28,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b099ead-d91b-4456-beac-ae44002852c9/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:53:28,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b099ead-d91b-4456-beac-ae44002852c9/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:53:28,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b099ead-d91b-4456-beac-ae44002852c9/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:53:28,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:53:28,600 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:53:28,601 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:53:28,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:53:28,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:53:28,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:53:28,723 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:53:28,727 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:53:29,145 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 18:53:29,146 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:53:29,162 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:53:29,163 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 18:53:29,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:53:29 BoogieIcfgContainer [2024-11-08 18:53:29,163 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:53:29,167 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:53:29,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:53:29,172 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:53:29,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:53:27" (1/3) ... [2024-11-08 18:53:29,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e337724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:53:29, skipping insertion in model container [2024-11-08 18:53:29,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:53:28" (2/3) ... [2024-11-08 18:53:29,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e337724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:53:29, skipping insertion in model container [2024-11-08 18:53:29,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:53:29" (3/3) ... [2024-11-08 18:53:29,177 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-82.i [2024-11-08 18:53:29,206 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:53:29,206 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:53:29,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:53:29,297 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;@43a9a97d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:53:29,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:53:29,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:53:29,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 18:53:29,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:29,320 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:53:29,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:53:29,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:29,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1149850580, now seen corresponding path program 1 times [2024-11-08 18:53:29,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:29,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472529581] [2024-11-08 18:53:29,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:29,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:29,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 18:53:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:29,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:53:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:29,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:53:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:29,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:53:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:29,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:53:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:29,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 18:53:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:29,728 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 18:53:29,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:29,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472529581] [2024-11-08 18:53:29,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472529581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:53:29,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:53:29,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:53:29,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702511095] [2024-11-08 18:53:29,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:53:29,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:53:29,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:29,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:53:29,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:53:29,833 INFO L87 Difference]: Start difference. First operand has 46 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:53:29,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:29,868 INFO L93 Difference]: Finished difference Result 85 states and 127 transitions. [2024-11-08 18:53:29,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:53:29,871 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 51 [2024-11-08 18:53:29,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:29,879 INFO L225 Difference]: With dead ends: 85 [2024-11-08 18:53:29,879 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 18:53:29,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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 18:53:29,888 INFO L432 NwaCegarLoop]: 55 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, 55 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 18:53:29,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:53:29,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 18:53:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-08 18:53:29,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:53:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-08 18:53:29,939 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 51 [2024-11-08 18:53:29,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:29,939 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-08 18:53:29,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:53:29,940 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-08 18:53:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 18:53:29,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:29,943 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:53:29,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:53:29,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:53:29,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:29,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1757352400, now seen corresponding path program 1 times [2024-11-08 18:53:29,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:29,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672567413] [2024-11-08 18:53:29,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:29,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:30,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 18:53:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:30,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:53:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:30,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:53:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:30,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:53:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:30,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:53:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:30,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 18:53:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 18:53:30,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:30,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672567413] [2024-11-08 18:53:30,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672567413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:53:30,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:53:30,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:53:30,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404849152] [2024-11-08 18:53:30,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:53:30,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:53:30,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:30,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:53:30,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:53:30,379 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 18:53:30,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:30,500 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2024-11-08 18:53:30,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:53:30,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 51 [2024-11-08 18:53:30,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:30,503 INFO L225 Difference]: With dead ends: 90 [2024-11-08 18:53:30,503 INFO L226 Difference]: Without dead ends: 55 [2024-11-08 18:53:30,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:53:30,506 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 18 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:30,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 125 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:53:30,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-08 18:53:30,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2024-11-08 18:53:30,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:53:30,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2024-11-08 18:53:30,518 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 51 [2024-11-08 18:53:30,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:30,521 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2024-11-08 18:53:30,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 18:53:30,521 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2024-11-08 18:53:30,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 18:53:30,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:30,523 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:53:30,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:53:30,524 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:53:30,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:30,525 INFO L85 PathProgramCache]: Analyzing trace with hash 59355947, now seen corresponding path program 1 times [2024-11-08 18:53:30,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:30,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458675878] [2024-11-08 18:53:30,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:30,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:31,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 18:53:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:31,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:53:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:31,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:53:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:31,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:53:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:31,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:53:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:31,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 18:53:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:31,466 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 18:53:31,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:31,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458675878] [2024-11-08 18:53:31,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458675878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:53:31,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:53:31,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:53:31,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123254820] [2024-11-08 18:53:31,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:53:31,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:53:31,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:31,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:53:31,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:53:31,471 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 18:53:31,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:31,759 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2024-11-08 18:53:31,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:53:31,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 53 [2024-11-08 18:53:31,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:31,763 INFO L225 Difference]: With dead ends: 80 [2024-11-08 18:53:31,763 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 18:53:31,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:53:31,765 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 53 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:31,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 262 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:53:31,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 18:53:31,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 62. [2024-11-08 18:53:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.183673469387755) internal successors, (58), 50 states have internal predecessors, (58), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 18:53:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2024-11-08 18:53:31,782 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 53 [2024-11-08 18:53:31,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:31,783 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2024-11-08 18:53:31,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 18:53:31,783 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2024-11-08 18:53:31,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-08 18:53:31,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:31,785 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:53:31,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:53:31,786 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:53:31,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:31,787 INFO L85 PathProgramCache]: Analyzing trace with hash 723304227, now seen corresponding path program 1 times [2024-11-08 18:53:31,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:31,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102708898] [2024-11-08 18:53:31,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:31,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:32,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 18:53:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:32,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:53:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:32,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:53:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:32,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:53:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:32,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:53:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:32,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 18:53:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:32,730 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 18:53:32,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:32,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102708898] [2024-11-08 18:53:32,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102708898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:53:32,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:53:32,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:53:32,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433025255] [2024-11-08 18:53:32,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:53:32,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:53:32,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:32,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:53:32,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:53:32,744 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 18:53:32,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:32,950 INFO L93 Difference]: Finished difference Result 140 states and 175 transitions. [2024-11-08 18:53:32,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:53:32,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 54 [2024-11-08 18:53:32,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:32,958 INFO L225 Difference]: With dead ends: 140 [2024-11-08 18:53:32,958 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 18:53:32,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:53:32,961 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 29 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:32,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 140 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:53:32,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 18:53:32,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2024-11-08 18:53:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 18:53:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2024-11-08 18:53:32,997 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 54 [2024-11-08 18:53:32,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:32,997 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2024-11-08 18:53:32,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 18:53:32,998 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2024-11-08 18:53:32,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-08 18:53:33,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:33,000 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:53:33,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:53:33,001 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:53:33,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:33,001 INFO L85 PathProgramCache]: Analyzing trace with hash 136498213, now seen corresponding path program 1 times [2024-11-08 18:53:33,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:33,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703728589] [2024-11-08 18:53:33,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:33,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:33,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 18:53:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:33,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:53:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:33,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:53:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:33,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:53:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:33,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:53:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:33,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 18:53:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 18:53:33,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:33,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703728589] [2024-11-08 18:53:33,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703728589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:53:33,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:53:33,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:53:33,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349578895] [2024-11-08 18:53:33,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:53:33,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:53:33,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:33,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:53:33,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:53:33,443 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 18:53:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:33,712 INFO L93 Difference]: Finished difference Result 144 states and 180 transitions. [2024-11-08 18:53:33,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:53:33,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 54 [2024-11-08 18:53:33,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:33,714 INFO L225 Difference]: With dead ends: 144 [2024-11-08 18:53:33,715 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 18:53:33,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:53:33,717 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 39 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:33,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 183 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:53:33,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 18:53:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 76. [2024-11-08 18:53:33,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 18:53:33,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2024-11-08 18:53:33,733 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 95 transitions. Word has length 54 [2024-11-08 18:53:33,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:33,734 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 95 transitions. [2024-11-08 18:53:33,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 18:53:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 95 transitions. [2024-11-08 18:53:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 18:53:33,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:53:33,736 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:53:33,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:53:33,737 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:53:33,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:53:33,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1017570534, now seen corresponding path program 1 times [2024-11-08 18:53:33,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:53:33,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099014313] [2024-11-08 18:53:33,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:33,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:53:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:33,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 18:53:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:33,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:53:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:33,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:53:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:33,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:53:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:33,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:53:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:33,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 18:53:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:33,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 18:53:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:33,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:53:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:33,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 18:53:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:33,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 18:53:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:33,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 18:53:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:33,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:53:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 18:53:33,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:53:33,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099014313] [2024-11-08 18:53:33,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099014313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:53:33,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118811831] [2024-11-08 18:53:33,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:53:33,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:53:33,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b099ead-d91b-4456-beac-ae44002852c9/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:53:33,962 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b099ead-d91b-4456-beac-ae44002852c9/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:53:33,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b099ead-d91b-4456-beac-ae44002852c9/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:53:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:53:34,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 18:53:34,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:53:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-08 18:53:34,265 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:53:34,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118811831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:53:34,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:53:34,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-08 18:53:34,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305012851] [2024-11-08 18:53:34,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:53:34,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:53:34,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:53:34,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:53:34,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:53:34,271 INFO L87 Difference]: Start difference. First operand 76 states and 95 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 18:53:34,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:53:34,317 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2024-11-08 18:53:34,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:53:34,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2024-11-08 18:53:34,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:53:34,319 INFO L225 Difference]: With dead ends: 89 [2024-11-08 18:53:34,319 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 18:53:34,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:53:34,321 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 3 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:53:34,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 68 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:53:34,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 18:53:34,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 18:53:34,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:53:34,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 18:53:34,324 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2024-11-08 18:53:34,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:53:34,325 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 18:53:34,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 18:53:34,325 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 18:53:34,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 18:53:34,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:53:34,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b099ead-d91b-4456-beac-ae44002852c9/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 18:53:34,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b099ead-d91b-4456-beac-ae44002852c9/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:53:34,535 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-08 18:53:34,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 18:53:34,671 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:53:34,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:53:34 BoogieIcfgContainer [2024-11-08 18:53:34,714 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:53:34,715 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:53:34,719 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:53:34,719 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:53:34,720 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:53:29" (3/4) ... [2024-11-08 18:53:34,723 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 18:53:34,730 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-08 18:53:34,738 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-08 18:53:34,741 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 18:53:34,741 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 18:53:34,742 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 18:53:34,886 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b099ead-d91b-4456-beac-ae44002852c9/bin/uautomizer-verify-jihMAELWvX/witness.graphml [2024-11-08 18:53:34,887 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b099ead-d91b-4456-beac-ae44002852c9/bin/uautomizer-verify-jihMAELWvX/witness.yml [2024-11-08 18:53:34,887 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:53:34,888 INFO L158 Benchmark]: Toolchain (without parser) took 7073.14ms. Allocated memory was 153.1MB in the beginning and 190.8MB in the end (delta: 37.7MB). Free memory was 121.7MB in the beginning and 120.6MB in the end (delta: 1.1MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2024-11-08 18:53:34,889 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 111.1MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:53:34,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.32ms. Allocated memory is still 153.1MB. Free memory was 121.7MB in the beginning and 107.7MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 18:53:34,890 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.48ms. Allocated memory is still 153.1MB. Free memory was 107.1MB in the beginning and 105.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:53:34,890 INFO L158 Benchmark]: Boogie Preprocessor took 108.41ms. Allocated memory is still 153.1MB. Free memory was 105.0MB in the beginning and 102.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:53:34,891 INFO L158 Benchmark]: RCFGBuilder took 677.50ms. Allocated memory is still 153.1MB. Free memory was 101.4MB in the beginning and 86.1MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 18:53:34,891 INFO L158 Benchmark]: TraceAbstraction took 5547.70ms. Allocated memory was 153.1MB in the beginning and 190.8MB in the end (delta: 37.7MB). Free memory was 85.5MB in the beginning and 125.9MB in the end (delta: -40.4MB). Peak memory consumption was 256.3kB. Max. memory is 16.1GB. [2024-11-08 18:53:34,892 INFO L158 Benchmark]: Witness Printer took 172.53ms. Allocated memory is still 190.8MB. Free memory was 125.9MB in the beginning and 120.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:53:34,894 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.26ms. Allocated memory is still 111.1MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 489.32ms. Allocated memory is still 153.1MB. Free memory was 121.7MB in the beginning and 107.7MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.48ms. Allocated memory is still 153.1MB. Free memory was 107.1MB in the beginning and 105.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.41ms. Allocated memory is still 153.1MB. Free memory was 105.0MB in the beginning and 102.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 677.50ms. Allocated memory is still 153.1MB. Free memory was 101.4MB in the beginning and 86.1MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5547.70ms. Allocated memory was 153.1MB in the beginning and 190.8MB in the end (delta: 37.7MB). Free memory was 85.5MB in the beginning and 125.9MB in the end (delta: -40.4MB). Peak memory consumption was 256.3kB. Max. memory is 16.1GB. * Witness Printer took 172.53ms. Allocated memory is still 190.8MB. Free memory was 125.9MB in the beginning and 120.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 142 mSDsluCounter, 833 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 534 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 217 IncrementalHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 299 mSDtfsCounter, 217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=5, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 67 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 471 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 464 ConstructedInterpolants, 0 QuantifiedInterpolants, 856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 233 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 877/878 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 82]: Loop Invariant Derived loop invariant: (((var_1_9 == var_1_5) && (1 <= k_loop)) || (((((long long) last_1_var_1_10 + 10) <= 0) && (((long long) var_1_10 + 10) <= 0)) && (0 <= k_loop))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((((long long) last_1_var_1_10 + 10) <= 0) && (((long long) var_1_10 + 10) <= 0)) Ensures: (((((long long) last_1_var_1_10 + 10) <= 0) && (((long long) var_1_10 + 10) <= 0)) && (((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (last_1_var_1_10 == \old(last_1_var_1_10)))) RESULT: Ultimate proved your program to be correct! [2024-11-08 18:53:34,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b099ead-d91b-4456-beac-ae44002852c9/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 Writing output log to file Ultimate.log Result: TRUE