./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --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 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 12:06:37,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:06:37,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:06:37,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:06:37,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:06:37,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:06:37,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:06:37,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:06:37,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:06:37,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:06:37,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:06:37,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:06:37,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:06:37,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:06:37,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:06:37,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:06:37,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:06:37,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:06:37,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:06:37,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:06:37,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:06:37,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:06:37,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:06:37,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:06:37,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:06:37,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:06:37,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:06:37,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:06:37,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:06:37,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:06:37,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:06:37,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:06:37,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:06:37,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:06:37,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:06:37,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:06:37,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:06:37,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:06:37,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:06:37,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:06:37,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:06:37,372 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:06:37,399 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:06:37,400 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:06:37,400 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:06:37,400 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:06:37,401 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:06:37,402 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:06:37,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:06:37,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:06:37,403 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:06:37,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:06:37,404 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:06:37,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:06:37,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:06:37,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:06:37,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:06:37,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:06:37,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:06:37,406 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:06:37,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:06:37,406 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:06:37,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:06:37,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:06:37,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:06:37,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:06:37,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:06:37,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:06:37,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:06:37,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:06:37,409 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:06:37,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:06:37,409 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:06:37,409 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:06:37,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:06:37,410 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/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_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 [2022-11-20 12:06:37,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:06:37,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:06:37,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:06:37,763 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:06:37,763 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:06:37,765 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/loop-invgen/heapsort.i [2022-11-20 12:06:40,969 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:06:41,196 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:06:41,197 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/sv-benchmarks/c/loop-invgen/heapsort.i [2022-11-20 12:06:41,203 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/data/db35b945a/6d10dbc2065a4bc78ec96f19028ef6f9/FLAGa224d455f [2022-11-20 12:06:41,217 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/data/db35b945a/6d10dbc2065a4bc78ec96f19028ef6f9 [2022-11-20 12:06:41,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:06:41,222 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:06:41,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:06:41,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:06:41,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:06:41,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:06:41" (1/1) ... [2022-11-20 12:06:41,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@527ae2e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:41, skipping insertion in model container [2022-11-20 12:06:41,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:06:41" (1/1) ... [2022-11-20 12:06:41,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:06:41,272 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:06:41,442 WARN L237 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_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2022-11-20 12:06:41,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:06:41,503 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:06:41,526 WARN L237 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_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2022-11-20 12:06:41,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:06:41,562 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:06:41,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:41 WrapperNode [2022-11-20 12:06:41,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:06:41,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:06:41,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:06:41,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:06:41,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:41" (1/1) ... [2022-11-20 12:06:41,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:41" (1/1) ... [2022-11-20 12:06:41,609 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2022-11-20 12:06:41,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:06:41,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:06:41,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:06:41,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:06:41,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:41" (1/1) ... [2022-11-20 12:06:41,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:41" (1/1) ... [2022-11-20 12:06:41,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:41" (1/1) ... [2022-11-20 12:06:41,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:41" (1/1) ... [2022-11-20 12:06:41,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:41" (1/1) ... [2022-11-20 12:06:41,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:41" (1/1) ... [2022-11-20 12:06:41,633 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:41" (1/1) ... [2022-11-20 12:06:41,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:41" (1/1) ... [2022-11-20 12:06:41,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:06:41,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:06:41,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:06:41,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:06:41,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:41" (1/1) ... [2022-11-20 12:06:41,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:06:41,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:06:41,676 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:06:41,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:06:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:06:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:06:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:06:41,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:06:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-20 12:06:41,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-20 12:06:41,822 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:06:41,824 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:06:42,061 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:06:42,068 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:06:42,068 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 12:06:42,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:06:42 BoogieIcfgContainer [2022-11-20 12:06:42,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:06:42,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:06:42,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:06:42,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:06:42,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:06:41" (1/3) ... [2022-11-20 12:06:42,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ffb0fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:06:42, skipping insertion in model container [2022-11-20 12:06:42,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:06:41" (2/3) ... [2022-11-20 12:06:42,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ffb0fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:06:42, skipping insertion in model container [2022-11-20 12:06:42,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:06:42" (3/3) ... [2022-11-20 12:06:42,118 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort.i [2022-11-20 12:06:42,157 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:06:42,163 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 12:06:42,250 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:06:42,262 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@d6675df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:06:42,263 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 12:06:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-20 12:06:42,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 12:06:42,280 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:06:42,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:06:42,282 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:06:42,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:42,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1754201352, now seen corresponding path program 1 times [2022-11-20 12:06:42,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:42,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613263229] [2022-11-20 12:06:42,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:42,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:06:42,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:42,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613263229] [2022-11-20 12:06:42,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613263229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:42,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:06:42,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:06:42,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896287778] [2022-11-20 12:06:42,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:42,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:06:42,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:42,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:06:42,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:06:42,827 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:43,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:06:43,103 INFO L93 Difference]: Finished difference Result 104 states and 193 transitions. [2022-11-20 12:06:43,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:06:43,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 12:06:43,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:06:43,122 INFO L225 Difference]: With dead ends: 104 [2022-11-20 12:06:43,123 INFO L226 Difference]: Without dead ends: 61 [2022-11-20 12:06:43,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:06:43,133 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 25 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:06:43,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 220 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:06:43,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-20 12:06:43,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2022-11-20 12:06:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-20 12:06:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2022-11-20 12:06:43,210 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 11 [2022-11-20 12:06:43,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:06:43,211 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 57 transitions. [2022-11-20 12:06:43,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2022-11-20 12:06:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 12:06:43,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:06:43,215 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:06:43,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:06:43,216 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:06:43,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:43,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1749464583, now seen corresponding path program 1 times [2022-11-20 12:06:43,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:43,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306500951] [2022-11-20 12:06:43,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:43,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:43,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:06:43,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:43,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306500951] [2022-11-20 12:06:43,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306500951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:43,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:06:43,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:06:43,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370920053] [2022-11-20 12:06:43,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:43,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:06:43,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:43,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:06:43,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:06:43,444 INFO L87 Difference]: Start difference. First operand 39 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:06:43,530 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-11-20 12:06:43,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:06:43,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 12:06:43,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:06:43,532 INFO L225 Difference]: With dead ends: 46 [2022-11-20 12:06:43,533 INFO L226 Difference]: Without dead ends: 44 [2022-11-20 12:06:43,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:06:43,535 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:06:43,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 137 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:06:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-20 12:06:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-11-20 12:06:43,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-20 12:06:43,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2022-11-20 12:06:43,547 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 11 [2022-11-20 12:06:43,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:06:43,548 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2022-11-20 12:06:43,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:43,548 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2022-11-20 12:06:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 12:06:43,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:06:43,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:06:43,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:06:43,550 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:06:43,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:43,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1728015063, now seen corresponding path program 1 times [2022-11-20 12:06:43,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:43,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440106937] [2022-11-20 12:06:43,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:43,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:43,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:06:43,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:43,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440106937] [2022-11-20 12:06:43,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440106937] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:43,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:06:43,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:06:43,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737554435] [2022-11-20 12:06:43,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:43,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:06:43,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:43,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:06:43,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:06:43,666 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:43,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:06:43,973 INFO L93 Difference]: Finished difference Result 76 states and 111 transitions. [2022-11-20 12:06:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:06:43,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 12:06:43,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:06:43,976 INFO L225 Difference]: With dead ends: 76 [2022-11-20 12:06:43,976 INFO L226 Difference]: Without dead ends: 74 [2022-11-20 12:06:43,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:06:43,978 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 33 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:06:43,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 184 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:06:43,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-20 12:06:43,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2022-11-20 12:06:43,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-20 12:06:44,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 102 transitions. [2022-11-20 12:06:44,000 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 102 transitions. Word has length 11 [2022-11-20 12:06:44,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:06:44,001 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 102 transitions. [2022-11-20 12:06:44,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:06:44,002 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 102 transitions. [2022-11-20 12:06:44,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 12:06:44,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:06:44,003 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:06:44,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:06:44,004 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:06:44,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:44,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1885075524, now seen corresponding path program 1 times [2022-11-20 12:06:44,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:44,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586768121] [2022-11-20 12:06:44,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:44,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:44,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 12:06:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:06:44,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:44,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586768121] [2022-11-20 12:06:44,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586768121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:44,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:06:44,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:06:44,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652557737] [2022-11-20 12:06:44,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:44,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:06:44,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:44,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:06:44,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:06:44,356 INFO L87 Difference]: Start difference. First operand 69 states and 102 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:06:44,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:06:44,702 INFO L93 Difference]: Finished difference Result 102 states and 153 transitions. [2022-11-20 12:06:44,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:06:44,705 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-20 12:06:44,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:06:44,715 INFO L225 Difference]: With dead ends: 102 [2022-11-20 12:06:44,715 INFO L226 Difference]: Without dead ends: 100 [2022-11-20 12:06:44,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:06:44,719 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 44 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:06:44,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 217 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:06:44,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-20 12:06:44,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2022-11-20 12:06:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-11-20 12:06:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 148 transitions. [2022-11-20 12:06:44,773 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 148 transitions. Word has length 16 [2022-11-20 12:06:44,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:06:44,773 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 148 transitions. [2022-11-20 12:06:44,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:06:44,774 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 148 transitions. [2022-11-20 12:06:44,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 12:06:44,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:06:44,775 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:06:44,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:06:44,776 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:06:44,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:44,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1503713061, now seen corresponding path program 1 times [2022-11-20 12:06:44,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:44,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934603099] [2022-11-20 12:06:44,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:44,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:44,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 12:06:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:44,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:06:44,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:44,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934603099] [2022-11-20 12:06:44,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934603099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:44,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:06:44,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:06:44,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576374004] [2022-11-20 12:06:44,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:44,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:06:44,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:44,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:06:44,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:06:44,972 INFO L87 Difference]: Start difference. First operand 97 states and 148 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:06:45,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:06:45,107 INFO L93 Difference]: Finished difference Result 103 states and 153 transitions. [2022-11-20 12:06:45,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:06:45,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-20 12:06:45,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:06:45,113 INFO L225 Difference]: With dead ends: 103 [2022-11-20 12:06:45,113 INFO L226 Difference]: Without dead ends: 101 [2022-11-20 12:06:45,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:06:45,124 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:06:45,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 125 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:06:45,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-20 12:06:45,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-11-20 12:06:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 55 states have internal predecessors, (71), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-11-20 12:06:45,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 151 transitions. [2022-11-20 12:06:45,178 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 151 transitions. Word has length 16 [2022-11-20 12:06:45,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:06:45,179 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 151 transitions. [2022-11-20 12:06:45,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:06:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 151 transitions. [2022-11-20 12:06:45,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 12:06:45,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:06:45,190 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:06:45,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:06:45,191 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:06:45,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:45,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1518715221, now seen corresponding path program 1 times [2022-11-20 12:06:45,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:45,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903774221] [2022-11-20 12:06:45,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:45,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:45,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 12:06:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:45,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:06:45,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:45,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903774221] [2022-11-20 12:06:45,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903774221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:45,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:06:45,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:06:45,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919369177] [2022-11-20 12:06:45,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:45,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:06:45,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:45,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:06:45,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:06:45,369 INFO L87 Difference]: Start difference. First operand 101 states and 151 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:06:45,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:06:45,733 INFO L93 Difference]: Finished difference Result 155 states and 240 transitions. [2022-11-20 12:06:45,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:06:45,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-20 12:06:45,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:06:45,737 INFO L225 Difference]: With dead ends: 155 [2022-11-20 12:06:45,737 INFO L226 Difference]: Without dead ends: 153 [2022-11-20 12:06:45,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:06:45,738 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 60 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:06:45,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 245 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:06:45,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-20 12:06:45,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 137. [2022-11-20 12:06:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 72 states have internal predecessors, (94), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2022-11-20 12:06:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 214 transitions. [2022-11-20 12:06:45,783 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 214 transitions. Word has length 16 [2022-11-20 12:06:45,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:06:45,784 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 214 transitions. [2022-11-20 12:06:45,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:06:45,785 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 214 transitions. [2022-11-20 12:06:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 12:06:45,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:06:45,786 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:06:45,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:06:45,786 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:06:45,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:45,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1823085758, now seen corresponding path program 1 times [2022-11-20 12:06:45,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:45,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268208540] [2022-11-20 12:06:45,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:45,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:45,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 12:06:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:06:45,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:45,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268208540] [2022-11-20 12:06:45,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268208540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:45,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:06:45,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:06:45,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130538884] [2022-11-20 12:06:45,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:45,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:06:45,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:45,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:06:45,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:06:45,814 INFO L87 Difference]: Start difference. First operand 137 states and 214 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:06:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:06:45,881 INFO L93 Difference]: Finished difference Result 274 states and 436 transitions. [2022-11-20 12:06:45,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:06:45,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-20 12:06:45,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:06:45,884 INFO L225 Difference]: With dead ends: 274 [2022-11-20 12:06:45,885 INFO L226 Difference]: Without dead ends: 205 [2022-11-20 12:06:45,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:06:45,887 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 11 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:06:45,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 115 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:06:45,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-11-20 12:06:45,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-11-20 12:06:45,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 99 states have (on average 1.404040404040404) internal successors, (139), 103 states have internal predecessors, (139), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (98), 94 states have call predecessors, (98), 98 states have call successors, (98) [2022-11-20 12:06:45,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 335 transitions. [2022-11-20 12:06:45,948 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 335 transitions. Word has length 16 [2022-11-20 12:06:45,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:06:45,948 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 335 transitions. [2022-11-20 12:06:45,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:06:45,949 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 335 transitions. [2022-11-20 12:06:45,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 12:06:45,950 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:06:45,950 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:06:45,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:06:45,950 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:06:45,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:45,951 INFO L85 PathProgramCache]: Analyzing trace with hash -2105521235, now seen corresponding path program 1 times [2022-11-20 12:06:45,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:45,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621690121] [2022-11-20 12:06:45,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:45,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:46,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 12:06:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:46,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:06:46,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:46,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621690121] [2022-11-20 12:06:46,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621690121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:46,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:06:46,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:06:46,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376138736] [2022-11-20 12:06:46,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:46,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:06:46,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:46,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:06:46,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:06:46,012 INFO L87 Difference]: Start difference. First operand 205 states and 335 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:06:46,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:06:46,170 INFO L93 Difference]: Finished difference Result 230 states and 359 transitions. [2022-11-20 12:06:46,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:06:46,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-20 12:06:46,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:06:46,172 INFO L225 Difference]: With dead ends: 230 [2022-11-20 12:06:46,173 INFO L226 Difference]: Without dead ends: 183 [2022-11-20 12:06:46,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:06:46,175 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 5 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:06:46,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 161 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:06:46,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-20 12:06:46,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-11-20 12:06:46,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 93 states have internal predecessors, (124), 86 states have call successors, (86), 7 states have call predecessors, (86), 7 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-20 12:06:46,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 296 transitions. [2022-11-20 12:06:46,251 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 296 transitions. Word has length 16 [2022-11-20 12:06:46,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:06:46,251 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 296 transitions. [2022-11-20 12:06:46,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:06:46,252 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 296 transitions. [2022-11-20 12:06:46,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 12:06:46,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:06:46,253 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:06:46,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:06:46,253 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:06:46,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:46,254 INFO L85 PathProgramCache]: Analyzing trace with hash 186914675, now seen corresponding path program 1 times [2022-11-20 12:06:46,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:46,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425160254] [2022-11-20 12:06:46,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:46,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:46,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 12:06:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:46,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:06:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:06:46,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:46,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425160254] [2022-11-20 12:06:46,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425160254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:46,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:06:46,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:06:46,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308681322] [2022-11-20 12:06:46,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:46,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:06:46,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:46,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:06:46,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:06:46,365 INFO L87 Difference]: Start difference. First operand 183 states and 296 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 12:06:46,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:06:46,530 INFO L93 Difference]: Finished difference Result 217 states and 348 transitions. [2022-11-20 12:06:46,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:06:46,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-11-20 12:06:46,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:06:46,533 INFO L225 Difference]: With dead ends: 217 [2022-11-20 12:06:46,534 INFO L226 Difference]: Without dead ends: 215 [2022-11-20 12:06:46,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:06:46,537 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 44 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:06:46,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 293 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:06:46,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-20 12:06:46,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 197. [2022-11-20 12:06:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 102 states have internal predecessors, (133), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2022-11-20 12:06:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 317 transitions. [2022-11-20 12:06:46,591 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 317 transitions. Word has length 23 [2022-11-20 12:06:46,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:06:46,591 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 317 transitions. [2022-11-20 12:06:46,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 12:06:46,592 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 317 transitions. [2022-11-20 12:06:46,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 12:06:46,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:06:46,594 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:06:46,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:06:46,595 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:06:46,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:46,596 INFO L85 PathProgramCache]: Analyzing trace with hash 768784003, now seen corresponding path program 1 times [2022-11-20 12:06:46,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:46,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148212385] [2022-11-20 12:06:46,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:46,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:46,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 12:06:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:46,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:06:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:46,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:06:46,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:46,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148212385] [2022-11-20 12:06:46,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148212385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:46,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:06:46,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:06:46,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626141741] [2022-11-20 12:06:46,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:46,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:06:46,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:46,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:06:46,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:06:46,745 INFO L87 Difference]: Start difference. First operand 197 states and 317 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 12:06:47,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:06:47,108 INFO L93 Difference]: Finished difference Result 520 states and 854 transitions. [2022-11-20 12:06:47,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:06:47,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-11-20 12:06:47,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:06:47,112 INFO L225 Difference]: With dead ends: 520 [2022-11-20 12:06:47,112 INFO L226 Difference]: Without dead ends: 366 [2022-11-20 12:06:47,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:06:47,115 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 83 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:06:47,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 136 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:06:47,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-11-20 12:06:47,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 197. [2022-11-20 12:06:47,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 102 states have internal predecessors, (131), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2022-11-20 12:06:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 315 transitions. [2022-11-20 12:06:47,178 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 315 transitions. Word has length 25 [2022-11-20 12:06:47,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:06:47,180 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 315 transitions. [2022-11-20 12:06:47,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 12:06:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 315 transitions. [2022-11-20 12:06:47,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 12:06:47,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:06:47,182 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:06:47,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:06:47,182 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:06:47,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:47,183 INFO L85 PathProgramCache]: Analyzing trace with hash -299150037, now seen corresponding path program 1 times [2022-11-20 12:06:47,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:47,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194537139] [2022-11-20 12:06:47,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:47,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:47,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 12:06:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:47,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:06:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:47,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 12:06:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 12:06:47,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:47,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194537139] [2022-11-20 12:06:47,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194537139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:47,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:06:47,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:06:47,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134370483] [2022-11-20 12:06:47,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:47,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:06:47,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:47,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:06:47,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:06:47,312 INFO L87 Difference]: Start difference. First operand 197 states and 315 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 12:06:47,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:06:47,554 INFO L93 Difference]: Finished difference Result 291 states and 471 transitions. [2022-11-20 12:06:47,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:06:47,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-11-20 12:06:47,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:06:47,558 INFO L225 Difference]: With dead ends: 291 [2022-11-20 12:06:47,559 INFO L226 Difference]: Without dead ends: 289 [2022-11-20 12:06:47,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:06:47,560 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 26 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:06:47,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 183 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:06:47,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-11-20 12:06:47,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 269. [2022-11-20 12:06:47,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 118 states have (on average 1.3644067796610169) internal successors, (161), 132 states have internal predecessors, (161), 140 states have call successors, (140), 10 states have call predecessors, (140), 10 states have return successors, (140), 126 states have call predecessors, (140), 140 states have call successors, (140) [2022-11-20 12:06:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 441 transitions. [2022-11-20 12:06:47,637 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 441 transitions. Word has length 26 [2022-11-20 12:06:47,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:06:47,638 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 441 transitions. [2022-11-20 12:06:47,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 12:06:47,638 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 441 transitions. [2022-11-20 12:06:47,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 12:06:47,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:06:47,640 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:06:47,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:06:47,641 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:06:47,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:47,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1714235681, now seen corresponding path program 1 times [2022-11-20 12:06:47,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:47,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153761203] [2022-11-20 12:06:47,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:47,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:47,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 12:06:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:47,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:06:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:47,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:06:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 12:06:47,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:47,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153761203] [2022-11-20 12:06:47,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153761203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:47,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:06:47,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:06:47,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069605508] [2022-11-20 12:06:47,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:47,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:06:47,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:47,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:06:47,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:06:47,856 INFO L87 Difference]: Start difference. First operand 269 states and 441 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 12:06:48,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:06:48,176 INFO L93 Difference]: Finished difference Result 317 states and 516 transitions. [2022-11-20 12:06:48,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:06:48,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-11-20 12:06:48,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:06:48,180 INFO L225 Difference]: With dead ends: 317 [2022-11-20 12:06:48,180 INFO L226 Difference]: Without dead ends: 315 [2022-11-20 12:06:48,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:06:48,182 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 72 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:06:48,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 197 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:06:48,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-11-20 12:06:48,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 287. [2022-11-20 12:06:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 125 states have (on average 1.36) internal successors, (170), 141 states have internal predecessors, (170), 150 states have call successors, (150), 11 states have call predecessors, (150), 11 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2022-11-20 12:06:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 470 transitions. [2022-11-20 12:06:48,260 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 470 transitions. Word has length 28 [2022-11-20 12:06:48,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:06:48,261 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 470 transitions. [2022-11-20 12:06:48,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 12:06:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 470 transitions. [2022-11-20 12:06:48,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-20 12:06:48,262 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:06:48,262 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:06:48,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 12:06:48,263 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:06:48,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:48,264 INFO L85 PathProgramCache]: Analyzing trace with hash 523331784, now seen corresponding path program 1 times [2022-11-20 12:06:48,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:48,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119766987] [2022-11-20 12:06:48,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:48,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:48,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 12:06:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:48,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:06:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:48,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 12:06:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:48,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 12:06:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:48,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 12:06:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:48,397 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-20 12:06:48,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:48,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119766987] [2022-11-20 12:06:48,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119766987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:48,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:06:48,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:06:48,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556905421] [2022-11-20 12:06:48,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:48,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:06:48,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:48,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:06:48,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:06:48,400 INFO L87 Difference]: Start difference. First operand 287 states and 470 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 12:06:48,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:06:48,708 INFO L93 Difference]: Finished difference Result 329 states and 527 transitions. [2022-11-20 12:06:48,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:06:48,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2022-11-20 12:06:48,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:06:48,711 INFO L225 Difference]: With dead ends: 329 [2022-11-20 12:06:48,712 INFO L226 Difference]: Without dead ends: 327 [2022-11-20 12:06:48,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:06:48,713 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 38 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:06:48,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 194 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:06:48,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-11-20 12:06:48,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 291. [2022-11-20 12:06:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 128 states have (on average 1.3515625) internal successors, (173), 144 states have internal predecessors, (173), 150 states have call successors, (150), 12 states have call predecessors, (150), 12 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2022-11-20 12:06:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 473 transitions. [2022-11-20 12:06:48,818 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 473 transitions. Word has length 38 [2022-11-20 12:06:48,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:06:48,820 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 473 transitions. [2022-11-20 12:06:48,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 12:06:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 473 transitions. [2022-11-20 12:06:48,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-20 12:06:48,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:06:48,823 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:06:48,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 12:06:48,823 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:06:48,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:48,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1856149802, now seen corresponding path program 1 times [2022-11-20 12:06:48,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:48,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53739264] [2022-11-20 12:06:48,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:48,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:48,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 12:06:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:48,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:06:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:48,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:06:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:48,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:06:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 12:06:48,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:48,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53739264] [2022-11-20 12:06:48,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53739264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:48,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:06:48,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:06:48,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792661186] [2022-11-20 12:06:48,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:48,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:06:48,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:48,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:06:48,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:06:48,968 INFO L87 Difference]: Start difference. First operand 291 states and 473 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:06:49,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:06:49,170 INFO L93 Difference]: Finished difference Result 297 states and 478 transitions. [2022-11-20 12:06:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:06:49,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-11-20 12:06:49,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:06:49,176 INFO L225 Difference]: With dead ends: 297 [2022-11-20 12:06:49,177 INFO L226 Difference]: Without dead ends: 295 [2022-11-20 12:06:49,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:06:49,178 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 32 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:06:49,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 103 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:06:49,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-11-20 12:06:49,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-11-20 12:06:49,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 147 states have internal predecessors, (176), 150 states have call successors, (150), 13 states have call predecessors, (150), 13 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2022-11-20 12:06:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 476 transitions. [2022-11-20 12:06:49,256 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 476 transitions. Word has length 38 [2022-11-20 12:06:49,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:06:49,257 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 476 transitions. [2022-11-20 12:06:49,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 12:06:49,258 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 476 transitions. [2022-11-20 12:06:49,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-20 12:06:49,259 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:06:49,259 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:06:49,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 12:06:49,259 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:06:49,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:49,260 INFO L85 PathProgramCache]: Analyzing trace with hash 2019762676, now seen corresponding path program 1 times [2022-11-20 12:06:49,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:49,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818742408] [2022-11-20 12:06:49,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:49,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:49,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 12:06:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:49,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:06:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:49,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:06:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:49,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:06:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:49,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:06:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:49,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 12:06:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-20 12:06:49,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:49,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818742408] [2022-11-20 12:06:49,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818742408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:49,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:06:49,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:06:49,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239967402] [2022-11-20 12:06:49,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:49,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:06:49,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:49,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:06:49,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:06:49,423 INFO L87 Difference]: Start difference. First operand 295 states and 476 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 12:06:49,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:06:49,669 INFO L93 Difference]: Finished difference Result 329 states and 525 transitions. [2022-11-20 12:06:49,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:06:49,670 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2022-11-20 12:06:49,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:06:49,673 INFO L225 Difference]: With dead ends: 329 [2022-11-20 12:06:49,673 INFO L226 Difference]: Without dead ends: 327 [2022-11-20 12:06:49,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:06:49,676 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 43 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:06:49,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 226 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:06:49,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-11-20 12:06:49,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 174. [2022-11-20 12:06:49,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2022-11-20 12:06:49,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 260 transitions. [2022-11-20 12:06:49,727 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 260 transitions. Word has length 50 [2022-11-20 12:06:49,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:06:49,728 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 260 transitions. [2022-11-20 12:06:49,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 12:06:49,728 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 260 transitions. [2022-11-20 12:06:49,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 12:06:49,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:06:49,730 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:06:49,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 12:06:49,731 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:06:49,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:49,732 INFO L85 PathProgramCache]: Analyzing trace with hash -2077570128, now seen corresponding path program 1 times [2022-11-20 12:06:49,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:49,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177470772] [2022-11-20 12:06:49,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:49,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:49,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 12:06:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:49,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:06:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:49,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:06:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:49,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-20 12:06:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:49,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 12:06:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:49,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:06:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:49,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:06:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:49,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 12:06:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:49,847 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-20 12:06:49,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:49,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177470772] [2022-11-20 12:06:49,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177470772] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:06:49,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436608028] [2022-11-20 12:06:49,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:49,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:06:49,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:06:49,859 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:06:49,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:06:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:49,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 12:06:49,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:06:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-20 12:06:50,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:06:50,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436608028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:06:50,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:06:50,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2022-11-20 12:06:50,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869949888] [2022-11-20 12:06:50,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:06:50,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:06:50,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:50,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:06:50,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:06:50,158 INFO L87 Difference]: Start difference. First operand 174 states and 260 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 12:06:50,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:06:50,561 INFO L93 Difference]: Finished difference Result 505 states and 801 transitions. [2022-11-20 12:06:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:06:50,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2022-11-20 12:06:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:06:50,565 INFO L225 Difference]: With dead ends: 505 [2022-11-20 12:06:50,565 INFO L226 Difference]: Without dead ends: 335 [2022-11-20 12:06:50,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:06:50,567 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 48 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:06:50,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 168 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:06:50,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-11-20 12:06:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 311. [2022-11-20 12:06:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 152 states have internal predecessors, (183), 162 states have call successors, (162), 12 states have call predecessors, (162), 12 states have return successors, (162), 146 states have call predecessors, (162), 162 states have call successors, (162) [2022-11-20 12:06:50,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2022-11-20 12:06:50,677 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 58 [2022-11-20 12:06:50,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:06:50,678 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2022-11-20 12:06:50,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 12:06:50,678 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2022-11-20 12:06:50,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-20 12:06:50,680 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:06:50,681 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:06:50,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:06:50,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 12:06:50,888 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:06:50,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:50,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1244619342, now seen corresponding path program 1 times [2022-11-20 12:06:50,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:50,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359769578] [2022-11-20 12:06:50,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:50,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:51,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 12:06:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:51,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:06:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:51,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 12:06:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:51,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 12:06:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:51,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 12:06:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:51,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:06:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:51,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 12:06:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:51,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 12:06:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:51,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 12:06:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:51,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:06:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:51,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 12:06:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:51,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 12:06:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-11-20 12:06:51,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:51,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359769578] [2022-11-20 12:06:51,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359769578] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:06:51,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399602609] [2022-11-20 12:06:51,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:51,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:06:51,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:06:51,084 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:06:51,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:06:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:51,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 12:06:51,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:06:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-11-20 12:06:51,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:06:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-11-20 12:06:51,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399602609] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:06:51,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:06:51,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2022-11-20 12:06:51,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85152944] [2022-11-20 12:06:51,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:06:51,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 12:06:51,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:51,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 12:06:51,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-11-20 12:06:51,519 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 14 states have internal predecessors, (48), 7 states have call successors, (36), 3 states have call predecessors, (36), 1 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) [2022-11-20 12:06:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:06:53,647 INFO L93 Difference]: Finished difference Result 671 states and 1116 transitions. [2022-11-20 12:06:53,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-20 12:06:53,648 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 14 states have internal predecessors, (48), 7 states have call successors, (36), 3 states have call predecessors, (36), 1 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) Word has length 80 [2022-11-20 12:06:53,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:06:53,653 INFO L225 Difference]: With dead ends: 671 [2022-11-20 12:06:53,653 INFO L226 Difference]: Without dead ends: 669 [2022-11-20 12:06:53,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=370, Invalid=1112, Unknown=0, NotChecked=0, Total=1482 [2022-11-20 12:06:53,655 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 296 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 2089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 734 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:06:53,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 624 Invalid, 2089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [734 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-20 12:06:53,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-11-20 12:06:53,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 367. [2022-11-20 12:06:53,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 163 states have (on average 1.3496932515337423) internal successors, (220), 181 states have internal predecessors, (220), 188 states have call successors, (188), 15 states have call predecessors, (188), 15 states have return successors, (188), 170 states have call predecessors, (188), 188 states have call successors, (188) [2022-11-20 12:06:53,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 596 transitions. [2022-11-20 12:06:53,823 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 596 transitions. Word has length 80 [2022-11-20 12:06:53,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:06:53,823 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 596 transitions. [2022-11-20 12:06:53,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 14 states have internal predecessors, (48), 7 states have call successors, (36), 3 states have call predecessors, (36), 1 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) [2022-11-20 12:06:53,824 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 596 transitions. [2022-11-20 12:06:53,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-20 12:06:53,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:06:53,826 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:06:53,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:06:54,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 12:06:54,035 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:06:54,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:54,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1679445438, now seen corresponding path program 2 times [2022-11-20 12:06:54,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:54,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460129398] [2022-11-20 12:06:54,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:54,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:54,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 12:06:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:54,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:06:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:54,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 12:06:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:54,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 12:06:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:54,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 12:06:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:54,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:06:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:54,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 12:06:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:54,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 12:06:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:54,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 12:06:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:54,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:06:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:54,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 12:06:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:54,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 12:06:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:54,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 12:06:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-11-20 12:06:54,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:54,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460129398] [2022-11-20 12:06:54,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460129398] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:06:54,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958726152] [2022-11-20 12:06:54,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:06:54,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:06:54,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:06:54,330 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:06:54,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:06:54,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:06:54,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:06:54,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 12:06:54,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:06:54,732 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-11-20 12:06:54,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:06:54,916 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-11-20 12:06:54,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958726152] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:06:54,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:06:54,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-11-20 12:06:54,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474279658] [2022-11-20 12:06:54,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:06:54,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 12:06:54,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:54,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 12:06:54,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:06:54,919 INFO L87 Difference]: Start difference. First operand 367 states and 596 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 16 states have internal predecessors, (52), 6 states have call successors, (42), 3 states have call predecessors, (42), 1 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2022-11-20 12:06:55,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:06:55,621 INFO L93 Difference]: Finished difference Result 399 states and 639 transitions. [2022-11-20 12:06:55,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:06:55,622 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 16 states have internal predecessors, (52), 6 states have call successors, (42), 3 states have call predecessors, (42), 1 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) Word has length 85 [2022-11-20 12:06:55,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:06:55,625 INFO L225 Difference]: With dead ends: 399 [2022-11-20 12:06:55,625 INFO L226 Difference]: Without dead ends: 317 [2022-11-20 12:06:55,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2022-11-20 12:06:55,627 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 107 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:06:55,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 148 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:06:55,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-20 12:06:55,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 301. [2022-11-20 12:06:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 154 states have internal predecessors, (184), 144 states have call successors, (144), 16 states have call predecessors, (144), 16 states have return successors, (144), 130 states have call predecessors, (144), 144 states have call successors, (144) [2022-11-20 12:06:55,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 472 transitions. [2022-11-20 12:06:55,738 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 472 transitions. Word has length 85 [2022-11-20 12:06:55,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:06:55,739 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 472 transitions. [2022-11-20 12:06:55,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 16 states have internal predecessors, (52), 6 states have call successors, (42), 3 states have call predecessors, (42), 1 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2022-11-20 12:06:55,739 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 472 transitions. [2022-11-20 12:06:55,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-20 12:06:55,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:06:55,747 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:06:55,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:06:55,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 12:06:55,954 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:06:55,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:06:55,955 INFO L85 PathProgramCache]: Analyzing trace with hash 520521549, now seen corresponding path program 1 times [2022-11-20 12:06:55,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:06:55,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947173546] [2022-11-20 12:06:55,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:55,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:06:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 12:06:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:06:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:06:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:06:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:06:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 12:06:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 12:06:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 12:06:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:06:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-20 12:06:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-20 12:06:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 12:06:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 12:06:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 12:06:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-20 12:06:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 12:06:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-20 12:06:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-20 12:06:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-20 12:06:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-20 12:06:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,239 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 53 proven. 13 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-11-20 12:06:56,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:06:56,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947173546] [2022-11-20 12:06:56,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947173546] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:06:56,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073803745] [2022-11-20 12:06:56,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:06:56,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:06:56,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:06:56,243 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:06:56,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 12:06:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:06:56,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 12:06:56,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:06:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 382 proven. 8 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2022-11-20 12:06:56,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:06:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 56 proven. 10 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-11-20 12:06:56,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073803745] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:06:56,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:06:56,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-11-20 12:06:56,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929571018] [2022-11-20 12:06:56,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:06:56,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 12:06:56,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:56,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 12:06:56,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-11-20 12:06:56,901 INFO L87 Difference]: Start difference. First operand 301 states and 472 transitions. Second operand has 20 states, 20 states have (on average 3.65) internal successors, (73), 19 states have internal predecessors, (73), 11 states have call successors, (62), 3 states have call predecessors, (62), 2 states have return successors, (60), 11 states have call predecessors, (60), 11 states have call successors, (60) [2022-11-20 12:07:01,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:07:01,896 INFO L93 Difference]: Finished difference Result 894 states and 1429 transitions. [2022-11-20 12:07:01,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-20 12:07:01,897 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 19 states have internal predecessors, (73), 11 states have call successors, (62), 3 states have call predecessors, (62), 2 states have return successors, (60), 11 states have call predecessors, (60), 11 states have call successors, (60) Word has length 129 [2022-11-20 12:07:01,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:07:01,897 INFO L225 Difference]: With dead ends: 894 [2022-11-20 12:07:01,898 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 12:07:01,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1729 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1180, Invalid=4370, Unknown=0, NotChecked=0, Total=5550 [2022-11-20 12:07:01,903 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 363 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 2837 mSolverCounterSat, 1001 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 3838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1001 IncrementalHoareTripleChecker+Valid, 2837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-20 12:07:01,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 845 Invalid, 3838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1001 Valid, 2837 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-20 12:07:01,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 12:07:01,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 12:07:01,904 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) [2022-11-20 12:07:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 12:07:01,905 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 129 [2022-11-20 12:07:01,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:07:01,905 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 12:07:01,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 19 states have internal predecessors, (73), 11 states have call successors, (62), 3 states have call predecessors, (62), 2 states have return successors, (60), 11 states have call predecessors, (60), 11 states have call successors, (60) [2022-11-20 12:07:01,906 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 12:07:01,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 12:07:01,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 12:07:01,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:02,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:07:02,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 12:07:40,160 WARN L233 SmtUtils]: Spent 34.69s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:08:14,072 WARN L233 SmtUtils]: Spent 33.91s on a formula simplification that was a NOOP. DAG size: 137 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:08:50,877 WARN L233 SmtUtils]: Spent 35.59s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:09:27,487 WARN L233 SmtUtils]: Spent 36.55s on a formula simplification that was a NOOP. DAG size: 137 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:14:32,552 WARN L233 SmtUtils]: Spent 5.08m on a formula simplification. DAG size of input: 217 DAG size of output: 213 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:14:45,815 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~l~0#1| 1) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-11-20 12:14:45,816 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~l~0#1| 1) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-11-20 12:14:45,816 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~l~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~j~0#1|)) [2022-11-20 12:14:45,816 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-11-20 12:14:45,818 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~l~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~j~0#1|)) [2022-11-20 12:14:45,818 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-11-20 12:14:45,819 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-11-20 12:14:45,819 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-11-20 12:14:45,819 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2022-11-20 12:14:45,819 INFO L895 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (let ((.cse4 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse2 (<= .cse4 |ULTIMATE.start_main_~r~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse5 (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~l~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~j~0#1| .cse4) .cse5) (and (<= |ULTIMATE.start_main_~l~0#1| 1) .cse0 .cse1 .cse3 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse6 .cse7)))) [2022-11-20 12:14:45,820 INFO L895 garLoopResultBuilder]: At program point L40-1(line 40) the Hoare annotation is: (let ((.cse4 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse2 (<= .cse4 |ULTIMATE.start_main_~r~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse5 (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~l~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~j~0#1| .cse4) .cse5) (and (<= |ULTIMATE.start_main_~l~0#1| 1) .cse0 .cse1 .cse3 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse6 .cse7)))) [2022-11-20 12:14:45,820 INFO L902 garLoopResultBuilder]: At program point L69(lines 24 70) the Hoare annotation is: true [2022-11-20 12:14:45,820 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2022-11-20 12:14:45,820 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 12:14:45,820 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 12:14:45,821 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-11-20 12:14:45,821 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 12:14:45,821 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-11-20 12:14:45,821 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2022-11-20 12:14:45,821 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse4 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse2 (<= .cse4 |ULTIMATE.start_main_~r~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse5 (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~l~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~j~0#1| .cse4) .cse5) (and (<= |ULTIMATE.start_main_~l~0#1| 1) .cse0 .cse1 .cse3 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse6 .cse7)))) [2022-11-20 12:14:45,822 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 12:14:45,822 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-11-20 12:14:45,822 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse4 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse2 (<= .cse4 |ULTIMATE.start_main_~r~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse5 (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~l~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~j~0#1| .cse4) .cse5) (and (<= |ULTIMATE.start_main_~l~0#1| 1) .cse0 .cse1 .cse3 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse6 .cse7)))) [2022-11-20 12:14:45,822 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 58) the Hoare annotation is: (let ((.cse7 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse4 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse2 (<= .cse4 |ULTIMATE.start_main_~r~0#1|)) (.cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (<= .cse7 |ULTIMATE.start_main_~j~0#1|)) (.cse5 (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (+ |ULTIMATE.start_main_~r~0#1| .cse7))) (.cse3 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse6 (<= 1 |ULTIMATE.start_main_~l~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~j~0#1| .cse4)) (and .cse1 .cse5 .cse2 .cse3 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse6) (and (<= |ULTIMATE.start_main_~l~0#1| 1) .cse0 .cse1 .cse5 .cse3 .cse6)))) [2022-11-20 12:14:45,823 INFO L899 garLoopResultBuilder]: For program point L38-3(lines 35 68) no Hoare annotation was computed. [2022-11-20 12:14:45,823 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 34) no Hoare annotation was computed. [2022-11-20 12:14:45,823 INFO L895 garLoopResultBuilder]: At program point L59-1(lines 24 70) the Hoare annotation is: (let ((.cse1 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= |ULTIMATE.start_main_~l~0#1| 1)) (.cse6 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse3 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse4 (<= .cse1 |ULTIMATE.start_main_~r~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse7 (<= .cse1 |ULTIMATE.start_main_~n~0#1|)) (.cse2 (<= 1 |ULTIMATE.start_main_~l~0#1|))) (or (and .cse0 (<= (+ 2 |ULTIMATE.start_main_~r~0#1|) .cse1) (<= .cse1 (+ 2 |ULTIMATE.start_main_~n~0#1|)) .cse2) (and (<= .cse3 |ULTIMATE.start_main_~j~0#1|) .cse4 .cse5 .cse6 .cse7 .cse2) (and .cse0 .cse5 .cse6 (<= (+ 2 |ULTIMATE.start_main_~r~0#1| .cse3) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|)) .cse7 .cse2) (and (<= |ULTIMATE.start_main_~r~0#1| (+ 2 .cse1)) .cse4 .cse5 .cse7 .cse2)))) [2022-11-20 12:14:45,823 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-11-20 12:14:45,824 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-11-20 12:14:45,824 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-11-20 12:14:45,824 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 46) no Hoare annotation was computed. [2022-11-20 12:14:45,824 INFO L895 garLoopResultBuilder]: At program point L39-1(lines 39 46) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-11-20 12:14:45,824 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 35 68) no Hoare annotation was computed. [2022-11-20 12:14:45,825 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-11-20 12:14:45,825 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-11-20 12:14:45,825 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-11-20 12:14:45,825 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-11-20 12:14:45,826 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-11-20 12:14:45,826 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-11-20 12:14:45,830 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:14:45,833 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:14:45,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:14:45 BoogieIcfgContainer [2022-11-20 12:14:45,852 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:14:45,853 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:14:45,853 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:14:45,854 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:14:45,854 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:06:42" (3/4) ... [2022-11-20 12:14:45,858 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 12:14:45,866 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-20 12:14:45,871 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-11-20 12:14:45,872 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-20 12:14:45,872 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 12:14:45,872 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 12:14:45,873 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 12:14:45,915 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:14:45,915 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:14:45,917 INFO L158 Benchmark]: Toolchain (without parser) took 484693.62ms. Allocated memory was 157.3MB in the beginning and 664.8MB in the end (delta: 507.5MB). Free memory was 116.1MB in the beginning and 257.7MB in the end (delta: -141.6MB). Peak memory consumption was 367.8MB. Max. memory is 16.1GB. [2022-11-20 12:14:45,917 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 157.3MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:14:45,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.86ms. Allocated memory is still 157.3MB. Free memory was 116.1MB in the beginning and 104.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 12:14:45,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.95ms. Allocated memory is still 157.3MB. Free memory was 104.6MB in the beginning and 103.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:14:45,919 INFO L158 Benchmark]: Boogie Preprocessor took 26.74ms. Allocated memory is still 157.3MB. Free memory was 103.1MB in the beginning and 102.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:14:45,919 INFO L158 Benchmark]: RCFGBuilder took 457.35ms. Allocated memory is still 157.3MB. Free memory was 101.7MB in the beginning and 90.0MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 12:14:45,920 INFO L158 Benchmark]: TraceAbstraction took 483754.84ms. Allocated memory was 157.3MB in the beginning and 664.8MB in the end (delta: 507.5MB). Free memory was 89.4MB in the beginning and 260.8MB in the end (delta: -171.5MB). Peak memory consumption was 372.0MB. Max. memory is 16.1GB. [2022-11-20 12:14:45,921 INFO L158 Benchmark]: Witness Printer took 61.71ms. Allocated memory is still 664.8MB. Free memory was 260.8MB in the beginning and 257.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 12:14:45,925 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 157.3MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.86ms. Allocated memory is still 157.3MB. Free memory was 116.1MB in the beginning and 104.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.95ms. Allocated memory is still 157.3MB. Free memory was 104.6MB in the beginning and 103.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.74ms. Allocated memory is still 157.3MB. Free memory was 103.1MB in the beginning and 102.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 457.35ms. Allocated memory is still 157.3MB. Free memory was 101.7MB in the beginning and 90.0MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 483754.84ms. Allocated memory was 157.3MB in the beginning and 664.8MB in the end (delta: 507.5MB). Free memory was 89.4MB in the beginning and 260.8MB in the end (delta: -171.5MB). Peak memory consumption was 372.0MB. Max. memory is 16.1GB. * Witness Printer took 61.71ms. Allocated memory is still 664.8MB. Free memory was 260.8MB in the beginning and 257.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 483.6s, OverallIterations: 19, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 463.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1532 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1363 mSDsluCounter, 4521 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3159 mSDsCounter, 2413 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6233 IncrementalHoareTripleChecker+Invalid, 8646 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2413 mSolverCounterUnsat, 1362 mSDtfsCounter, 6233 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1063 GetRequests, 832 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2194 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=17, InterpolantAutomatonStates: 215, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 813 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 684 PreInvPairs, 1094 NumberOfFragments, 730 HoareAnnotationTreeSize, 684 FomulaSimplifications, 2804560 FormulaSimplificationTreeSizeReduction, 453.3s HoareSimplificationTime, 18 FomulaSimplificationsInter, 44867391 FormulaSimplificationTreeSizeReductionInter, 10.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1045 NumberOfCodeBlocks, 1045 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1313 ConstructedInterpolants, 0 QuantifiedInterpolants, 3094 SizeOfPredicates, 15 NumberOfNonLiveVariables, 805 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 26 InterpolantComputations, 16 PerfectInterpolantSequences, 4823/4899 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: 24]: Loop Invariant Derived loop invariant: (((((l <= 1 && 2 + r <= 2 * l) && 2 * l <= 2 + n) && 1 <= l) || (((((2 * i <= j && 2 * l <= r) && r <= n) && 2 <= j) && 2 * l <= n) && 1 <= l)) || (((((l <= 1 && r <= n) && 2 <= j) && 2 + r + 2 * i <= 2 * n + j) && 2 * l <= n) && 1 <= l)) || ((((r <= 2 + 2 * l && 2 * l <= r) && r <= n) && 2 * l <= n) && 1 <= l) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((1 <= i && 2 * i <= j) && 2 * l <= r) && r <= n) && j <= 2 * l) || (((((2 * i <= j && 2 + j <= r + 2 * i) && 2 * l <= r) && r <= n) && 2 <= i) && 1 <= l)) || (((((l <= 1 && 1 <= i) && 2 * i <= j) && 2 + j <= r + 2 * i) && r <= n) && 1 <= l) RESULT: Ultimate proved your program to be correct! [2022-11-20 12:14:45,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026f9f57-66ff-4ff8-9e2b-2ea5ea092801/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE