./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP --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 282dfa0bfe333efa3c47884b86159bc6597e0a79cae24c957b75e6e92350e420 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:42:51,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:42:51,442 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:42:51,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:42:51,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:42:51,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:42:51,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:42:51,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:42:51,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:42:51,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:42:51,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:42:51,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:42:51,482 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:42:51,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:42:51,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:42:51,484 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:42:51,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:42:51,485 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:42:51,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:42:51,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:42:51,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:42:51,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:42:51,488 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:42:51,488 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:42:51,489 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:42:51,489 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:42:51,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:42:51,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:42:51,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:42:51,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:42:51,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:42:51,492 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:42:51,493 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:42:51,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:42:51,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:42:51,494 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:42:51,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:42:51,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:42:51,495 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:42:51,495 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP/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_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP 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 -> 282dfa0bfe333efa3c47884b86159bc6597e0a79cae24c957b75e6e92350e420 [2023-11-06 22:42:51,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:42:51,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:42:51,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:42:51,823 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:42:51,823 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:42:51,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i [2023-11-06 22:42:54,886 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:42:55,171 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:42:55,173 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i [2023-11-06 22:42:55,188 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP/data/bf8f87c5a/6ad7100e234b4a1ca41e5397dc8a0cf5/FLAG4d7d916e3 [2023-11-06 22:42:55,207 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP/data/bf8f87c5a/6ad7100e234b4a1ca41e5397dc8a0cf5 [2023-11-06 22:42:55,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:42:55,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:42:55,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:42:55,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:42:55,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:42:55,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:42:55" (1/1) ... [2023-11-06 22:42:55,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43b35f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:55, skipping insertion in model container [2023-11-06 22:42:55,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:42:55" (1/1) ... [2023-11-06 22:42:55,280 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:42:55,473 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i[916,929] [2023-11-06 22:42:55,521 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:42:55,535 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:42:55,547 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i[916,929] [2023-11-06 22:42:55,577 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:42:55,597 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:42:55,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:55 WrapperNode [2023-11-06 22:42:55,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:42:55,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:42:55,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:42:55,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:42:55,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:55" (1/1) ... [2023-11-06 22:42:55,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:55" (1/1) ... [2023-11-06 22:42:55,667 INFO L138 Inliner]: procedures = 29, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 396 [2023-11-06 22:42:55,668 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:42:55,669 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:42:55,669 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:42:55,669 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:42:55,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:55" (1/1) ... [2023-11-06 22:42:55,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:55" (1/1) ... [2023-11-06 22:42:55,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:55" (1/1) ... [2023-11-06 22:42:55,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:55" (1/1) ... [2023-11-06 22:42:55,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:55" (1/1) ... [2023-11-06 22:42:55,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:55" (1/1) ... [2023-11-06 22:42:55,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:55" (1/1) ... [2023-11-06 22:42:55,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:55" (1/1) ... [2023-11-06 22:42:55,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:42:55,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:42:55,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:42:55,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:42:55,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:55" (1/1) ... [2023-11-06 22:42:55,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:42:55,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:42:55,791 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:42:55,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:42:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:42:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 22:42:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:42:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 22:42:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:42:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 22:42:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:42:55,839 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:42:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:42:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:42:55,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:42:56,007 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:42:56,011 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:42:56,593 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:42:56,602 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:42:56,602 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:42:56,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:42:56 BoogieIcfgContainer [2023-11-06 22:42:56,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:42:56,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:42:56,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:42:56,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:42:56,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:42:55" (1/3) ... [2023-11-06 22:42:56,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10db1cd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:42:56, skipping insertion in model container [2023-11-06 22:42:56,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:55" (2/3) ... [2023-11-06 22:42:56,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10db1cd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:42:56, skipping insertion in model container [2023-11-06 22:42:56,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:42:56" (3/3) ... [2023-11-06 22:42:56,618 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-76.i [2023-11-06 22:42:56,633 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:42:56,634 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:42:56,689 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:42:56,696 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;@20ccc66d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:42:56,696 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:42:56,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:42:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 22:42:56,717 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:42:56,718 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:42:56,718 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:42:56,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:56,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2020212237, now seen corresponding path program 1 times [2023-11-06 22:42:56,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:56,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039085062] [2023-11-06 22:42:56,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:56,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:42:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:42:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:42:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:42:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:42:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:42:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:42:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:42:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:42:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:42:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:42:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:42:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:42:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:42:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:42:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,193 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:42:57,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:57,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039085062] [2023-11-06 22:42:57,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039085062] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:42:57,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:42:57,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:42:57,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367531956] [2023-11-06 22:42:57,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:42:57,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:42:57,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:57,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:42:57,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:42:57,239 INFO L87 Difference]: Start difference. First operand has 102 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:42:57,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:57,277 INFO L93 Difference]: Finished difference Result 193 states and 301 transitions. [2023-11-06 22:42:57,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:42:57,280 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2023-11-06 22:42:57,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:42:57,289 INFO L225 Difference]: With dead ends: 193 [2023-11-06 22:42:57,289 INFO L226 Difference]: Without dead ends: 94 [2023-11-06 22:42:57,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:42:57,297 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:42:57,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:42:57,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-06 22:42:57,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-11-06 22:42:57,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:42:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2023-11-06 22:42:57,351 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 119 [2023-11-06 22:42:57,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:42:57,352 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2023-11-06 22:42:57,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:42:57,353 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2023-11-06 22:42:57,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 22:42:57,357 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:42:57,357 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:42:57,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:42:57,358 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:42:57,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:57,359 INFO L85 PathProgramCache]: Analyzing trace with hash 189444987, now seen corresponding path program 1 times [2023-11-06 22:42:57,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:57,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781537141] [2023-11-06 22:42:57,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:57,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:42:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:42:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:42:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:42:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:42:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:42:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:42:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:42:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:42:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:42:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:42:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:42:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:42:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:42:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:42:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:42:57,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:57,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781537141] [2023-11-06 22:42:57,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781537141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:42:57,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:42:57,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:42:57,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747204100] [2023-11-06 22:42:57,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:42:57,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:42:57,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:57,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:42:57,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:42:57,821 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:42:57,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:57,876 INFO L93 Difference]: Finished difference Result 191 states and 272 transitions. [2023-11-06 22:42:57,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:42:57,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2023-11-06 22:42:57,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:42:57,879 INFO L225 Difference]: With dead ends: 191 [2023-11-06 22:42:57,879 INFO L226 Difference]: Without dead ends: 100 [2023-11-06 22:42:57,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:42:57,882 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 10 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:42:57,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 387 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:42:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-06 22:42:57,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2023-11-06 22:42:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:42:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2023-11-06 22:42:57,916 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 119 [2023-11-06 22:42:57,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:42:57,918 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2023-11-06 22:42:57,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:42:57,919 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2023-11-06 22:42:57,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 22:42:57,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:42:57,924 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:42:57,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:42:57,925 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:42:57,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:57,926 INFO L85 PathProgramCache]: Analyzing trace with hash -649588675, now seen corresponding path program 1 times [2023-11-06 22:42:57,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:57,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956333372] [2023-11-06 22:42:57,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:57,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:42:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:42:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:42:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:42:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:42:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:42:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:42:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:42:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:42:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:42:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:42:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:42:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:42:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:42:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:42:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:42:58,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:58,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956333372] [2023-11-06 22:42:58,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956333372] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:42:58,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:42:58,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:42:58,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639025075] [2023-11-06 22:42:58,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:42:58,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:42:58,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:58,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:42:58,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:42:58,255 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:42:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:58,303 INFO L93 Difference]: Finished difference Result 189 states and 267 transitions. [2023-11-06 22:42:58,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:42:58,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-11-06 22:42:58,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:42:58,306 INFO L225 Difference]: With dead ends: 189 [2023-11-06 22:42:58,306 INFO L226 Difference]: Without dead ends: 96 [2023-11-06 22:42:58,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:42:58,309 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:42:58,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:42:58,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-06 22:42:58,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-11-06 22:42:58,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 79 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:42:58,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2023-11-06 22:42:58,341 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 119 [2023-11-06 22:42:58,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:42:58,342 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2023-11-06 22:42:58,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:42:58,343 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2023-11-06 22:42:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-06 22:42:58,351 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:42:58,352 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:42:58,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:42:58,352 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:42:58,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:58,354 INFO L85 PathProgramCache]: Analyzing trace with hash 4751163, now seen corresponding path program 1 times [2023-11-06 22:42:58,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:58,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90046731] [2023-11-06 22:42:58,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:58,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:42:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:42:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:42:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:42:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:42:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:42:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:42:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:42:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:42:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:42:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:42:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:42:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:42:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:42:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:42:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:42:58,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:58,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90046731] [2023-11-06 22:42:58,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90046731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:42:58,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:42:58,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:42:58,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747207907] [2023-11-06 22:42:58,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:42:58,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:42:58,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:58,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:42:58,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:42:58,767 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:42:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:58,804 INFO L93 Difference]: Finished difference Result 189 states and 265 transitions. [2023-11-06 22:42:58,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:42:58,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2023-11-06 22:42:58,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:42:58,809 INFO L225 Difference]: With dead ends: 189 [2023-11-06 22:42:58,809 INFO L226 Difference]: Without dead ends: 96 [2023-11-06 22:42:58,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:42:58,821 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 24 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:42:58,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 233 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:42:58,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-06 22:42:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-11-06 22:42:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:42:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2023-11-06 22:42:58,838 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 120 [2023-11-06 22:42:58,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:42:58,840 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2023-11-06 22:42:58,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:42:58,841 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2023-11-06 22:42:58,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-06 22:42:58,845 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:42:58,845 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:42:58,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:42:58,845 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:42:58,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:58,846 INFO L85 PathProgramCache]: Analyzing trace with hash 427452989, now seen corresponding path program 1 times [2023-11-06 22:42:58,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:58,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246581326] [2023-11-06 22:42:58,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:58,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:00,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:00,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:00,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:00,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:00,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:43:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:00,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:43:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:00,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:00,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:00,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:00,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:00,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:00,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:00,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:00,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:00,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:43:00,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:00,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246581326] [2023-11-06 22:43:00,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246581326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:00,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:00,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:43:00,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207919411] [2023-11-06 22:43:00,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:00,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:43:00,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:00,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:43:00,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:43:00,786 INFO L87 Difference]: Start difference. First operand 96 states and 133 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:01,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:01,473 INFO L93 Difference]: Finished difference Result 230 states and 320 transitions. [2023-11-06 22:43:01,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:43:01,474 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2023-11-06 22:43:01,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:01,476 INFO L225 Difference]: With dead ends: 230 [2023-11-06 22:43:01,476 INFO L226 Difference]: Without dead ends: 137 [2023-11-06 22:43:01,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:43:01,478 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 192 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:01,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 477 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:43:01,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-06 22:43:01,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 106. [2023-11-06 22:43:01,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 89 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:43:01,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 147 transitions. [2023-11-06 22:43:01,499 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 147 transitions. Word has length 120 [2023-11-06 22:43:01,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:01,501 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 147 transitions. [2023-11-06 22:43:01,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:01,501 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 147 transitions. [2023-11-06 22:43:01,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 22:43:01,503 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:01,503 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:01,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:43:01,504 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:01,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:01,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1480347512, now seen corresponding path program 1 times [2023-11-06 22:43:01,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:01,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686506349] [2023-11-06 22:43:01,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:01,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:01,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:01,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:01,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:01,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:01,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:43:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:01,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:43:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:01,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:01,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:01,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:01,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:01,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:01,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:01,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:01,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:01,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:43:01,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:01,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686506349] [2023-11-06 22:43:01,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686506349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:01,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:01,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:43:01,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50676528] [2023-11-06 22:43:01,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:01,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:43:01,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:01,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:43:01,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:43:01,740 INFO L87 Difference]: Start difference. First operand 106 states and 147 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:01,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:01,764 INFO L93 Difference]: Finished difference Result 227 states and 317 transitions. [2023-11-06 22:43:01,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:43:01,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2023-11-06 22:43:01,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:01,766 INFO L225 Difference]: With dead ends: 227 [2023-11-06 22:43:01,767 INFO L226 Difference]: Without dead ends: 124 [2023-11-06 22:43:01,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:43:01,768 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 33 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:01,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 273 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:43:01,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-06 22:43:01,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2023-11-06 22:43:01,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.303370786516854) internal successors, (116), 89 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:43:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 146 transitions. [2023-11-06 22:43:01,785 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 146 transitions. Word has length 122 [2023-11-06 22:43:01,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:01,786 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 146 transitions. [2023-11-06 22:43:01,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:01,787 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2023-11-06 22:43:01,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 22:43:01,788 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:01,789 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:01,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:43:01,789 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:01,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:01,790 INFO L85 PathProgramCache]: Analyzing trace with hash -725682600, now seen corresponding path program 1 times [2023-11-06 22:43:01,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:01,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56499797] [2023-11-06 22:43:01,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:01,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:02,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:02,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:02,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:02,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:02,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:43:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:02,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:43:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:02,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:02,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:02,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:02,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:02,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:02,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:02,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:02,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:02,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:43:02,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:02,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56499797] [2023-11-06 22:43:02,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56499797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:02,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:02,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:43:02,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627061460] [2023-11-06 22:43:02,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:02,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:43:02,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:02,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:43:02,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:43:02,393 INFO L87 Difference]: Start difference. First operand 106 states and 146 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:02,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:02,785 INFO L93 Difference]: Finished difference Result 211 states and 291 transitions. [2023-11-06 22:43:02,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:43:02,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2023-11-06 22:43:02,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:02,788 INFO L225 Difference]: With dead ends: 211 [2023-11-06 22:43:02,788 INFO L226 Difference]: Without dead ends: 108 [2023-11-06 22:43:02,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:43:02,789 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 94 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:02,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 374 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:43:02,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-06 22:43:02,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2023-11-06 22:43:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 89 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:43:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2023-11-06 22:43:02,810 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 122 [2023-11-06 22:43:02,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:02,811 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2023-11-06 22:43:02,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:02,811 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2023-11-06 22:43:02,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:43:02,813 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:02,813 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:02,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:43:02,813 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:02,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:02,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1213675190, now seen corresponding path program 1 times [2023-11-06 22:43:02,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:02,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358046578] [2023-11-06 22:43:02,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:02,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:43:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:43:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,102 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:43:03,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:03,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358046578] [2023-11-06 22:43:03,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358046578] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:03,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:03,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:43:03,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763280329] [2023-11-06 22:43:03,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:03,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:43:03,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:03,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:43:03,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:43:03,105 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:03,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:03,214 INFO L93 Difference]: Finished difference Result 229 states and 315 transitions. [2023-11-06 22:43:03,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:43:03,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-06 22:43:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:03,216 INFO L225 Difference]: With dead ends: 229 [2023-11-06 22:43:03,216 INFO L226 Difference]: Without dead ends: 126 [2023-11-06 22:43:03,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:43:03,217 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 98 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:03,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 631 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:43:03,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-06 22:43:03,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 110. [2023-11-06 22:43:03,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.2795698924731183) internal successors, (119), 93 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:43:03,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 149 transitions. [2023-11-06 22:43:03,232 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 149 transitions. Word has length 124 [2023-11-06 22:43:03,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:03,232 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 149 transitions. [2023-11-06 22:43:03,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:03,233 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2023-11-06 22:43:03,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:43:03,234 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:03,234 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:03,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:43:03,235 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:03,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:03,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1518996242, now seen corresponding path program 1 times [2023-11-06 22:43:03,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:03,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861611977] [2023-11-06 22:43:03,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:03,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:43:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:43:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,380 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:43:03,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:03,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861611977] [2023-11-06 22:43:03,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861611977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:03,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:03,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:43:03,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019951415] [2023-11-06 22:43:03,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:03,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:43:03,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:03,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:43:03,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:43:03,384 INFO L87 Difference]: Start difference. First operand 110 states and 149 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:03,411 INFO L93 Difference]: Finished difference Result 219 states and 299 transitions. [2023-11-06 22:43:03,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:43:03,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-06 22:43:03,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:03,416 INFO L225 Difference]: With dead ends: 219 [2023-11-06 22:43:03,416 INFO L226 Difference]: Without dead ends: 112 [2023-11-06 22:43:03,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:43:03,419 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:03,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 252 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:43:03,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-06 22:43:03,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-11-06 22:43:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:43:03,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 151 transitions. [2023-11-06 22:43:03,438 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 151 transitions. Word has length 124 [2023-11-06 22:43:03,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:03,439 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 151 transitions. [2023-11-06 22:43:03,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:03,439 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 151 transitions. [2023-11-06 22:43:03,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:43:03,441 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:03,441 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:03,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:43:03,441 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:03,442 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:03,442 INFO L85 PathProgramCache]: Analyzing trace with hash 507878992, now seen corresponding path program 1 times [2023-11-06 22:43:03,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:03,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761278490] [2023-11-06 22:43:03,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:03,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:04,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:04,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:04,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:04,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:04,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:43:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:04,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:43:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:04,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:04,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:04,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:04,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:04,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:04,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:04,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:04,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:04,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:04,568 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:43:04,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:04,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761278490] [2023-11-06 22:43:04,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761278490] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:04,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:04,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:43:04,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81688705] [2023-11-06 22:43:04,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:04,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:43:04,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:04,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:43:04,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:43:04,571 INFO L87 Difference]: Start difference. First operand 112 states and 151 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:05,213 INFO L93 Difference]: Finished difference Result 260 states and 348 transitions. [2023-11-06 22:43:05,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:43:05,214 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-06 22:43:05,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:05,215 INFO L225 Difference]: With dead ends: 260 [2023-11-06 22:43:05,215 INFO L226 Difference]: Without dead ends: 151 [2023-11-06 22:43:05,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:43:05,216 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 223 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:05,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 503 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:43:05,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-06 22:43:05,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 111. [2023-11-06 22:43:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:43:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 149 transitions. [2023-11-06 22:43:05,233 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 149 transitions. Word has length 124 [2023-11-06 22:43:05,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:05,234 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 149 transitions. [2023-11-06 22:43:05,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:05,234 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 149 transitions. [2023-11-06 22:43:05,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-06 22:43:05,236 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:05,236 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:05,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:43:05,236 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:05,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:05,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1018530735, now seen corresponding path program 1 times [2023-11-06 22:43:05,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:05,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973268444] [2023-11-06 22:43:05,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:05,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:05,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:05,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:05,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:05,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:05,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:43:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:05,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:43:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:05,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:05,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:05,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:05,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:05,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:05,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:05,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:05,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:05,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:43:05,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:05,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973268444] [2023-11-06 22:43:05,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973268444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:05,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:05,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:43:05,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615575658] [2023-11-06 22:43:05,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:05,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:43:05,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:05,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:43:05,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:43:05,963 INFO L87 Difference]: Start difference. First operand 111 states and 149 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:06,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:06,377 INFO L93 Difference]: Finished difference Result 264 states and 355 transitions. [2023-11-06 22:43:06,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:43:06,378 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-11-06 22:43:06,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:06,379 INFO L225 Difference]: With dead ends: 264 [2023-11-06 22:43:06,380 INFO L226 Difference]: Without dead ends: 156 [2023-11-06 22:43:06,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:43:06,381 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 209 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:06,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 420 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:43:06,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-06 22:43:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 113. [2023-11-06 22:43:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.2604166666666667) internal successors, (121), 96 states have internal predecessors, (121), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:43:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 151 transitions. [2023-11-06 22:43:06,398 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 151 transitions. Word has length 126 [2023-11-06 22:43:06,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:06,399 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 151 transitions. [2023-11-06 22:43:06,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:06,400 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 151 transitions. [2023-11-06 22:43:06,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-06 22:43:06,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:06,401 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:06,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:43:06,402 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:06,402 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:06,402 INFO L85 PathProgramCache]: Analyzing trace with hash -470688275, now seen corresponding path program 1 times [2023-11-06 22:43:06,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:06,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131313407] [2023-11-06 22:43:06,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:06,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:08,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:08,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:08,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:08,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:08,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:43:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:08,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:43:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:08,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:08,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:08,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:08,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:08,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:08,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:08,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:08,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:08,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:08,308 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:43:08,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:08,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131313407] [2023-11-06 22:43:08,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131313407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:08,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:08,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:43:08,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648971749] [2023-11-06 22:43:08,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:08,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:43:08,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:08,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:43:08,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:43:08,311 INFO L87 Difference]: Start difference. First operand 113 states and 151 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:08,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:08,778 INFO L93 Difference]: Finished difference Result 225 states and 301 transitions. [2023-11-06 22:43:08,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:43:08,779 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-11-06 22:43:08,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:08,780 INFO L225 Difference]: With dead ends: 225 [2023-11-06 22:43:08,780 INFO L226 Difference]: Without dead ends: 115 [2023-11-06 22:43:08,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:43:08,782 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 175 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:08,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 341 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:43:08,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-06 22:43:08,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2023-11-06 22:43:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.25) internal successors, (120), 96 states have internal predecessors, (120), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:43:08,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 150 transitions. [2023-11-06 22:43:08,802 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 150 transitions. Word has length 126 [2023-11-06 22:43:08,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:08,803 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 150 transitions. [2023-11-06 22:43:08,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:08,804 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 150 transitions. [2023-11-06 22:43:08,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-06 22:43:08,806 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:08,806 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:08,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:43:08,807 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:08,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:08,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1670491939, now seen corresponding path program 1 times [2023-11-06 22:43:08,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:08,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007340965] [2023-11-06 22:43:08,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:08,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:10,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:10,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:10,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:10,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:10,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:43:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:10,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:43:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:10,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:10,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:10,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:10,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:10,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:10,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:10,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:10,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:10,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:10,968 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:43:10,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:10,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007340965] [2023-11-06 22:43:10,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007340965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:10,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:10,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 22:43:10,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934135359] [2023-11-06 22:43:10,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:10,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:43:10,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:10,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:43:10,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:43:10,972 INFO L87 Difference]: Start difference. First operand 113 states and 150 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2023-11-06 22:43:12,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:12,116 INFO L93 Difference]: Finished difference Result 311 states and 409 transitions. [2023-11-06 22:43:12,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:43:12,117 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 128 [2023-11-06 22:43:12,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:12,119 INFO L225 Difference]: With dead ends: 311 [2023-11-06 22:43:12,119 INFO L226 Difference]: Without dead ends: 201 [2023-11-06 22:43:12,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2023-11-06 22:43:12,120 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 614 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:12,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 675 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:43:12,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-11-06 22:43:12,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 143. [2023-11-06 22:43:12,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 125 states have (on average 1.24) internal successors, (155), 125 states have internal predecessors, (155), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:43:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 185 transitions. [2023-11-06 22:43:12,145 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 185 transitions. Word has length 128 [2023-11-06 22:43:12,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:12,145 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 185 transitions. [2023-11-06 22:43:12,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2023-11-06 22:43:12,146 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 185 transitions. [2023-11-06 22:43:12,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-06 22:43:12,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:12,148 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:12,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:43:12,148 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:12,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:12,149 INFO L85 PathProgramCache]: Analyzing trace with hash -905662791, now seen corresponding path program 1 times [2023-11-06 22:43:12,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:12,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743428701] [2023-11-06 22:43:12,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:12,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:12,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:12,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:12,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:12,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:12,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:43:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:12,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:43:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:12,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:12,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:12,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:12,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:12,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:12,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:12,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:12,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:12,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:43:12,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:12,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743428701] [2023-11-06 22:43:12,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743428701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:12,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:12,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:43:12,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893019063] [2023-11-06 22:43:12,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:12,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:43:12,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:12,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:43:12,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:43:12,604 INFO L87 Difference]: Start difference. First operand 143 states and 185 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:12,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:12,996 INFO L93 Difference]: Finished difference Result 340 states and 442 transitions. [2023-11-06 22:43:12,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:43:12,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2023-11-06 22:43:12,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:12,999 INFO L225 Difference]: With dead ends: 340 [2023-11-06 22:43:12,999 INFO L226 Difference]: Without dead ends: 200 [2023-11-06 22:43:13,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:43:13,000 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 192 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:13,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 436 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:43:13,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-11-06 22:43:13,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 165. [2023-11-06 22:43:13,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 147 states have (on average 1.2380952380952381) internal successors, (182), 147 states have internal predecessors, (182), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:43:13,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2023-11-06 22:43:13,032 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 129 [2023-11-06 22:43:13,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:13,033 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2023-11-06 22:43:13,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2023-11-06 22:43:13,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-06 22:43:13,036 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:13,036 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:13,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:43:13,036 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:13,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:13,037 INFO L85 PathProgramCache]: Analyzing trace with hash -967702405, now seen corresponding path program 1 times [2023-11-06 22:43:13,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:13,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472356463] [2023-11-06 22:43:13,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:13,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:13,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:13,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:13,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:13,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:13,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:43:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:13,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:43:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:13,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:13,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:13,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:13,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:13,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:13,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:13,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:13,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:13,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:43:13,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:13,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472356463] [2023-11-06 22:43:13,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472356463] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:13,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:13,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:43:13,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43425382] [2023-11-06 22:43:13,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:13,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:43:13,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:13,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:43:13,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:43:13,681 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:14,082 INFO L93 Difference]: Finished difference Result 368 states and 475 transitions. [2023-11-06 22:43:14,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:43:14,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2023-11-06 22:43:14,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:14,085 INFO L225 Difference]: With dead ends: 368 [2023-11-06 22:43:14,085 INFO L226 Difference]: Without dead ends: 206 [2023-11-06 22:43:14,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:43:14,088 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 195 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:14,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 427 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:43:14,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-11-06 22:43:14,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 149. [2023-11-06 22:43:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.2290076335877862) internal successors, (161), 131 states have internal predecessors, (161), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:43:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 191 transitions. [2023-11-06 22:43:14,115 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 191 transitions. Word has length 129 [2023-11-06 22:43:14,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:14,116 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 191 transitions. [2023-11-06 22:43:14,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:14,116 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 191 transitions. [2023-11-06 22:43:14,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-06 22:43:14,118 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:14,118 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:14,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:43:14,119 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:14,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:14,119 INFO L85 PathProgramCache]: Analyzing trace with hash 829750658, now seen corresponding path program 1 times [2023-11-06 22:43:14,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:14,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385601404] [2023-11-06 22:43:14,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:14,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:15,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:15,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:15,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:15,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:15,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:43:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:15,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:43:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:15,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:15,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:15,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:15,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:15,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:15,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:15,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:15,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:15,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:15,450 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:43:15,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:15,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385601404] [2023-11-06 22:43:15,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385601404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:15,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:15,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 22:43:15,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493096627] [2023-11-06 22:43:15,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:15,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:43:15,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:15,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:43:15,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:43:15,456 INFO L87 Difference]: Start difference. First operand 149 states and 191 transitions. Second operand has 13 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-06 22:43:16,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:16,349 INFO L93 Difference]: Finished difference Result 283 states and 365 transitions. [2023-11-06 22:43:16,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:43:16,350 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 130 [2023-11-06 22:43:16,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:16,353 INFO L225 Difference]: With dead ends: 283 [2023-11-06 22:43:16,353 INFO L226 Difference]: Without dead ends: 281 [2023-11-06 22:43:16,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2023-11-06 22:43:16,354 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 239 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:16,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 872 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:43:16,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-11-06 22:43:16,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 188. [2023-11-06 22:43:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 170 states have (on average 1.2) internal successors, (204), 170 states have internal predecessors, (204), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:43:16,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 234 transitions. [2023-11-06 22:43:16,389 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 234 transitions. Word has length 130 [2023-11-06 22:43:16,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:16,390 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 234 transitions. [2023-11-06 22:43:16,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-06 22:43:16,390 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 234 transitions. [2023-11-06 22:43:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-06 22:43:16,392 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:16,392 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:16,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:43:16,393 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:16,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:16,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1060491747, now seen corresponding path program 1 times [2023-11-06 22:43:16,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:16,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769976259] [2023-11-06 22:43:16,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:16,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:16,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:16,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:16,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:16,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:43:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:43:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,060 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:43:17,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:17,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769976259] [2023-11-06 22:43:17,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769976259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:17,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:17,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:43:17,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595811145] [2023-11-06 22:43:17,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:17,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:43:17,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:17,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:43:17,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:43:17,064 INFO L87 Difference]: Start difference. First operand 188 states and 234 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:17,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:17,393 INFO L93 Difference]: Finished difference Result 407 states and 510 transitions. [2023-11-06 22:43:17,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:43:17,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2023-11-06 22:43:17,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:17,396 INFO L225 Difference]: With dead ends: 407 [2023-11-06 22:43:17,396 INFO L226 Difference]: Without dead ends: 222 [2023-11-06 22:43:17,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:43:17,398 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 195 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:17,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 324 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:43:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-11-06 22:43:17,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 188. [2023-11-06 22:43:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 170 states have (on average 1.188235294117647) internal successors, (202), 170 states have internal predecessors, (202), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:43:17,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 232 transitions. [2023-11-06 22:43:17,437 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 232 transitions. Word has length 130 [2023-11-06 22:43:17,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:17,437 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 232 transitions. [2023-11-06 22:43:17,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 232 transitions. [2023-11-06 22:43:17,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 22:43:17,440 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:17,440 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:17,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:43:17,441 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:17,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:17,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1621895359, now seen corresponding path program 1 times [2023-11-06 22:43:17,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:17,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961996938] [2023-11-06 22:43:17,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:17,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:43:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:43:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:43:17,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:17,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961996938] [2023-11-06 22:43:17,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961996938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:17,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:17,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:43:17,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772769714] [2023-11-06 22:43:17,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:17,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:43:17,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:17,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:43:17,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:43:17,798 INFO L87 Difference]: Start difference. First operand 188 states and 232 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:18,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:18,019 INFO L93 Difference]: Finished difference Result 424 states and 530 transitions. [2023-11-06 22:43:18,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:43:18,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2023-11-06 22:43:18,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:18,021 INFO L225 Difference]: With dead ends: 424 [2023-11-06 22:43:18,021 INFO L226 Difference]: Without dead ends: 239 [2023-11-06 22:43:18,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:43:18,022 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 94 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:18,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 388 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:43:18,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-11-06 22:43:18,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 191. [2023-11-06 22:43:18,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 173 states have (on average 1.1849710982658959) internal successors, (205), 173 states have internal predecessors, (205), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:43:18,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 235 transitions. [2023-11-06 22:43:18,052 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 235 transitions. Word has length 131 [2023-11-06 22:43:18,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:18,052 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 235 transitions. [2023-11-06 22:43:18,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:18,053 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 235 transitions. [2023-11-06 22:43:18,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 22:43:18,055 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:18,055 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:18,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:43:18,056 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:18,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:18,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1228868349, now seen corresponding path program 1 times [2023-11-06 22:43:18,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:18,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172130394] [2023-11-06 22:43:18,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:18,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:43:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:43:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,299 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:43:18,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:18,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172130394] [2023-11-06 22:43:18,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172130394] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:18,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:18,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:43:18,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673232363] [2023-11-06 22:43:18,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:18,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:43:18,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:18,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:43:18,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:43:18,303 INFO L87 Difference]: Start difference. First operand 191 states and 235 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:18,399 INFO L93 Difference]: Finished difference Result 395 states and 489 transitions. [2023-11-06 22:43:18,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:43:18,399 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2023-11-06 22:43:18,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:18,401 INFO L225 Difference]: With dead ends: 395 [2023-11-06 22:43:18,401 INFO L226 Difference]: Without dead ends: 207 [2023-11-06 22:43:18,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:43:18,403 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 76 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:18,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 734 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:43:18,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-11-06 22:43:18,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 188. [2023-11-06 22:43:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 170 states have (on average 1.1823529411764706) internal successors, (201), 170 states have internal predecessors, (201), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:43:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 231 transitions. [2023-11-06 22:43:18,431 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 231 transitions. Word has length 131 [2023-11-06 22:43:18,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:18,432 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 231 transitions. [2023-11-06 22:43:18,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:18,432 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 231 transitions. [2023-11-06 22:43:18,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-06 22:43:18,434 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:18,434 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:18,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:43:18,435 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:18,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:18,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1323025862, now seen corresponding path program 1 times [2023-11-06 22:43:18,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:18,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810464771] [2023-11-06 22:43:18,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:18,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:43:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:43:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:43:18,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:18,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810464771] [2023-11-06 22:43:18,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810464771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:18,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:18,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:43:18,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609588644] [2023-11-06 22:43:18,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:18,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:43:18,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:18,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:43:18,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:43:18,899 INFO L87 Difference]: Start difference. First operand 188 states and 231 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:19,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:19,044 INFO L93 Difference]: Finished difference Result 339 states and 419 transitions. [2023-11-06 22:43:19,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:43:19,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2023-11-06 22:43:19,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:19,047 INFO L225 Difference]: With dead ends: 339 [2023-11-06 22:43:19,047 INFO L226 Difference]: Without dead ends: 154 [2023-11-06 22:43:19,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:43:19,048 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:19,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 403 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:43:19,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-06 22:43:19,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2023-11-06 22:43:19,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 136 states have (on average 1.1691176470588236) internal successors, (159), 136 states have internal predecessors, (159), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:43:19,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 189 transitions. [2023-11-06 22:43:19,076 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 189 transitions. Word has length 132 [2023-11-06 22:43:19,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:19,077 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 189 transitions. [2023-11-06 22:43:19,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:19,077 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 189 transitions. [2023-11-06 22:43:19,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-06 22:43:19,079 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:19,079 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:19,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:43:19,079 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:19,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:19,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1667785729, now seen corresponding path program 1 times [2023-11-06 22:43:19,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:19,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579884692] [2023-11-06 22:43:19,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:19,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:20,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:20,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:20,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:20,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:20,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:43:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:20,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:43:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:20,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:20,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:20,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:20,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:20,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:20,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:20,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:20,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:20,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:20,861 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-06 22:43:20,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:20,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579884692] [2023-11-06 22:43:20,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579884692] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:43:20,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088325184] [2023-11-06 22:43:20,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:20,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:43:20,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:43:20,867 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:43:20,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:43:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:21,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-06 22:43:21,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:43:22,344 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:43:23,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:43:23,021 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:43:23,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:43:23,362 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:43:23,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:43:23,755 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:43:24,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:43:24,082 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:43:24,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:43:24,359 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:43:24,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:43:24,653 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2023-11-06 22:43:24,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:43:24,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:43:24,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:43:24,749 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2023-11-06 22:43:24,898 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-06 22:43:24,898 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:43:25,096 WARN L839 $PredicateComparison]: unable to prove that (forall ((~var_1_1_Pointer~0.offset Int) (v_ArrVal_989 (Array Int Int))) (= (mod (select (select (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset (select (select |c_#memory_int| c_~var_1_5_Pointer~0.base) c_~var_1_5_Pointer~0.offset))) c_~var_1_8_Pointer~0.base v_ArrVal_989) c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) 256) 0)) is different from false [2023-11-06 22:43:25,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088325184] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:43:25,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:43:25,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2023-11-06 22:43:25,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545606713] [2023-11-06 22:43:25,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:43:25,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-06 22:43:25,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:25,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-06 22:43:25,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=862, Unknown=3, NotChecked=60, Total=1056 [2023-11-06 22:43:25,123 INFO L87 Difference]: Start difference. First operand 154 states and 189 transitions. Second operand has 29 states, 27 states have (on average 4.2592592592592595) internal successors, (115), 26 states have internal predecessors, (115), 14 states have call successors, (30), 8 states have call predecessors, (30), 9 states have return successors, (30), 14 states have call predecessors, (30), 14 states have call successors, (30) [2023-11-06 22:43:26,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:26,909 INFO L93 Difference]: Finished difference Result 272 states and 330 transitions. [2023-11-06 22:43:26,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:43:26,910 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 4.2592592592592595) internal successors, (115), 26 states have internal predecessors, (115), 14 states have call successors, (30), 8 states have call predecessors, (30), 9 states have return successors, (30), 14 states have call predecessors, (30), 14 states have call successors, (30) Word has length 132 [2023-11-06 22:43:26,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:26,911 INFO L225 Difference]: With dead ends: 272 [2023-11-06 22:43:26,911 INFO L226 Difference]: Without dead ends: 121 [2023-11-06 22:43:26,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=315, Invalid=1492, Unknown=3, NotChecked=82, Total=1892 [2023-11-06 22:43:26,914 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 238 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:26,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 511 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:43:26,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-06 22:43:26,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2023-11-06 22:43:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.1020408163265305) internal successors, (108), 98 states have internal predecessors, (108), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:43:26,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2023-11-06 22:43:26,948 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 132 [2023-11-06 22:43:26,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:26,950 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2023-11-06 22:43:26,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 4.2592592592592595) internal successors, (115), 26 states have internal predecessors, (115), 14 states have call successors, (30), 8 states have call predecessors, (30), 9 states have return successors, (30), 14 states have call predecessors, (30), 14 states have call successors, (30) [2023-11-06 22:43:26,951 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2023-11-06 22:43:26,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-06 22:43:26,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:26,952 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:26,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:43:27,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-06 22:43:27,160 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:27,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:27,161 INFO L85 PathProgramCache]: Analyzing trace with hash -953934379, now seen corresponding path program 1 times [2023-11-06 22:43:27,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:27,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059804310] [2023-11-06 22:43:27,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:27,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:27,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:27,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:27,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:27,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:27,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:43:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:27,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:43:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:27,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:27,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:27,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:27,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:27,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:27,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:27,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:27,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:27,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:27,600 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:43:27,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:27,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059804310] [2023-11-06 22:43:27,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059804310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:27,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:27,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:43:27,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663774681] [2023-11-06 22:43:27,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:27,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:43:27,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:27,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:43:27,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:43:27,606 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:27,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:27,733 INFO L93 Difference]: Finished difference Result 222 states and 261 transitions. [2023-11-06 22:43:27,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:43:27,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2023-11-06 22:43:27,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:27,734 INFO L225 Difference]: With dead ends: 222 [2023-11-06 22:43:27,735 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:43:27,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:43:27,737 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 13 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:27,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 277 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:43:27,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:43:27,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:43:27,739 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) [2023-11-06 22:43:27,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:43:27,739 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 133 [2023-11-06 22:43:27,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:27,739 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:43:27,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:43:27,740 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:43:27,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:43:27,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:43:27,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 22:43:27,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:43:46,368 WARN L293 SmtUtils]: Spent 18.55s on a formula simplification. DAG size of input: 200 DAG size of output: 169 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 22:43:51,707 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (and (<= 11 |~#var_1_9~0.base|) (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (not (= ~var_1_13_Pointer~0.base ~var_1_12_Pointer~0.base)) (not (= |~#var_1_13~0.base| |~#var_1_11~0.base|)) (<= 8 ~var_1_6_Pointer~0.base) (not (= ~var_1_1_Pointer~0.base ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.base |~#var_1_11~0.base|) (not (= 7 ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.offset |~#var_1_11~0.offset|) (not (= ~var_1_12_Pointer~0.base ~var_1_4_Pointer~0.base)) (= 7 ~var_1_5_Pointer~0.base) (not (= ~var_1_8_Pointer~0.base |~#var_1_13~0.base|)) (<= ~var_1_4_Pointer~0.base 6) (= 7 |~#var_1_5~0.base|) (<= 9 |~#var_1_7~0.base|) (<= ~var_1_1_Pointer~0.base 4) (not (= ~var_1_8_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_11_Pointer~0.base)) (<= 15 |~#var_1_13~0.base|) (not (= ~var_1_8_Pointer~0.base ~var_1_11_Pointer~0.base)) (= ~var_1_5_Pointer~0.offset 0) (<= 12 |~#var_1_10~0.base|) (<= 10 ~var_1_8_Pointer~0.base) (not (= ~var_1_12_Pointer~0.base ~var_1_8_Pointer~0.base)) (<= 13 |~#var_1_11~0.base|) (= |~#var_1_5~0.offset| 0) (= |~#var_1_10~0.offset| 0)) [2023-11-06 22:43:51,707 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2023-11-06 22:43:51,708 INFO L895 garLoopResultBuilder]: At program point L118-2(lines 118 124) the Hoare annotation is: (and (<= 11 |~#var_1_9~0.base|) (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (not (= ~var_1_13_Pointer~0.base ~var_1_12_Pointer~0.base)) (not (= |~#var_1_13~0.base| |~#var_1_11~0.base|)) (<= 8 ~var_1_6_Pointer~0.base) (not (= ~var_1_1_Pointer~0.base ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.base |~#var_1_11~0.base|) (not (= 7 ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.offset |~#var_1_11~0.offset|) (not (= ~var_1_12_Pointer~0.base ~var_1_4_Pointer~0.base)) (= 7 ~var_1_5_Pointer~0.base) (not (= ~var_1_8_Pointer~0.base |~#var_1_13~0.base|)) (<= ~var_1_4_Pointer~0.base 6) (= 7 |~#var_1_5~0.base|) (<= 9 |~#var_1_7~0.base|) (<= ~var_1_1_Pointer~0.base 4) (not (= ~var_1_8_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_11_Pointer~0.base)) (<= 15 |~#var_1_13~0.base|) (not (= ~var_1_8_Pointer~0.base ~var_1_11_Pointer~0.base)) (= ~var_1_5_Pointer~0.offset 0) (<= 12 |~#var_1_10~0.base|) (<= 10 ~var_1_8_Pointer~0.base) (not (= ~var_1_12_Pointer~0.base ~var_1_8_Pointer~0.base)) (<= 13 |~#var_1_11~0.base|) (= |~#var_1_5~0.offset| 0) (= |~#var_1_10~0.offset| 0)) [2023-11-06 22:43:51,708 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:43:51,708 INFO L899 garLoopResultBuilder]: For program point L118-3(lines 118 124) no Hoare annotation was computed. [2023-11-06 22:43:51,708 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:43:51,708 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (and (<= 11 |~#var_1_9~0.base|) (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (not (= ~var_1_13_Pointer~0.base ~var_1_12_Pointer~0.base)) (not (= |~#var_1_13~0.base| |~#var_1_11~0.base|)) (= .cse0 (select (select |#memory_int| 7) 0)) (<= 8 ~var_1_6_Pointer~0.base) (not (= ~var_1_1_Pointer~0.base ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.base |~#var_1_11~0.base|) (not (= 7 ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.offset |~#var_1_11~0.offset|) (not (= ~var_1_12_Pointer~0.base ~var_1_4_Pointer~0.base)) (= 7 ~var_1_5_Pointer~0.base) (not (= ~var_1_8_Pointer~0.base |~#var_1_13~0.base|)) (<= ~var_1_4_Pointer~0.base 6) (= 7 |~#var_1_5~0.base|) (<= 9 |~#var_1_7~0.base|) (<= ~var_1_1_Pointer~0.base 4) (not (= ~var_1_8_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_11_Pointer~0.base)) (<= 15 |~#var_1_13~0.base|) (not (= ~var_1_8_Pointer~0.base ~var_1_11_Pointer~0.base)) (= ~var_1_5_Pointer~0.offset 0) (<= 12 |~#var_1_10~0.base|) (<= 10 ~var_1_8_Pointer~0.base) (<= .cse0 (* (div .cse0 256) 256)) (not (= ~var_1_12_Pointer~0.base ~var_1_8_Pointer~0.base)) (<= 13 |~#var_1_11~0.base|) (= |~#var_1_5~0.offset| 0) (= |~#var_1_10~0.offset| 0))) [2023-11-06 22:43:51,709 INFO L895 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |~#var_1_11~0.base|) ~var_1_11_Pointer~0.offset))) (and (<= 11 |~#var_1_9~0.base|) (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (not (= ~var_1_13_Pointer~0.base ~var_1_12_Pointer~0.base)) (not (= |~#var_1_13~0.base| |~#var_1_11~0.base|)) (<= 8 ~var_1_6_Pointer~0.base) (not (= ~var_1_1_Pointer~0.base ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.base |~#var_1_11~0.base|) (not (= 7 ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.offset |~#var_1_11~0.offset|) (not (= ~var_1_12_Pointer~0.base ~var_1_4_Pointer~0.base)) (= 7 ~var_1_5_Pointer~0.base) (not (= ~var_1_8_Pointer~0.base |~#var_1_13~0.base|)) (<= ~var_1_4_Pointer~0.base 6) (= 7 |~#var_1_5~0.base|) (<= 9 |~#var_1_7~0.base|) (<= ~var_1_1_Pointer~0.base 4) (not (= ~var_1_8_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_11_Pointer~0.base)) (<= 15 |~#var_1_13~0.base|) (not (= ~var_1_8_Pointer~0.base ~var_1_11_Pointer~0.base)) (= ~var_1_5_Pointer~0.offset 0) (<= 12 |~#var_1_10~0.base|) (<= 10 ~var_1_8_Pointer~0.base) (<= 0 (+ .cse0 128)) (not (= ~var_1_12_Pointer~0.base ~var_1_8_Pointer~0.base)) (<= 13 |~#var_1_11~0.base|) (= |~#var_1_5~0.offset| 0) (= |~#var_1_10~0.offset| 0) (<= .cse0 127) (<= (mod (select (select |#memory_int| 7) 0) 256) 0))) [2023-11-06 22:43:51,709 INFO L899 garLoopResultBuilder]: For program point L102-1(line 102) no Hoare annotation was computed. [2023-11-06 22:43:51,709 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 71) no Hoare annotation was computed. [2023-11-06 22:43:51,709 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (and (<= 11 |~#var_1_9~0.base|) (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (not (= ~var_1_13_Pointer~0.base ~var_1_12_Pointer~0.base)) (not (= |~#var_1_13~0.base| |~#var_1_11~0.base|)) (<= 8 ~var_1_6_Pointer~0.base) (not (= ~var_1_1_Pointer~0.base ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.base |~#var_1_11~0.base|) (not (= 7 ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.offset |~#var_1_11~0.offset|) (not (= ~var_1_12_Pointer~0.base ~var_1_4_Pointer~0.base)) (= 7 ~var_1_5_Pointer~0.base) (not (= ~var_1_8_Pointer~0.base |~#var_1_13~0.base|)) (<= ~var_1_4_Pointer~0.base 6) (= 7 |~#var_1_5~0.base|) (<= 9 |~#var_1_7~0.base|) (<= ~var_1_1_Pointer~0.base 4) (not (= ~var_1_8_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_11_Pointer~0.base)) (<= 15 |~#var_1_13~0.base|) (not (= ~var_1_8_Pointer~0.base ~var_1_11_Pointer~0.base)) (= ~var_1_5_Pointer~0.offset 0) (<= 12 |~#var_1_10~0.base|) (<= 10 ~var_1_8_Pointer~0.base) (not (= ~var_1_12_Pointer~0.base ~var_1_8_Pointer~0.base)) (<= 13 |~#var_1_11~0.base|) (= |~#var_1_5~0.offset| 0) (= |~#var_1_10~0.offset| 0)) [2023-11-06 22:43:51,709 INFO L899 garLoopResultBuilder]: For program point L86-1(line 86) no Hoare annotation was computed. [2023-11-06 22:43:51,710 INFO L895 garLoopResultBuilder]: At program point L103(line 103) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |~#var_1_11~0.base|) ~var_1_11_Pointer~0.offset))) (and (<= 11 |~#var_1_9~0.base|) (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (not (= ~var_1_13_Pointer~0.base ~var_1_12_Pointer~0.base)) (not (= |~#var_1_13~0.base| |~#var_1_11~0.base|)) (<= 8 ~var_1_6_Pointer~0.base) (not (= ~var_1_1_Pointer~0.base ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.base |~#var_1_11~0.base|) (not (= 7 ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.offset |~#var_1_11~0.offset|) (not (= ~var_1_12_Pointer~0.base ~var_1_4_Pointer~0.base)) (= 7 ~var_1_5_Pointer~0.base) (not (= ~var_1_8_Pointer~0.base |~#var_1_13~0.base|)) (<= ~var_1_4_Pointer~0.base 6) (= 7 |~#var_1_5~0.base|) (<= 9 |~#var_1_7~0.base|) (<= ~var_1_1_Pointer~0.base 4) (not (= ~var_1_8_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_11_Pointer~0.base)) (<= 15 |~#var_1_13~0.base|) (not (= ~var_1_8_Pointer~0.base ~var_1_11_Pointer~0.base)) (= ~var_1_5_Pointer~0.offset 0) (<= 12 |~#var_1_10~0.base|) (<= 10 ~var_1_8_Pointer~0.base) (<= 0 (+ .cse0 128)) (not (= ~var_1_12_Pointer~0.base ~var_1_8_Pointer~0.base)) (<= 13 |~#var_1_11~0.base|) (= |~#var_1_5~0.offset| 0) (= |~#var_1_10~0.offset| 0) (<= .cse0 127) (<= (mod (select (select |#memory_int| 7) 0) 256) 0))) [2023-11-06 22:43:51,710 INFO L899 garLoopResultBuilder]: For program point L103-1(line 103) no Hoare annotation was computed. [2023-11-06 22:43:51,710 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-11-06 22:43:51,710 INFO L899 garLoopResultBuilder]: For program point L70-2(line 70) no Hoare annotation was computed. [2023-11-06 22:43:51,710 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (and (<= 11 |~#var_1_9~0.base|) (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (not (= ~var_1_13_Pointer~0.base ~var_1_12_Pointer~0.base)) (not (= |~#var_1_13~0.base| |~#var_1_11~0.base|)) (<= 8 ~var_1_6_Pointer~0.base) (not (= ~var_1_1_Pointer~0.base ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.base |~#var_1_11~0.base|) (not (= 7 ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.offset |~#var_1_11~0.offset|) (not (= ~var_1_12_Pointer~0.base ~var_1_4_Pointer~0.base)) (= 7 ~var_1_5_Pointer~0.base) (not (= ~var_1_8_Pointer~0.base |~#var_1_13~0.base|)) (<= ~var_1_4_Pointer~0.base 6) (= 7 |~#var_1_5~0.base|) (<= 9 |~#var_1_7~0.base|) (<= ~var_1_1_Pointer~0.base 4) (not (= ~var_1_8_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_11_Pointer~0.base)) (<= 15 |~#var_1_13~0.base|) (not (= ~var_1_8_Pointer~0.base ~var_1_11_Pointer~0.base)) (= ~var_1_5_Pointer~0.offset 0) (<= 12 |~#var_1_10~0.base|) (<= 10 ~var_1_8_Pointer~0.base) (not (= ~var_1_12_Pointer~0.base ~var_1_8_Pointer~0.base)) (<= 13 |~#var_1_11~0.base|) (= |~#var_1_5~0.offset| 0) (= |~#var_1_10~0.offset| 0)) [2023-11-06 22:43:51,710 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2023-11-06 22:43:51,711 INFO L895 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |~#var_1_11~0.base|) ~var_1_11_Pointer~0.offset))) (and (<= 11 |~#var_1_9~0.base|) (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (not (= ~var_1_13_Pointer~0.base ~var_1_12_Pointer~0.base)) (not (= |~#var_1_13~0.base| |~#var_1_11~0.base|)) (<= 8 ~var_1_6_Pointer~0.base) (not (= ~var_1_1_Pointer~0.base ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.base |~#var_1_11~0.base|) (not (= 7 ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.offset |~#var_1_11~0.offset|) (not (= ~var_1_12_Pointer~0.base ~var_1_4_Pointer~0.base)) (= 7 ~var_1_5_Pointer~0.base) (not (= ~var_1_8_Pointer~0.base |~#var_1_13~0.base|)) (<= ~var_1_4_Pointer~0.base 6) (= 7 |~#var_1_5~0.base|) (<= 9 |~#var_1_7~0.base|) (= (select (select |#memory_int| |~#var_1_13~0.base|) |~#var_1_13~0.offset|) |ULTIMATE.start_updateVariables_#t~mem59#1|) (<= ~var_1_1_Pointer~0.base 4) (not (= ~var_1_8_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_11_Pointer~0.base)) (<= 15 |~#var_1_13~0.base|) (not (= ~var_1_8_Pointer~0.base ~var_1_11_Pointer~0.base)) (= ~var_1_5_Pointer~0.offset 0) (<= 12 |~#var_1_10~0.base|) (<= 10 ~var_1_8_Pointer~0.base) (<= 0 (+ .cse0 128)) (not (= ~var_1_12_Pointer~0.base ~var_1_8_Pointer~0.base)) (<= 13 |~#var_1_11~0.base|) (= |~#var_1_5~0.offset| 0) (= |~#var_1_10~0.offset| 0) (<= .cse0 127) (<= (mod (select (select |#memory_int| 7) 0) 256) 0))) [2023-11-06 22:43:51,711 INFO L899 garLoopResultBuilder]: For program point L105-1(line 105) no Hoare annotation was computed. [2023-11-06 22:43:51,712 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (and (<= 11 |~#var_1_9~0.base|) (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (not (= ~var_1_13_Pointer~0.base ~var_1_12_Pointer~0.base)) (not (= |~#var_1_13~0.base| |~#var_1_11~0.base|)) (<= 8 ~var_1_6_Pointer~0.base) (not (= ~var_1_1_Pointer~0.base ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.base |~#var_1_11~0.base|) (not (= 7 ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.offset |~#var_1_11~0.offset|) (not (= ~var_1_12_Pointer~0.base ~var_1_4_Pointer~0.base)) (= 7 ~var_1_5_Pointer~0.base) (not (= ~var_1_8_Pointer~0.base |~#var_1_13~0.base|)) (<= ~var_1_4_Pointer~0.base 6) (= 7 |~#var_1_5~0.base|) (<= 9 |~#var_1_7~0.base|) (<= ~var_1_1_Pointer~0.base 4) (not (= ~var_1_8_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_11_Pointer~0.base)) (<= 15 |~#var_1_13~0.base|) (not (= ~var_1_8_Pointer~0.base ~var_1_11_Pointer~0.base)) (= ~var_1_5_Pointer~0.offset 0) (<= 12 |~#var_1_10~0.base|) (<= 10 ~var_1_8_Pointer~0.base) (not (= ~var_1_12_Pointer~0.base ~var_1_8_Pointer~0.base)) (<= 13 |~#var_1_11~0.base|) (= |~#var_1_5~0.offset| 0) (= |~#var_1_10~0.offset| 0)) [2023-11-06 22:43:51,712 INFO L899 garLoopResultBuilder]: For program point L89-1(line 89) no Hoare annotation was computed. [2023-11-06 22:43:51,712 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 66) no Hoare annotation was computed. [2023-11-06 22:43:51,712 INFO L895 garLoopResultBuilder]: At program point L106(line 106) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |~#var_1_11~0.base|) ~var_1_11_Pointer~0.offset))) (and (<= 11 |~#var_1_9~0.base|) (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (= (select (select |#memory_int| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset) |ULTIMATE.start_updateVariables_#t~mem60#1|) (not (= ~var_1_13_Pointer~0.base ~var_1_12_Pointer~0.base)) (not (= |~#var_1_13~0.base| |~#var_1_11~0.base|)) (<= 8 ~var_1_6_Pointer~0.base) (not (= ~var_1_1_Pointer~0.base ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.base |~#var_1_11~0.base|) (not (= 7 ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.offset |~#var_1_11~0.offset|) (not (= ~var_1_12_Pointer~0.base ~var_1_4_Pointer~0.base)) (= 7 ~var_1_5_Pointer~0.base) (not (= ~var_1_8_Pointer~0.base |~#var_1_13~0.base|)) (<= ~var_1_4_Pointer~0.base 6) (= 7 |~#var_1_5~0.base|) (<= 9 |~#var_1_7~0.base|) (<= ~var_1_1_Pointer~0.base 4) (not (= ~var_1_8_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_11_Pointer~0.base)) (<= 15 |~#var_1_13~0.base|) (not (= ~var_1_8_Pointer~0.base ~var_1_11_Pointer~0.base)) (= ~var_1_5_Pointer~0.offset 0) (<= 12 |~#var_1_10~0.base|) (<= 10 ~var_1_8_Pointer~0.base) (<= 0 (+ .cse0 128)) (not (= ~var_1_12_Pointer~0.base ~var_1_8_Pointer~0.base)) (<= 13 |~#var_1_11~0.base|) (= |~#var_1_5~0.offset| 0) (= |~#var_1_10~0.offset| 0) (<= .cse0 127) (<= (mod (select (select |#memory_int| 7) 0) 256) 0))) [2023-11-06 22:43:51,713 INFO L899 garLoopResultBuilder]: For program point L106-1(line 106) no Hoare annotation was computed. [2023-11-06 22:43:51,713 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 81) no Hoare annotation was computed. [2023-11-06 22:43:51,713 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2023-11-06 22:43:51,713 INFO L899 garLoopResultBuilder]: For program point L57-2(line 57) no Hoare annotation was computed. [2023-11-06 22:43:51,713 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 111 114) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (and (<= 11 |~#var_1_9~0.base|) (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (= (select (select |#memory_int| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset) (select (select |#memory_int| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset)) (not (= ~var_1_13_Pointer~0.base ~var_1_12_Pointer~0.base)) (not (= |~#var_1_13~0.base| |~#var_1_11~0.base|)) (= .cse0 (select (select |#memory_int| 7) 0)) (<= 8 ~var_1_6_Pointer~0.base) (not (= ~var_1_1_Pointer~0.base ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.base |~#var_1_11~0.base|) (not (= 7 ~var_1_12_Pointer~0.base)) (<= 1 |ULTIMATE.start_property_#res#1|) (= ~var_1_11_Pointer~0.offset |~#var_1_11~0.offset|) (not (= ~var_1_12_Pointer~0.base ~var_1_4_Pointer~0.base)) (= 7 ~var_1_5_Pointer~0.base) (not (= ~var_1_8_Pointer~0.base |~#var_1_13~0.base|)) (<= ~var_1_4_Pointer~0.base 6) (= 7 |~#var_1_5~0.base|) (<= 9 |~#var_1_7~0.base|) (<= ~var_1_1_Pointer~0.base 4) (not (= ~var_1_8_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_11_Pointer~0.base)) (<= 15 |~#var_1_13~0.base|) (not (= ~var_1_8_Pointer~0.base ~var_1_11_Pointer~0.base)) (= ~var_1_5_Pointer~0.offset 0) (<= 12 |~#var_1_10~0.base|) (<= 10 ~var_1_8_Pointer~0.base) (<= .cse0 (* (div .cse0 256) 256)) (not (= ~var_1_12_Pointer~0.base ~var_1_8_Pointer~0.base)) (<= 13 |~#var_1_11~0.base|) (= |~#var_1_5~0.offset| 0) (= |~#var_1_10~0.offset| 0))) [2023-11-06 22:43:51,714 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-11-06 22:43:51,714 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 74 78) no Hoare annotation was computed. [2023-11-06 22:43:51,714 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:43:51,714 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (and (<= 11 |~#var_1_9~0.base|) (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (not (= ~var_1_13_Pointer~0.base ~var_1_12_Pointer~0.base)) (not (= |~#var_1_13~0.base| |~#var_1_11~0.base|)) (<= 8 ~var_1_6_Pointer~0.base) (not (= ~var_1_1_Pointer~0.base ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.base |~#var_1_11~0.base|) (not (= 7 ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.offset |~#var_1_11~0.offset|) (not (= ~var_1_12_Pointer~0.base ~var_1_4_Pointer~0.base)) (= 7 ~var_1_5_Pointer~0.base) (not (= ~var_1_8_Pointer~0.base |~#var_1_13~0.base|)) (<= ~var_1_4_Pointer~0.base 6) (= 7 |~#var_1_5~0.base|) (<= 9 |~#var_1_7~0.base|) (<= ~var_1_1_Pointer~0.base 4) (not (= ~var_1_8_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_11_Pointer~0.base)) (<= 15 |~#var_1_13~0.base|) (not (= ~var_1_8_Pointer~0.base ~var_1_11_Pointer~0.base)) (= ~var_1_5_Pointer~0.offset 0) (<= 12 |~#var_1_10~0.base|) (<= 10 ~var_1_8_Pointer~0.base) (not (= ~var_1_12_Pointer~0.base ~var_1_8_Pointer~0.base)) (<= 13 |~#var_1_11~0.base|) (= |~#var_1_5~0.offset| 0) (= |~#var_1_10~0.offset| 0)) [2023-11-06 22:43:51,714 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-11-06 22:43:51,715 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 110) no Hoare annotation was computed. [2023-11-06 22:43:51,715 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-11-06 22:43:51,715 INFO L899 garLoopResultBuilder]: For program point L75-2(line 75) no Hoare annotation was computed. [2023-11-06 22:43:51,715 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (and (<= 11 |~#var_1_9~0.base|) (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (not (= ~var_1_13_Pointer~0.base ~var_1_12_Pointer~0.base)) (not (= |~#var_1_13~0.base| |~#var_1_11~0.base|)) (<= 8 ~var_1_6_Pointer~0.base) (not (= ~var_1_1_Pointer~0.base ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.base |~#var_1_11~0.base|) (not (= 7 ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.offset |~#var_1_11~0.offset|) (not (= ~var_1_12_Pointer~0.base ~var_1_4_Pointer~0.base)) (= 7 ~var_1_5_Pointer~0.base) (not (= ~var_1_8_Pointer~0.base |~#var_1_13~0.base|)) (<= ~var_1_4_Pointer~0.base 6) (= 7 |~#var_1_5~0.base|) (<= 9 |~#var_1_7~0.base|) (<= ~var_1_1_Pointer~0.base 4) (not (= ~var_1_8_Pointer~0.base ~var_1_10_Pointer~0.base)) (= |ULTIMATE.start_updateVariables_#t~mem40#1| (select (select |#memory_int| 7) 0)) (not (= ~var_1_12_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_11_Pointer~0.base)) (<= 15 |~#var_1_13~0.base|) (not (= ~var_1_8_Pointer~0.base ~var_1_11_Pointer~0.base)) (= ~var_1_5_Pointer~0.offset 0) (<= 12 |~#var_1_10~0.base|) (<= 10 ~var_1_8_Pointer~0.base) (not (= ~var_1_12_Pointer~0.base ~var_1_8_Pointer~0.base)) (<= 13 |~#var_1_11~0.base|) (= |~#var_1_5~0.offset| 0) (= |~#var_1_10~0.offset| 0)) [2023-11-06 22:43:51,715 INFO L899 garLoopResultBuilder]: For program point L92-1(line 92) no Hoare annotation was computed. [2023-11-06 22:43:51,716 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 65) no Hoare annotation was computed. [2023-11-06 22:43:51,716 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 115 126) the Hoare annotation is: false [2023-11-06 22:43:51,716 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-11-06 22:43:51,716 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:43:51,716 INFO L899 garLoopResultBuilder]: For program point L94-2(line 94) no Hoare annotation was computed. [2023-11-06 22:43:51,716 INFO L899 garLoopResultBuilder]: For program point L94-3(line 94) no Hoare annotation was computed. [2023-11-06 22:43:51,716 INFO L899 garLoopResultBuilder]: For program point L94-5(line 94) no Hoare annotation was computed. [2023-11-06 22:43:51,717 INFO L899 garLoopResultBuilder]: For program point L94-7(line 94) no Hoare annotation was computed. [2023-11-06 22:43:51,717 INFO L895 garLoopResultBuilder]: At program point L94-8(line 94) the Hoare annotation is: (and (<= 11 |~#var_1_9~0.base|) (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (not (= ~var_1_13_Pointer~0.base ~var_1_12_Pointer~0.base)) (not (= |~#var_1_13~0.base| |~#var_1_11~0.base|)) (<= 8 ~var_1_6_Pointer~0.base) (not (= ~var_1_1_Pointer~0.base ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.base |~#var_1_11~0.base|) (not (= 7 ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.offset |~#var_1_11~0.offset|) (not (= ~var_1_12_Pointer~0.base ~var_1_4_Pointer~0.base)) (= 7 ~var_1_5_Pointer~0.base) (not (= ~var_1_8_Pointer~0.base |~#var_1_13~0.base|)) (<= ~var_1_4_Pointer~0.base 6) (= 7 |~#var_1_5~0.base|) (<= 9 |~#var_1_7~0.base|) (<= ~var_1_1_Pointer~0.base 4) (not (= ~var_1_8_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_11_Pointer~0.base)) (<= 15 |~#var_1_13~0.base|) (not (= ~var_1_8_Pointer~0.base ~var_1_11_Pointer~0.base)) (= ~var_1_5_Pointer~0.offset 0) (<= 12 |~#var_1_10~0.base|) (<= 10 ~var_1_8_Pointer~0.base) (not (= ~var_1_12_Pointer~0.base ~var_1_8_Pointer~0.base)) (<= 13 |~#var_1_11~0.base|) (= |~#var_1_5~0.offset| 0) (= |~#var_1_10~0.offset| 0) (<= (mod (select (select |#memory_int| 7) 0) 256) 0)) [2023-11-06 22:43:51,717 INFO L899 garLoopResultBuilder]: For program point L94-9(line 94) no Hoare annotation was computed. [2023-11-06 22:43:51,717 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 64) no Hoare annotation was computed. [2023-11-06 22:43:51,717 INFO L899 garLoopResultBuilder]: For program point L62-2(lines 56 66) no Hoare annotation was computed. [2023-11-06 22:43:51,718 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,718 INFO L899 garLoopResultBuilder]: For program point L112-2(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,718 INFO L899 garLoopResultBuilder]: For program point L112-3(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,718 INFO L899 garLoopResultBuilder]: For program point L112-4(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,718 INFO L899 garLoopResultBuilder]: For program point L112-5(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,718 INFO L899 garLoopResultBuilder]: For program point L112-6(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,718 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:43:51,719 INFO L899 garLoopResultBuilder]: For program point L112-8(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,719 INFO L899 garLoopResultBuilder]: For program point L112-10(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,719 INFO L899 garLoopResultBuilder]: For program point L112-12(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,719 INFO L899 garLoopResultBuilder]: For program point L112-14(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,719 INFO L899 garLoopResultBuilder]: For program point L112-15(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,720 INFO L895 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: (and (<= 11 |~#var_1_9~0.base|) (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (not (= ~var_1_13_Pointer~0.base ~var_1_12_Pointer~0.base)) (not (= |~#var_1_13~0.base| |~#var_1_11~0.base|)) (<= 8 ~var_1_6_Pointer~0.base) (not (= ~var_1_1_Pointer~0.base ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.base |~#var_1_11~0.base|) (not (= 7 ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.offset |~#var_1_11~0.offset|) (not (= ~var_1_12_Pointer~0.base ~var_1_4_Pointer~0.base)) (= 7 ~var_1_5_Pointer~0.base) (not (= ~var_1_8_Pointer~0.base |~#var_1_13~0.base|)) (<= ~var_1_4_Pointer~0.base 6) (= 7 |~#var_1_5~0.base|) (<= 9 |~#var_1_7~0.base|) (<= ~var_1_1_Pointer~0.base 4) (not (= ~var_1_8_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_11_Pointer~0.base)) (<= 15 |~#var_1_13~0.base|) (not (= ~var_1_8_Pointer~0.base ~var_1_11_Pointer~0.base)) (= ~var_1_5_Pointer~0.offset 0) (<= 12 |~#var_1_10~0.base|) (<= 10 ~var_1_8_Pointer~0.base) (not (= ~var_1_12_Pointer~0.base ~var_1_8_Pointer~0.base)) (<= 13 |~#var_1_11~0.base|) (= |~#var_1_5~0.offset| 0) (= |~#var_1_10~0.offset| 0) (<= (mod (select (select |#memory_int| 7) 0) 256) 0)) [2023-11-06 22:43:51,720 INFO L899 garLoopResultBuilder]: For program point L112-16(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,720 INFO L899 garLoopResultBuilder]: For program point L96-1(line 96) no Hoare annotation was computed. [2023-11-06 22:43:51,720 INFO L899 garLoopResultBuilder]: For program point L112-17(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,720 INFO L899 garLoopResultBuilder]: For program point L112-19(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,720 INFO L899 garLoopResultBuilder]: For program point L112-21(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,721 INFO L899 garLoopResultBuilder]: For program point L112-23(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,721 INFO L899 garLoopResultBuilder]: For program point L112-25(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,721 INFO L899 garLoopResultBuilder]: For program point L112-26(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,721 INFO L899 garLoopResultBuilder]: For program point L112-27(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,721 INFO L899 garLoopResultBuilder]: For program point L112-29(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,721 INFO L899 garLoopResultBuilder]: For program point L112-30(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,721 INFO L899 garLoopResultBuilder]: For program point L112-31(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,722 INFO L899 garLoopResultBuilder]: For program point L112-32(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,722 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 48) no Hoare annotation was computed. [2023-11-06 22:43:51,722 INFO L899 garLoopResultBuilder]: For program point L112-34(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,722 INFO L899 garLoopResultBuilder]: For program point L112-35(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,722 INFO L899 garLoopResultBuilder]: For program point L112-37(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,722 INFO L899 garLoopResultBuilder]: For program point L112-39(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,722 INFO L899 garLoopResultBuilder]: For program point L112-41(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,723 INFO L899 garLoopResultBuilder]: For program point L112-43(line 112) no Hoare annotation was computed. [2023-11-06 22:43:51,723 INFO L895 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: (and (<= 11 |~#var_1_9~0.base|) (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (not (= ~var_1_13_Pointer~0.base ~var_1_12_Pointer~0.base)) (not (= |~#var_1_13~0.base| |~#var_1_11~0.base|)) (<= 8 ~var_1_6_Pointer~0.base) (not (= ~var_1_1_Pointer~0.base ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.base |~#var_1_11~0.base|) (not (= 7 ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.offset |~#var_1_11~0.offset|) (not (= ~var_1_12_Pointer~0.base ~var_1_4_Pointer~0.base)) (= 7 ~var_1_5_Pointer~0.base) (not (= ~var_1_8_Pointer~0.base |~#var_1_13~0.base|)) (<= ~var_1_4_Pointer~0.base 6) (= 7 |~#var_1_5~0.base|) (<= 9 |~#var_1_7~0.base|) (<= ~var_1_1_Pointer~0.base 4) (not (= ~var_1_8_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_11_Pointer~0.base)) (<= 15 |~#var_1_13~0.base|) (not (= ~var_1_8_Pointer~0.base ~var_1_11_Pointer~0.base)) (= ~var_1_5_Pointer~0.offset 0) (<= 12 |~#var_1_10~0.base|) (<= 10 ~var_1_8_Pointer~0.base) (not (= ~var_1_12_Pointer~0.base ~var_1_8_Pointer~0.base)) (<= 13 |~#var_1_11~0.base|) (= |~#var_1_5~0.offset| 0) (= |~#var_1_10~0.offset| 0) (<= (mod (select (select |#memory_int| 7) 0) 256) 0)) [2023-11-06 22:43:51,723 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2023-11-06 22:43:51,723 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:43:51,724 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:43:51,724 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 82) no Hoare annotation was computed. [2023-11-06 22:43:51,724 INFO L895 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (and (<= 11 |~#var_1_9~0.base|) (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (not (= ~var_1_13_Pointer~0.base ~var_1_12_Pointer~0.base)) (not (= |~#var_1_13~0.base| |~#var_1_11~0.base|)) (<= 8 ~var_1_6_Pointer~0.base) (not (= ~var_1_1_Pointer~0.base ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.base |~#var_1_11~0.base|) (not (= 7 ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.offset |~#var_1_11~0.offset|) (not (= ~var_1_12_Pointer~0.base ~var_1_4_Pointer~0.base)) (= 7 ~var_1_5_Pointer~0.base) (not (= ~var_1_8_Pointer~0.base |~#var_1_13~0.base|)) (<= ~var_1_4_Pointer~0.base 6) (= 7 |~#var_1_5~0.base|) (<= 9 |~#var_1_7~0.base|) (<= ~var_1_1_Pointer~0.base 4) (not (= ~var_1_8_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_11_Pointer~0.base)) (<= 15 |~#var_1_13~0.base|) (not (= ~var_1_8_Pointer~0.base ~var_1_11_Pointer~0.base)) (= ~var_1_5_Pointer~0.offset 0) (<= 12 |~#var_1_10~0.base|) (<= 10 ~var_1_8_Pointer~0.base) (not (= ~var_1_12_Pointer~0.base ~var_1_8_Pointer~0.base)) (<= 13 |~#var_1_11~0.base|) (= |~#var_1_5~0.offset| 0) (= |~#var_1_10~0.offset| 0) (<= (mod (select (select |#memory_int| 7) 0) 256) 0)) [2023-11-06 22:43:51,724 INFO L899 garLoopResultBuilder]: For program point L99-1(line 99) no Hoare annotation was computed. [2023-11-06 22:43:51,724 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 107) no Hoare annotation was computed. [2023-11-06 22:43:51,725 INFO L895 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (and (<= 11 |~#var_1_9~0.base|) (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (not (= ~var_1_13_Pointer~0.base ~var_1_12_Pointer~0.base)) (not (= |~#var_1_13~0.base| |~#var_1_11~0.base|)) (<= 8 ~var_1_6_Pointer~0.base) (not (= ~var_1_1_Pointer~0.base ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.base |~#var_1_11~0.base|) (not (= 7 ~var_1_12_Pointer~0.base)) (= ~var_1_11_Pointer~0.offset |~#var_1_11~0.offset|) (not (= ~var_1_12_Pointer~0.base ~var_1_4_Pointer~0.base)) (= 7 ~var_1_5_Pointer~0.base) (not (= ~var_1_8_Pointer~0.base |~#var_1_13~0.base|)) (<= ~var_1_4_Pointer~0.base 6) (= 7 |~#var_1_5~0.base|) (<= 9 |~#var_1_7~0.base|) (<= ~var_1_1_Pointer~0.base 4) (not (= ~var_1_8_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_10_Pointer~0.base)) (not (= ~var_1_12_Pointer~0.base ~var_1_11_Pointer~0.base)) (<= 15 |~#var_1_13~0.base|) (not (= ~var_1_8_Pointer~0.base ~var_1_11_Pointer~0.base)) (= ~var_1_5_Pointer~0.offset 0) (<= 12 |~#var_1_10~0.base|) (<= 10 ~var_1_8_Pointer~0.base) (not (= ~var_1_12_Pointer~0.base ~var_1_8_Pointer~0.base)) (<= 13 |~#var_1_11~0.base|) (= |~#var_1_5~0.offset| 0) (= |~#var_1_10~0.offset| 0) (<= (mod (select (select |#memory_int| 7) 0) 256) 0)) [2023-11-06 22:43:51,725 INFO L899 garLoopResultBuilder]: For program point L100-1(line 100) no Hoare annotation was computed. [2023-11-06 22:43:51,725 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 55) no Hoare annotation was computed. [2023-11-06 22:43:51,725 INFO L899 garLoopResultBuilder]: For program point L51-2(lines 51 55) no Hoare annotation was computed. [2023-11-06 22:43:51,725 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 72) no Hoare annotation was computed. [2023-11-06 22:43:51,725 INFO L899 garLoopResultBuilder]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2023-11-06 22:43:51,726 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:43:51,726 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:43:51,726 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:43:51,726 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:43:51,729 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:51,732 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:43:51,749 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[7] could not be translated [2023-11-06 22:43:51,750 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[7][0] could not be translated [2023-11-06 22:43:51,753 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[7] could not be translated [2023-11-06 22:43:51,754 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[7][0] could not be translated [2023-11-06 22:43:51,761 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[7] could not be translated [2023-11-06 22:43:51,762 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[7][0] could not be translated [2023-11-06 22:43:51,764 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[7] could not be translated [2023-11-06 22:43:51,765 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[7][0] could not be translated [2023-11-06 22:43:51,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:43:51 BoogieIcfgContainer [2023-11-06 22:43:51,766 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:43:51,767 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:43:51,767 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:43:51,767 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:43:51,768 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:42:56" (3/4) ... [2023-11-06 22:43:51,770 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:43:51,774 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:43:51,785 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-06 22:43:51,787 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:43:51,788 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:43:51,789 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:43:51,821 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((11 <= var_1_9) && (var_1_13_Pointer == var_1_13)) && (*var_1_13_Pointer == *var_1_12_Pointer)) && !((var_1_13_Pointer == var_1_12_Pointer))) && !((var_1_13 == var_1_11))) && (8 <= var_1_6_Pointer)) && !((var_1_1_Pointer == var_1_12_Pointer))) && (var_1_11_Pointer == var_1_11)) && !((7 == var_1_12_Pointer))) && (1 <= \result)) && !((var_1_12_Pointer == var_1_4_Pointer))) && (7 == var_1_5_Pointer)) && !((var_1_8_Pointer == var_1_13))) && (var_1_4_Pointer <= 6)) && (7 == var_1_5)) && (9 <= var_1_7)) && (var_1_1_Pointer <= 4)) && !((var_1_8_Pointer == var_1_10_Pointer))) && !((var_1_12_Pointer == var_1_10_Pointer))) && !((var_1_12_Pointer == var_1_11_Pointer))) && (15 <= var_1_13)) && !((var_1_8_Pointer == var_1_11_Pointer))) && (12 <= var_1_10)) && (10 <= var_1_8_Pointer)) && (*var_1_1_Pointer <= ((*var_1_1_Pointer / 256) * 256))) && !((var_1_12_Pointer == var_1_8_Pointer))) && (13 <= var_1_11)) [2023-11-06 22:43:51,904 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((11 <= var_1_9) && (var_1_13_Pointer == var_1_13)) && (*var_1_13_Pointer == *var_1_12_Pointer)) && !((var_1_13_Pointer == var_1_12_Pointer))) && !((var_1_13 == var_1_11))) && (8 <= var_1_6_Pointer)) && !((var_1_1_Pointer == var_1_12_Pointer))) && (var_1_11_Pointer == var_1_11)) && !((7 == var_1_12_Pointer))) && (1 <= \result)) && !((var_1_12_Pointer == var_1_4_Pointer))) && (7 == var_1_5_Pointer)) && !((var_1_8_Pointer == var_1_13))) && (var_1_4_Pointer <= 6)) && (7 == var_1_5)) && (9 <= var_1_7)) && (var_1_1_Pointer <= 4)) && !((var_1_8_Pointer == var_1_10_Pointer))) && !((var_1_12_Pointer == var_1_10_Pointer))) && !((var_1_12_Pointer == var_1_11_Pointer))) && (15 <= var_1_13)) && !((var_1_8_Pointer == var_1_11_Pointer))) && (12 <= var_1_10)) && (10 <= var_1_8_Pointer)) && (*var_1_1_Pointer <= ((*var_1_1_Pointer / 256) * 256))) && !((var_1_12_Pointer == var_1_8_Pointer))) && (13 <= var_1_11)) [2023-11-06 22:43:51,924 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:43:51,928 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:43:51,928 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:43:51,929 INFO L158 Benchmark]: Toolchain (without parser) took 56709.95ms. Allocated memory was 155.2MB in the beginning and 629.1MB in the end (delta: 474.0MB). Free memory was 109.5MB in the beginning and 218.5MB in the end (delta: -109.0MB). Peak memory consumption was 366.6MB. Max. memory is 16.1GB. [2023-11-06 22:43:51,929 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 155.2MB. Free memory is still 101.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:43:51,930 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.17ms. Allocated memory is still 155.2MB. Free memory was 109.5MB in the beginning and 95.7MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:43:51,930 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.12ms. Allocated memory is still 155.2MB. Free memory was 95.7MB in the beginning and 92.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:43:51,931 INFO L158 Benchmark]: Boogie Preprocessor took 73.15ms. Allocated memory is still 155.2MB. Free memory was 92.7MB in the beginning and 90.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:43:51,931 INFO L158 Benchmark]: RCFGBuilder took 864.20ms. Allocated memory was 155.2MB in the beginning and 209.7MB in the end (delta: 54.5MB). Free memory was 90.3MB in the beginning and 168.3MB in the end (delta: -78.1MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2023-11-06 22:43:51,932 INFO L158 Benchmark]: TraceAbstraction took 55154.21ms. Allocated memory was 209.7MB in the beginning and 629.1MB in the end (delta: 419.4MB). Free memory was 168.3MB in the beginning and 228.0MB in the end (delta: -59.7MB). Peak memory consumption was 374.5MB. Max. memory is 16.1GB. [2023-11-06 22:43:51,937 INFO L158 Benchmark]: Witness Printer took 161.64ms. Allocated memory is still 629.1MB. Free memory was 228.0MB in the beginning and 218.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 22:43:51,939 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 155.2MB. Free memory is still 101.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.17ms. Allocated memory is still 155.2MB. Free memory was 109.5MB in the beginning and 95.7MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.12ms. Allocated memory is still 155.2MB. Free memory was 95.7MB in the beginning and 92.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.15ms. Allocated memory is still 155.2MB. Free memory was 92.7MB in the beginning and 90.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 864.20ms. Allocated memory was 155.2MB in the beginning and 209.7MB in the end (delta: 54.5MB). Free memory was 90.3MB in the beginning and 168.3MB in the end (delta: -78.1MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. * TraceAbstraction took 55154.21ms. Allocated memory was 209.7MB in the beginning and 629.1MB in the end (delta: 419.4MB). Free memory was 168.3MB in the beginning and 228.0MB in the end (delta: -59.7MB). Peak memory consumption was 374.5MB. Max. memory is 16.1GB. * Witness Printer took 161.64ms. Allocated memory is still 629.1MB. Free memory was 228.0MB in the beginning and 218.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[7] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[7][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[7] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[7][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[7] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[7][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[7] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[7][0] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.1s, OverallIterations: 22, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 24.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2917 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2915 mSDsluCounter, 9330 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6609 mSDsCounter, 263 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5042 IncrementalHoareTripleChecker+Invalid, 5305 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 263 mSolverCounterUnsat, 2721 mSDtfsCounter, 5042 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1066 GetRequests, 874 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=18, InterpolantAutomatonStates: 150, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 504 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 349 PreInvPairs, 368 NumberOfFragments, 2016 HoareAnnotationTreeSize, 349 FomulaSimplifications, 1066909 FormulaSimplificationTreeSizeReduction, 19.8s HoareSimplificationTime, 20 FomulaSimplificationsInter, 23400 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 17.9s InterpolantComputationTime, 2902 NumberOfCodeBlocks, 2902 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2879 ConstructedInterpolants, 1 QuantifiedInterpolants, 18923 SizeOfPredicates, 17 NumberOfNonLiveVariables, 554 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 23 InterpolantComputations, 21 PerfectInterpolantSequences, 9269/9660 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: 115]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 111]: Loop Invariant [2023-11-06 22:43:51,955 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[7] could not be translated [2023-11-06 22:43:51,955 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[7][0] could not be translated [2023-11-06 22:43:51,957 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[7] could not be translated [2023-11-06 22:43:51,957 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[7][0] could not be translated Derived loop invariant: (((((((((((((((((((((((((((11 <= var_1_9) && (var_1_13_Pointer == var_1_13)) && (*var_1_13_Pointer == *var_1_12_Pointer)) && !((var_1_13_Pointer == var_1_12_Pointer))) && !((var_1_13 == var_1_11))) && (8 <= var_1_6_Pointer)) && !((var_1_1_Pointer == var_1_12_Pointer))) && (var_1_11_Pointer == var_1_11)) && !((7 == var_1_12_Pointer))) && (1 <= \result)) && !((var_1_12_Pointer == var_1_4_Pointer))) && (7 == var_1_5_Pointer)) && !((var_1_8_Pointer == var_1_13))) && (var_1_4_Pointer <= 6)) && (7 == var_1_5)) && (9 <= var_1_7)) && (var_1_1_Pointer <= 4)) && !((var_1_8_Pointer == var_1_10_Pointer))) && !((var_1_12_Pointer == var_1_10_Pointer))) && !((var_1_12_Pointer == var_1_11_Pointer))) && (15 <= var_1_13)) && !((var_1_8_Pointer == var_1_11_Pointer))) && (12 <= var_1_10)) && (10 <= var_1_8_Pointer)) && (*var_1_1_Pointer <= ((*var_1_1_Pointer / 256) * 256))) && !((var_1_12_Pointer == var_1_8_Pointer))) && (13 <= var_1_11)) - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((11 <= var_1_9) && (var_1_13_Pointer == var_1_13)) && !((var_1_13_Pointer == var_1_12_Pointer))) && !((var_1_13 == var_1_11))) && (8 <= var_1_6_Pointer)) && !((var_1_1_Pointer == var_1_12_Pointer))) && (var_1_11_Pointer == var_1_11)) && !((7 == var_1_12_Pointer))) && !((var_1_12_Pointer == var_1_4_Pointer))) && (7 == var_1_5_Pointer)) && !((var_1_8_Pointer == var_1_13))) && (var_1_4_Pointer <= 6)) && (7 == var_1_5)) && (9 <= var_1_7)) && (var_1_1_Pointer <= 4)) && !((var_1_8_Pointer == var_1_10_Pointer))) && !((var_1_12_Pointer == var_1_10_Pointer))) && !((var_1_12_Pointer == var_1_11_Pointer))) && (15 <= var_1_13)) && !((var_1_8_Pointer == var_1_11_Pointer))) && (12 <= var_1_10)) && (10 <= var_1_8_Pointer)) && !((var_1_12_Pointer == var_1_8_Pointer))) && (13 <= var_1_11)) - InvariantResult [Line: 19]: Loop Invariant [2023-11-06 22:43:51,963 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[7] could not be translated [2023-11-06 22:43:51,963 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[7][0] could not be translated [2023-11-06 22:43:51,965 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[7] could not be translated [2023-11-06 22:43:51,966 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[7][0] could not be translated Derived loop invariant: (((((((((((((((((((((((((11 <= var_1_9) && (var_1_13_Pointer == var_1_13)) && !((var_1_13_Pointer == var_1_12_Pointer))) && !((var_1_13 == var_1_11))) && (8 <= var_1_6_Pointer)) && !((var_1_1_Pointer == var_1_12_Pointer))) && (var_1_11_Pointer == var_1_11)) && !((7 == var_1_12_Pointer))) && !((var_1_12_Pointer == var_1_4_Pointer))) && (7 == var_1_5_Pointer)) && !((var_1_8_Pointer == var_1_13))) && (var_1_4_Pointer <= 6)) && (7 == var_1_5)) && (9 <= var_1_7)) && (var_1_1_Pointer <= 4)) && !((var_1_8_Pointer == var_1_10_Pointer))) && !((var_1_12_Pointer == var_1_10_Pointer))) && !((var_1_12_Pointer == var_1_11_Pointer))) && (15 <= var_1_13)) && !((var_1_8_Pointer == var_1_11_Pointer))) && (12 <= var_1_10)) && (10 <= var_1_8_Pointer)) && (*var_1_1_Pointer <= ((*var_1_1_Pointer / 256) * 256))) && !((var_1_12_Pointer == var_1_8_Pointer))) && (13 <= var_1_11)) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:43:51,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3aee732-b334-4b94-b103-cf1b81a0915c/bin/uautomizer-verify-WvqO1wxjHP/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