./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-86.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_ebe2b25a-150e-491a-b960-43c961ec9380/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebe2b25a-150e-491a-b960-43c961ec9380/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_ebe2b25a-150e-491a-b960-43c961ec9380/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebe2b25a-150e-491a-b960-43c961ec9380/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-86.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebe2b25a-150e-491a-b960-43c961ec9380/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_ebe2b25a-150e-491a-b960-43c961ec9380/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 2913b0b37cedaad46898416f14d6d48f794ee48dff0db1d9168d82fbaf447562 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:05:55,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:05:55,293 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebe2b25a-150e-491a-b960-43c961ec9380/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:05:55,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:05:55,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:05:55,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:05:55,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:05:55,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:05:55,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:05:55,332 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:05:55,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:05:55,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:05:55,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:05:55,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:05:55,335 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:05:55,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:05:55,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:05:55,336 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:05:55,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:05:55,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:05:55,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:05:55,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:05:55,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:05:55,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:05:55,342 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:05:55,342 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:05:55,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:05:55,343 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:05:55,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:05:55,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:05:55,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:05:55,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:05:55,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:05:55,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:05:55,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:05:55,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:05:55,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:05:55,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:05:55,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:05:55,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:05:55,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:05:55,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:05:55,350 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_ebe2b25a-150e-491a-b960-43c961ec9380/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_ebe2b25a-150e-491a-b960-43c961ec9380/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 -> 2913b0b37cedaad46898416f14d6d48f794ee48dff0db1d9168d82fbaf447562 [2024-11-08 16:05:55,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:05:55,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:05:55,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:05:55,626 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:05:55,626 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:05:55,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebe2b25a-150e-491a-b960-43c961ec9380/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-86.i Unable to find full path for "g++" [2024-11-08 16:05:57,567 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:05:57,760 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:05:57,761 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebe2b25a-150e-491a-b960-43c961ec9380/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-86.i [2024-11-08 16:05:57,769 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebe2b25a-150e-491a-b960-43c961ec9380/bin/uautomizer-verify-jihMAELWvX/data/86dada382/3ce42cee1b3e4cc4a617d4ab60f55df1/FLAGc4ae6f317 [2024-11-08 16:05:58,138 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebe2b25a-150e-491a-b960-43c961ec9380/bin/uautomizer-verify-jihMAELWvX/data/86dada382/3ce42cee1b3e4cc4a617d4ab60f55df1 [2024-11-08 16:05:58,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:05:58,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:05:58,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:05:58,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:05:58,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:05:58,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:05:58" (1/1) ... [2024-11-08 16:05:58,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55314521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:58, skipping insertion in model container [2024-11-08 16:05:58,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:05:58" (1/1) ... [2024-11-08 16:05:58,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:05:58,345 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_ebe2b25a-150e-491a-b960-43c961ec9380/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-86.i[915,928] [2024-11-08 16:05:58,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:05:58,407 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:05:58,420 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_ebe2b25a-150e-491a-b960-43c961ec9380/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-86.i[915,928] [2024-11-08 16:05:58,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:05:58,465 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:05:58,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:58 WrapperNode [2024-11-08 16:05:58,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:05:58,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:05:58,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:05:58,466 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:05:58,474 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:05:58" (1/1) ... [2024-11-08 16:05:58,483 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:05:58" (1/1) ... [2024-11-08 16:05:58,526 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2024-11-08 16:05:58,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:05:58,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:05:58,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:05:58,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:05:58,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:58" (1/1) ... [2024-11-08 16:05:58,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:58" (1/1) ... [2024-11-08 16:05:58,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:58" (1/1) ... [2024-11-08 16:05:58,579 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:05:58,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:58" (1/1) ... [2024-11-08 16:05:58,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:58" (1/1) ... [2024-11-08 16:05:58,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:58" (1/1) ... [2024-11-08 16:05:58,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:58" (1/1) ... [2024-11-08 16:05:58,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:58" (1/1) ... [2024-11-08 16:05:58,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:58" (1/1) ... [2024-11-08 16:05:58,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:05:58,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:05:58,617 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:05:58,617 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:05:58,618 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:58" (1/1) ... [2024-11-08 16:05:58,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:05:58,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebe2b25a-150e-491a-b960-43c961ec9380/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:05:58,654 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebe2b25a-150e-491a-b960-43c961ec9380/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:05:58,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebe2b25a-150e-491a-b960-43c961ec9380/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:05:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:05:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:05:58,687 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:05:58,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:05:58,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:05:58,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:05:58,777 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:05:58,781 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:05:59,189 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 16:05:59,190 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:05:59,233 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:05:59,233 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:05:59,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:05:59 BoogieIcfgContainer [2024-11-08 16:05:59,234 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:05:59,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:05:59,240 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:05:59,244 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:05:59,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:05:58" (1/3) ... [2024-11-08 16:05:59,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3952daa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:05:59, skipping insertion in model container [2024-11-08 16:05:59,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:58" (2/3) ... [2024-11-08 16:05:59,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3952daa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:05:59, skipping insertion in model container [2024-11-08 16:05:59,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:05:59" (3/3) ... [2024-11-08 16:05:59,247 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-86.i [2024-11-08 16:05:59,283 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:05:59,283 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:05:59,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:05:59,353 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;@1f33169c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:05:59,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:05:59,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 16:05:59,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 16:05:59,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:05:59,369 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:59,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:05:59,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:05:59,376 INFO L85 PathProgramCache]: Analyzing trace with hash 597898115, now seen corresponding path program 1 times [2024-11-08 16:05:59,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:05:59,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197051294] [2024-11-08 16:05:59,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:05:59,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:05:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:59,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:05:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:59,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:05:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:59,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:05:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:59,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:05:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:59,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 16:05:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:59,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:05:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:59,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 16:05:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:59,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:05:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:59,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:05:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:59,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:05:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:59,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:05:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:59,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:05:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:59,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:05:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:59,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:05:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:59,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 16:05:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:59,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 16:05:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:59,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:05:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:59,770 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:05:59,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:05:59,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197051294] [2024-11-08 16:05:59,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197051294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:05:59,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:05:59,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:05:59,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233484347] [2024-11-08 16:05:59,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:05:59,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:05:59,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:05:59,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:05:59,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:05:59,805 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 16:05:59,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:05:59,835 INFO L93 Difference]: Finished difference Result 95 states and 161 transitions. [2024-11-08 16:05:59,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:05:59,837 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2024-11-08 16:05:59,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:05:59,845 INFO L225 Difference]: With dead ends: 95 [2024-11-08 16:05:59,846 INFO L226 Difference]: Without dead ends: 47 [2024-11-08 16:05:59,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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:05:59,852 INFO L432 NwaCegarLoop]: 68 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, 68 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:05:59,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:05:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-08 16:05:59,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-08 16:05:59,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 16:05:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2024-11-08 16:05:59,898 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 108 [2024-11-08 16:05:59,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:05:59,899 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2024-11-08 16:05:59,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 16:05:59,899 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2024-11-08 16:05:59,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 16:05:59,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:05:59,903 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:59,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:05:59,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:05:59,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:05:59,904 INFO L85 PathProgramCache]: Analyzing trace with hash -66351295, now seen corresponding path program 1 times [2024-11-08 16:05:59,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:05:59,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061830927] [2024-11-08 16:05:59,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:05:59,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:06:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:05,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:06:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:05,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:06:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:05,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:06:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:05,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:06:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:05,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 16:06:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:05,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:06:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:05,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 16:06:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:05,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:06:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:05,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:06:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:05,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:06:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:05,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:06:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:05,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:06:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:05,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:06:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:05,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:06:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:05,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 16:06:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:05,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 16:06:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:05,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:06:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:06:05,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:06:05,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061830927] [2024-11-08 16:06:05,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061830927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:06:05,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:06:05,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:06:05,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83424310] [2024-11-08 16:06:05,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:06:05,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:06:05,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:06:05,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:06:05,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:06:05,776 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:06:06,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:06:06,475 INFO L93 Difference]: Finished difference Result 71 states and 98 transitions. [2024-11-08 16:06:06,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:06:06,476 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-11-08 16:06:06,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:06:06,480 INFO L225 Difference]: With dead ends: 71 [2024-11-08 16:06:06,480 INFO L226 Difference]: Without dead ends: 69 [2024-11-08 16:06:06,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:06:06,483 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 25 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:06:06,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 249 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:06:06,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-08 16:06:06,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2024-11-08 16:06:06,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 16:06:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2024-11-08 16:06:06,495 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 108 [2024-11-08 16:06:06,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:06:06,496 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2024-11-08 16:06:06,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:06:06,497 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2024-11-08 16:06:06,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 16:06:06,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:06:06,499 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:06,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:06:06,499 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:06:06,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:06:06,500 INFO L85 PathProgramCache]: Analyzing trace with hash -459378305, now seen corresponding path program 1 times [2024-11-08 16:06:06,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:06:06,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757012921] [2024-11-08 16:06:06,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:06:06,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:06:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:06,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:06:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:06,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:06:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:06,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:06:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:06,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:06:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:06,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 16:06:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:06,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:06:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:06,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 16:06:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:06,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:06:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:06,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:06:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:06,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:06:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:06,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:06:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:06,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:06:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:06,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:06:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:06,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:06:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:06,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 16:06:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:06,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 16:06:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:06,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:06:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:06:06,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:06:06,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757012921] [2024-11-08 16:06:06,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757012921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:06:06,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:06:06,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:06:06,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927035612] [2024-11-08 16:06:06,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:06:06,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:06:06,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:06:06,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:06:06,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:06:06,788 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:06:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:06:06,830 INFO L93 Difference]: Finished difference Result 151 states and 220 transitions. [2024-11-08 16:06:06,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:06:06,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-11-08 16:06:06,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:06:06,833 INFO L225 Difference]: With dead ends: 151 [2024-11-08 16:06:06,833 INFO L226 Difference]: Without dead ends: 99 [2024-11-08 16:06:06,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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:06:06,838 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 32 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:06:06,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 136 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:06:06,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-08 16:06:06,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-08 16:06:06,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 16:06:06,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2024-11-08 16:06:06,879 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 108 [2024-11-08 16:06:06,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:06:06,880 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2024-11-08 16:06:06,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:06:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2024-11-08 16:06:06,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 16:06:06,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:06:06,882 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:06,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:06:06,883 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:06:06,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:06:06,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2060581629, now seen corresponding path program 1 times [2024-11-08 16:06:06,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:06:06,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689026373] [2024-11-08 16:06:06,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:06:06,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:06:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:08,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:06:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:08,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:06:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:08,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:06:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:08,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:06:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:08,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 16:06:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:08,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:06:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:08,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 16:06:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:08,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:06:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:08,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:06:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:08,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:06:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:08,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:06:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:08,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:06:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:08,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:06:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:08,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:06:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:08,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 16:06:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:08,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 16:06:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:08,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:06:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:06:08,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:06:08,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689026373] [2024-11-08 16:06:08,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689026373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:06:08,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:06:08,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:06:08,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732045000] [2024-11-08 16:06:08,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:06:08,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:06:08,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:06:08,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:06:08,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:06:08,465 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:06:09,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:06:09,111 INFO L93 Difference]: Finished difference Result 118 states and 166 transitions. [2024-11-08 16:06:09,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:06:09,111 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-11-08 16:06:09,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:06:09,113 INFO L225 Difference]: With dead ends: 118 [2024-11-08 16:06:09,113 INFO L226 Difference]: Without dead ends: 116 [2024-11-08 16:06:09,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:06:09,115 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 19 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:06:09,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 420 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:06:09,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-08 16:06:09,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2024-11-08 16:06:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 62 states have internal predecessors, (76), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 16:06:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 144 transitions. [2024-11-08 16:06:09,145 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 144 transitions. Word has length 108 [2024-11-08 16:06:09,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:06:09,146 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 144 transitions. [2024-11-08 16:06:09,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:06:09,147 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 144 transitions. [2024-11-08 16:06:09,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:06:09,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:06:09,149 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:09,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:06:09,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:06:09,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:06:09,153 INFO L85 PathProgramCache]: Analyzing trace with hash -42884880, now seen corresponding path program 1 times [2024-11-08 16:06:09,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:06:09,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873208563] [2024-11-08 16:06:09,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:06:09,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:06:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:11,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:06:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:11,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:06:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:11,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:06:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:11,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:06:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:11,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 16:06:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:11,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:06:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:11,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 16:06:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:11,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:06:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:11,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:06:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:11,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:06:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:11,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:06:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:11,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:06:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:11,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:06:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:11,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:06:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:11,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 16:06:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:11,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 16:06:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:11,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:06:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:11,377 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:06:11,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:06:11,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873208563] [2024-11-08 16:06:11,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873208563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:06:11,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:06:11,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:06:11,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320522206] [2024-11-08 16:06:11,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:06:11,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:06:11,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:06:11,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:06:11,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:06:11,381 INFO L87 Difference]: Start difference. First operand 99 states and 144 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:06:12,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:06:12,452 INFO L93 Difference]: Finished difference Result 238 states and 341 transitions. [2024-11-08 16:06:12,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:06:12,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-08 16:06:12,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:06:12,454 INFO L225 Difference]: With dead ends: 238 [2024-11-08 16:06:12,454 INFO L226 Difference]: Without dead ends: 184 [2024-11-08 16:06:12,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:06:12,460 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 101 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:06:12,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 277 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 16:06:12,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-08 16:06:12,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 177. [2024-11-08 16:06:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 106 states have (on average 1.179245283018868) internal successors, (125), 109 states have internal predecessors, (125), 65 states have call successors, (65), 5 states have call predecessors, (65), 5 states have return successors, (65), 62 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-08 16:06:12,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 255 transitions. [2024-11-08 16:06:12,519 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 255 transitions. Word has length 109 [2024-11-08 16:06:12,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:06:12,520 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 255 transitions. [2024-11-08 16:06:12,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:06:12,520 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 255 transitions. [2024-11-08 16:06:12,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:06:12,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:06:12,522 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:12,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:06:12,522 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:06:12,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:06:12,523 INFO L85 PathProgramCache]: Analyzing trace with hash -41037838, now seen corresponding path program 1 times [2024-11-08 16:06:12,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:06:12,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745701593] [2024-11-08 16:06:12,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:06:12,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:06:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:15,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:06:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:15,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:06:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:15,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:06:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:15,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:06:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:15,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 16:06:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:15,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:06:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:15,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 16:06:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:15,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:06:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:15,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:06:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:15,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:06:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:15,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:06:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:15,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:06:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:15,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:06:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:15,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:06:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:15,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 16:06:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:15,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 16:06:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:15,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:06:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:06:15,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:06:15,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745701593] [2024-11-08 16:06:15,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745701593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:06:15,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:06:15,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:06:15,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467899152] [2024-11-08 16:06:15,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:06:15,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:06:15,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:06:15,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:06:15,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:06:15,896 INFO L87 Difference]: Start difference. First operand 177 states and 255 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:06:16,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:06:16,655 INFO L93 Difference]: Finished difference Result 292 states and 418 transitions. [2024-11-08 16:06:16,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:06:16,656 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-08 16:06:16,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:06:16,659 INFO L225 Difference]: With dead ends: 292 [2024-11-08 16:06:16,659 INFO L226 Difference]: Without dead ends: 181 [2024-11-08 16:06:16,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:06:16,661 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 28 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:06:16,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 334 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:06:16,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-08 16:06:16,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2024-11-08 16:06:16,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 109 states have internal predecessors, (123), 65 states have call successors, (65), 5 states have call predecessors, (65), 5 states have return successors, (65), 62 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-08 16:06:16,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 253 transitions. [2024-11-08 16:06:16,701 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 253 transitions. Word has length 109 [2024-11-08 16:06:16,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:06:16,703 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 253 transitions. [2024-11-08 16:06:16,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:06:16,704 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 253 transitions. [2024-11-08 16:06:16,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:06:16,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:06:16,708 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:16,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:06:16,709 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:06:16,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:06:16,709 INFO L85 PathProgramCache]: Analyzing trace with hash -852231506, now seen corresponding path program 1 times [2024-11-08 16:06:16,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:06:16,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239886272] [2024-11-08 16:06:16,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:06:16,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:06:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:16,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:06:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:16,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:06:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:16,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:06:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:16,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:06:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:16,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 16:06:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:16,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:06:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:16,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 16:06:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:16,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:06:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:16,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:06:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:16,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:06:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:16,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:06:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:16,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:06:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:16,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:06:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:16,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:06:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:16,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 16:06:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:16,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 16:06:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:16,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:06:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:16,814 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:06:16,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:06:16,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239886272] [2024-11-08 16:06:16,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239886272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:06:16,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:06:16,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:06:16,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251283796] [2024-11-08 16:06:16,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:06:16,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:06:16,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:06:16,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:06:16,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:06:16,817 INFO L87 Difference]: Start difference. First operand 177 states and 253 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:06:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:06:16,871 INFO L93 Difference]: Finished difference Result 354 states and 507 transitions. [2024-11-08 16:06:16,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:06:16,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-08 16:06:16,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:06:16,875 INFO L225 Difference]: With dead ends: 354 [2024-11-08 16:06:16,875 INFO L226 Difference]: Without dead ends: 243 [2024-11-08 16:06:16,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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:06:16,878 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 62 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:06:16,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 136 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:06:16,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-08 16:06:16,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 178. [2024-11-08 16:06:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 107 states have (on average 1.1495327102803738) internal successors, (123), 110 states have internal predecessors, (123), 65 states have call successors, (65), 5 states have call predecessors, (65), 5 states have return successors, (65), 62 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-08 16:06:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 253 transitions. [2024-11-08 16:06:16,924 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 253 transitions. Word has length 109 [2024-11-08 16:06:16,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:06:16,925 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 253 transitions. [2024-11-08 16:06:16,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:06:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 253 transitions. [2024-11-08 16:06:16,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:06:16,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:06:16,929 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:16,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:06:16,930 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:06:16,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:06:16,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1667728428, now seen corresponding path program 1 times [2024-11-08 16:06:16,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:06:16,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500982232] [2024-11-08 16:06:16,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:06:16,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:06:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:17,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:06:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:17,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:06:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:17,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:06:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:17,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:06:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:17,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 16:06:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:17,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:06:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:17,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 16:06:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:17,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:06:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:17,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:06:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:17,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:06:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:17,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:06:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:17,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:06:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:17,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:06:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:17,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:06:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:17,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 16:06:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:17,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 16:06:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:17,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:06:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:17,702 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:06:17,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:06:17,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500982232] [2024-11-08 16:06:17,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500982232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:06:17,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:06:17,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:06:17,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503975773] [2024-11-08 16:06:17,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:06:17,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:06:17,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:06:17,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:06:17,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:06:17,704 INFO L87 Difference]: Start difference. First operand 178 states and 253 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 16:06:17,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:06:17,978 INFO L93 Difference]: Finished difference Result 610 states and 868 transitions. [2024-11-08 16:06:17,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:06:17,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 109 [2024-11-08 16:06:17,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:06:17,982 INFO L225 Difference]: With dead ends: 610 [2024-11-08 16:06:17,982 INFO L226 Difference]: Without dead ends: 435 [2024-11-08 16:06:17,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:06:17,984 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 95 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:06:17,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 158 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:06:17,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-08 16:06:18,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 329. [2024-11-08 16:06:18,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 198 states have (on average 1.1414141414141414) internal successors, (226), 203 states have internal predecessors, (226), 121 states have call successors, (121), 9 states have call predecessors, (121), 9 states have return successors, (121), 116 states have call predecessors, (121), 121 states have call successors, (121) [2024-11-08 16:06:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 468 transitions. [2024-11-08 16:06:18,053 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 468 transitions. Word has length 109 [2024-11-08 16:06:18,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:06:18,054 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 468 transitions. [2024-11-08 16:06:18,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 16:06:18,054 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 468 transitions. [2024-11-08 16:06:18,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:06:18,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:06:18,055 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:18,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:06:18,056 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:06:18,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:06:18,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1669575470, now seen corresponding path program 1 times [2024-11-08 16:06:18,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:06:18,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606712598] [2024-11-08 16:06:18,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:06:18,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:06:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:18,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:06:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:18,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:06:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:18,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:06:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:18,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:06:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:18,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 16:06:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:18,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:06:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:18,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 16:06:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:18,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:06:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:18,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:06:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:18,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:06:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:18,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:06:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:18,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:06:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:18,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:06:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:18,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:06:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:18,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 16:06:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:18,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 16:06:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:18,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:06:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:06:18,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:06:18,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606712598] [2024-11-08 16:06:18,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606712598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:06:18,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:06:18,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:06:18,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316787228] [2024-11-08 16:06:18,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:06:18,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:06:18,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:06:18,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:06:18,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:06:18,715 INFO L87 Difference]: Start difference. First operand 329 states and 468 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:06:19,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:06:19,210 INFO L93 Difference]: Finished difference Result 454 states and 637 transitions. [2024-11-08 16:06:19,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:06:19,210 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-08 16:06:19,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:06:19,214 INFO L225 Difference]: With dead ends: 454 [2024-11-08 16:06:19,214 INFO L226 Difference]: Without dead ends: 452 [2024-11-08 16:06:19,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:06:19,215 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 147 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:06:19,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 425 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:06:19,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-08 16:06:19,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 406. [2024-11-08 16:06:19,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 231 states have (on average 1.1082251082251082) internal successors, (256), 238 states have internal predecessors, (256), 159 states have call successors, (159), 15 states have call predecessors, (159), 15 states have return successors, (159), 152 states have call predecessors, (159), 159 states have call successors, (159) [2024-11-08 16:06:19,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 574 transitions. [2024-11-08 16:06:19,317 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 574 transitions. Word has length 109 [2024-11-08 16:06:19,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:06:19,319 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 574 transitions. [2024-11-08 16:06:19,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:06:19,319 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 574 transitions. [2024-11-08 16:06:19,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 16:06:19,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:06:19,323 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 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, 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] [2024-11-08 16:06:19,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:06:19,323 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:06:19,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:06:19,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1251218846, now seen corresponding path program 1 times [2024-11-08 16:06:19,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:06:19,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309207505] [2024-11-08 16:06:19,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:06:19,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:06:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:06:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:06:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:06:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:06:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 16:06:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:06:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 16:06:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:06:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:06:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:06:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:06:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:06:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:06:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:06:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 16:06:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 16:06:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:06:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 16:06:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 16:06:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 16:06:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 16:06:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:06:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 16:06:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 16:06:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 16:06:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 16:06:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 16:06:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 16:06:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 16:06:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 16:06:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 16:06:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-08 16:06:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-08 16:06:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-08 16:06:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:06:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2271 trivial. 0 not checked. [2024-11-08 16:06:22,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:06:22,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309207505] [2024-11-08 16:06:22,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309207505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:06:22,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:06:22,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:06:22,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252817059] [2024-11-08 16:06:22,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:06:22,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:06:22,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:06:22,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:06:22,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:06:22,382 INFO L87 Difference]: Start difference. First operand 406 states and 574 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:06:23,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:06:23,106 INFO L93 Difference]: Finished difference Result 407 states and 575 transitions. [2024-11-08 16:06:23,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:06:23,107 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 213 [2024-11-08 16:06:23,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:06:23,108 INFO L225 Difference]: With dead ends: 407 [2024-11-08 16:06:23,108 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 16:06:23,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:06:23,110 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 31 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:06:23,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 235 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:06:23,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 16:06:23,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 16:06:23,111 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 16:06:23,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 16:06:23,111 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 213 [2024-11-08 16:06:23,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:06:23,112 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 16:06:23,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:06:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 16:06:23,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 16:06:23,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:06:23,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 16:06:23,118 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:06:23,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 16:06:24,919 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:06:24,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:06:24 BoogieIcfgContainer [2024-11-08 16:06:24,948 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:06:24,948 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:06:24,948 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:06:24,948 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:06:24,949 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:05:59" (3/4) ... [2024-11-08 16:06:24,951 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 16:06:24,956 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-08 16:06:24,961 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-08 16:06:24,961 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 16:06:24,962 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 16:06:24,962 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 16:06:25,070 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebe2b25a-150e-491a-b960-43c961ec9380/bin/uautomizer-verify-jihMAELWvX/witness.graphml [2024-11-08 16:06:25,071 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebe2b25a-150e-491a-b960-43c961ec9380/bin/uautomizer-verify-jihMAELWvX/witness.yml [2024-11-08 16:06:25,071 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:06:25,072 INFO L158 Benchmark]: Toolchain (without parser) took 26929.82ms. Allocated memory was 157.3MB in the beginning and 333.4MB in the end (delta: 176.2MB). Free memory was 118.8MB in the beginning and 249.0MB in the end (delta: -130.3MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. [2024-11-08 16:06:25,072 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 123.7MB. Free memory is still 68.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:06:25,072 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.26ms. Allocated memory is still 157.3MB. Free memory was 118.3MB in the beginning and 104.1MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 16:06:25,072 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.09ms. Allocated memory is still 157.3MB. Free memory was 104.1MB in the beginning and 100.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:06:25,073 INFO L158 Benchmark]: Boogie Preprocessor took 88.09ms. Allocated memory is still 157.3MB. Free memory was 100.5MB in the beginning and 95.1MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:06:25,073 INFO L158 Benchmark]: RCFGBuilder took 617.73ms. Allocated memory is still 157.3MB. Free memory was 95.1MB in the beginning and 126.1MB in the end (delta: -30.9MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-11-08 16:06:25,073 INFO L158 Benchmark]: TraceAbstraction took 25710.74ms. Allocated memory was 157.3MB in the beginning and 333.4MB in the end (delta: 176.2MB). Free memory was 125.4MB in the beginning and 255.3MB in the end (delta: -130.0MB). Peak memory consumption was 199.6MB. Max. memory is 16.1GB. [2024-11-08 16:06:25,074 INFO L158 Benchmark]: Witness Printer took 122.85ms. Allocated memory is still 333.4MB. Free memory was 255.3MB in the beginning and 249.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 16:06:25,078 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 123.7MB. Free memory is still 68.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.26ms. Allocated memory is still 157.3MB. Free memory was 118.3MB in the beginning and 104.1MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.09ms. Allocated memory is still 157.3MB. Free memory was 104.1MB in the beginning and 100.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.09ms. Allocated memory is still 157.3MB. Free memory was 100.5MB in the beginning and 95.1MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 617.73ms. Allocated memory is still 157.3MB. Free memory was 95.1MB in the beginning and 126.1MB in the end (delta: -30.9MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 25710.74ms. Allocated memory was 157.3MB in the beginning and 333.4MB in the end (delta: 176.2MB). Free memory was 125.4MB in the beginning and 255.3MB in the end (delta: -130.0MB). Peak memory consumption was 199.6MB. Max. memory is 16.1GB. * Witness Printer took 122.85ms. Allocated memory is still 333.4MB. Free memory was 255.3MB in the beginning and 249.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.8s, OverallIterations: 10, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 540 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 540 mSDsluCounter, 2438 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1704 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1007 IncrementalHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 734 mSDtfsCounter, 1007 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 480 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=406occurred in iteration=9, InterpolantAutomatonStates: 65, 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, 10 MinimizatonAttempts, 261 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 1190 NumberOfCodeBlocks, 1190 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1180 ConstructedInterpolants, 0 QuantifiedInterpolants, 4783 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 7176/7176 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: 95]: Loop Invariant Derived loop invariant: ((((((var_1_18 <= 0) && (var_1_7 == 4)) && (var_1_16 == 0)) && (((4294967295 + var_1_13) % 4294967296) <= 4294967294)) && (0 <= 0)) || ((((((0 < var_1_7) || (var_1_12 == 0)) || (0 < (((var_1_7 * 4294967295) + var_1_13) % 4294967296))) && (var_1_7 == var_1_1)) && ((((((var_1_7 == var_1_11) || (var_1_9 < ((((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10) + 1))) || (var_1_16 == 0)) && (((((0 < (var_1_3 + 1)) || (var_1_7 == var_1_11)) || (var_1_16 == 0)) || (0 < ((long long) var_1_8 + 1))) || (((var_1_3 >= 0) ? (var_1_3 % var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 % var_1_8) + var_1_8) : ((var_1_3 % var_1_8) - var_1_8))) == 0))) && ((((var_1_7 == var_1_11) || (var_1_16 == 0)) || (((long long) var_1_9 + 1) == (((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10))) || (((var_1_3 + 1) <= 0) && (((var_1_3 >= 0) ? (var_1_3 % var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 % var_1_8) + var_1_8) : ((var_1_3 % var_1_8) - var_1_8))) != 0)))) || (((long long) var_1_9 + 1) < (((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10)))) && ((var_1_18 == var_1_16) || (var_1_13 < (((((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) >= 0) ? (((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) % 4294967296) : ((((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) % 4294967296) + 4294967296)) + 1))))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (last_1_var_1_1 == \old(last_1_var_1_1))) RESULT: Ultimate proved your program to be correct! [2024-11-08 16:06:25,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebe2b25a-150e-491a-b960-43c961ec9380/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