./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-pthread/cs_stack-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/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_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-pthread/cs_stack-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/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_39694973-4114-4af7-b1f9-7f06357233fd/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 f673ebb9e7e04aacff207de4acfe748a76999a1319247236c14ae51e44f23889 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:48:03,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:48:03,904 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:48:03,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:48:03,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:48:03,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:48:03,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:48:03,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:48:03,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:48:03,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:48:03,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:48:03,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:48:03,958 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:48:03,960 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:48:03,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:48:03,961 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:48:03,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:48:03,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:48:03,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:48:03,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:48:03,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:48:03,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:48:03,964 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:48:03,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:48:03,965 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:48:03,966 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:48:03,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:48:03,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:48:03,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:48:03,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:48:03,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:48:03,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:48:03,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:48:03,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:48:03,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:48:03,971 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:48:03,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:48:03,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:48:03,972 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:48:03,972 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_39694973-4114-4af7-b1f9-7f06357233fd/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_39694973-4114-4af7-b1f9-7f06357233fd/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 -> f673ebb9e7e04aacff207de4acfe748a76999a1319247236c14ae51e44f23889 [2023-11-06 22:48:04,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:48:04,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:48:04,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:48:04,347 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:48:04,348 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:48:04,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/seq-pthread/cs_stack-1.i [2023-11-06 22:48:07,416 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:48:07,733 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:48:07,733 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/sv-benchmarks/c/seq-pthread/cs_stack-1.i [2023-11-06 22:48:07,772 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/data/3ac420b01/fc2e2e629a8c4099b1cd76f4bd81f29a/FLAG4ad34454f [2023-11-06 22:48:07,787 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/data/3ac420b01/fc2e2e629a8c4099b1cd76f4bd81f29a [2023-11-06 22:48:07,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:48:07,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:48:07,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:48:07,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:48:07,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:48:07,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:48:07" (1/1) ... [2023-11-06 22:48:07,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@428b00a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:07, skipping insertion in model container [2023-11-06 22:48:07,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:48:07" (1/1) ... [2023-11-06 22:48:07,901 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:48:08,365 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_39694973-4114-4af7-b1f9-7f06357233fd/sv-benchmarks/c/seq-pthread/cs_stack-1.i[34744,34757] [2023-11-06 22:48:08,477 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:48:08,493 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:48:08,528 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_39694973-4114-4af7-b1f9-7f06357233fd/sv-benchmarks/c/seq-pthread/cs_stack-1.i[34744,34757] [2023-11-06 22:48:08,576 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:48:08,640 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:48:08,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:08 WrapperNode [2023-11-06 22:48:08,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:48:08,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:48:08,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:48:08,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:48:08,650 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:48:08" (1/1) ... [2023-11-06 22:48:08,686 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:48:08" (1/1) ... [2023-11-06 22:48:08,764 INFO L138 Inliner]: procedures = 254, calls = 274, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 646 [2023-11-06 22:48:08,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:48:08,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:48:08,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:48:08,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:48:08,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:08" (1/1) ... [2023-11-06 22:48:08,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:08" (1/1) ... [2023-11-06 22:48:08,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:08" (1/1) ... [2023-11-06 22:48:08,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:08" (1/1) ... [2023-11-06 22:48:08,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:08" (1/1) ... [2023-11-06 22:48:08,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:08" (1/1) ... [2023-11-06 22:48:08,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:08" (1/1) ... [2023-11-06 22:48:08,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:08" (1/1) ... [2023-11-06 22:48:08,852 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:48:08,853 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:48:08,853 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:48:08,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:48:08,855 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:08" (1/1) ... [2023-11-06 22:48:08,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:48:08,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:48:08,899 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/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:48:08,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/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:48:08,942 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:48:08,943 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:48:08,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:48:08,943 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2023-11-06 22:48:08,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2023-11-06 22:48:08,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:48:08,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:48:08,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:48:08,946 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2023-11-06 22:48:08,946 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2023-11-06 22:48:08,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:48:08,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:48:08,948 INFO L130 BoogieDeclarations]: Found specification of procedure get_top [2023-11-06 22:48:08,949 INFO L138 BoogieDeclarations]: Found implementation of procedure get_top [2023-11-06 22:48:08,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:48:08,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:48:08,949 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2023-11-06 22:48:08,950 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2023-11-06 22:48:08,950 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2023-11-06 22:48:08,950 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2023-11-06 22:48:08,950 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-11-06 22:48:08,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-11-06 22:48:08,950 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-06 22:48:08,951 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-06 22:48:08,951 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2023-11-06 22:48:08,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2023-11-06 22:48:08,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:48:08,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:48:08,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:48:09,198 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:48:09,202 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:48:09,302 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-06 22:48:09,302 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2023-11-06 22:48:09,333 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-06 22:48:09,333 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2023-11-06 22:48:09,333 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2023-11-06 22:48:09,334 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-06 22:48:09,334 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-06 22:48:09,334 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L933: SUMMARY for call __CS_cs(); srcloc: null [2023-11-06 22:48:09,334 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L933-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2023-11-06 22:48:09,334 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L933-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-06 22:48:09,358 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2023-11-06 22:48:09,824 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##97: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-06 22:48:09,825 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##96: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2023-11-06 22:48:09,825 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-06 22:48:09,825 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2023-11-06 22:48:09,825 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-06 22:48:09,826 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2023-11-06 22:48:09,826 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-06 22:48:09,826 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##42: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2023-11-06 22:48:09,826 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2023-11-06 22:48:09,827 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));pop_#res#1 := 0; [2023-11-06 22:48:09,827 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-2: SUMMARY for call __CS_cs(); srcloc: null [2023-11-06 22:48:09,827 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##111: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2023-11-06 22:48:09,827 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-06 22:48:12,276 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:48:12,285 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:48:12,285 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-06 22:48:12,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:12 BoogieIcfgContainer [2023-11-06 22:48:12,288 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:48:12,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:48:12,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:48:12,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:48:12,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:48:07" (1/3) ... [2023-11-06 22:48:12,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439f6f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:48:12, skipping insertion in model container [2023-11-06 22:48:12,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:08" (2/3) ... [2023-11-06 22:48:12,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439f6f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:48:12, skipping insertion in model container [2023-11-06 22:48:12,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:12" (3/3) ... [2023-11-06 22:48:12,296 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_stack-1.i [2023-11-06 22:48:12,315 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:48:12,315 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:48:12,404 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:48:12,412 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;@43a4d432, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:48:12,412 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:48:12,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 224 states, 140 states have (on average 1.5285714285714285) internal successors, (214), 143 states have internal predecessors, (214), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2023-11-06 22:48:12,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-06 22:48:12,458 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:12,459 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:12,460 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:12,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:12,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1265566629, now seen corresponding path program 1 times [2023-11-06 22:48:12,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:12,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721807433] [2023-11-06 22:48:12,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:12,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:13,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:48:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:13,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:48:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:13,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:48:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:13,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:48:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:13,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:48:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:13,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:48:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:13,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:48:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:13,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-06 22:48:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:13,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-06 22:48:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:13,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 22:48:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:13,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 22:48:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:13,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:48:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:13,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:48:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:13,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 22:48:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:13,321 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-06 22:48:13,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:13,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721807433] [2023-11-06 22:48:13,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721807433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:13,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:13,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:13,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299590514] [2023-11-06 22:48:13,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:13,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:13,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:13,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:13,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:13,385 INFO L87 Difference]: Start difference. First operand has 224 states, 140 states have (on average 1.5285714285714285) internal successors, (214), 143 states have internal predecessors, (214), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-06 22:48:13,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:13,545 INFO L93 Difference]: Finished difference Result 453 states and 798 transitions. [2023-11-06 22:48:13,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:13,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2023-11-06 22:48:13,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:13,568 INFO L225 Difference]: With dead ends: 453 [2023-11-06 22:48:13,569 INFO L226 Difference]: Without dead ends: 227 [2023-11-06 22:48:13,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:13,585 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 8 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:13,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 695 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:48:13,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-11-06 22:48:13,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 221. [2023-11-06 22:48:13,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 138 states have (on average 1.4782608695652173) internal successors, (204), 140 states have internal predecessors, (204), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2023-11-06 22:48:13,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 350 transitions. [2023-11-06 22:48:13,686 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 350 transitions. Word has length 96 [2023-11-06 22:48:13,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:13,686 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 350 transitions. [2023-11-06 22:48:13,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-06 22:48:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 350 transitions. [2023-11-06 22:48:13,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 22:48:13,695 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:13,696 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:13,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:48:13,696 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:13,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:13,697 INFO L85 PathProgramCache]: Analyzing trace with hash -987018820, now seen corresponding path program 1 times [2023-11-06 22:48:13,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:13,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335886967] [2023-11-06 22:48:13,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:13,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:48:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:48:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:48:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:48:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:48:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:48:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:48:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:48:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:48:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 22:48:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:48:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-06 22:48:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:48:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:48:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,195 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-06 22:48:14,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:14,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335886967] [2023-11-06 22:48:14,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335886967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:14,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:14,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:14,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565629082] [2023-11-06 22:48:14,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:14,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:14,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:14,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:14,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:14,207 INFO L87 Difference]: Start difference. First operand 221 states and 350 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-06 22:48:14,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:14,285 INFO L93 Difference]: Finished difference Result 443 states and 703 transitions. [2023-11-06 22:48:14,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:14,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 101 [2023-11-06 22:48:14,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:14,290 INFO L225 Difference]: With dead ends: 443 [2023-11-06 22:48:14,293 INFO L226 Difference]: Without dead ends: 225 [2023-11-06 22:48:14,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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:48:14,297 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 2 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:14,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 685 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:48:14,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-11-06 22:48:14,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2023-11-06 22:48:14,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 140 states have (on average 1.4714285714285715) internal successors, (206), 142 states have internal predecessors, (206), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2023-11-06 22:48:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 352 transitions. [2023-11-06 22:48:14,350 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 352 transitions. Word has length 101 [2023-11-06 22:48:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:14,351 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 352 transitions. [2023-11-06 22:48:14,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-06 22:48:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 352 transitions. [2023-11-06 22:48:14,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-06 22:48:14,360 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:14,360 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:14,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:48:14,361 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:14,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:14,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2109218368, now seen corresponding path program 1 times [2023-11-06 22:48:14,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:14,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011885135] [2023-11-06 22:48:14,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:14,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:48:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:48:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:48:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-06 22:48:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:48:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:48:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-06 22:48:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 22:48:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:48:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:48:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 22:48:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:48:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-06 22:48:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-06 22:48:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:14,777 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2023-11-06 22:48:14,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:14,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011885135] [2023-11-06 22:48:14,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011885135] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:48:14,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881778921] [2023-11-06 22:48:14,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:14,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:48:14,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:48:14,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:48:14,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:48:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:15,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:48:15,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2023-11-06 22:48:15,350 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:48:15,413 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2023-11-06 22:48:15,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881778921] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:48:15,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:48:15,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-11-06 22:48:15,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557084707] [2023-11-06 22:48:15,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:48:15,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:48:15,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:15,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:48:15,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:48:15,418 INFO L87 Difference]: Start difference. First operand 223 states and 352 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 22:48:15,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:15,510 INFO L93 Difference]: Finished difference Result 452 states and 714 transitions. [2023-11-06 22:48:15,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:48:15,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 105 [2023-11-06 22:48:15,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:15,513 INFO L225 Difference]: With dead ends: 452 [2023-11-06 22:48:15,513 INFO L226 Difference]: Without dead ends: 232 [2023-11-06 22:48:15,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:48:15,516 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 4 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:15,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1365 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:48:15,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-11-06 22:48:15,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2023-11-06 22:48:15,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 148 states have (on average 1.445945945945946) internal successors, (214), 150 states have internal predecessors, (214), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2023-11-06 22:48:15,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 360 transitions. [2023-11-06 22:48:15,541 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 360 transitions. Word has length 105 [2023-11-06 22:48:15,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:15,541 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 360 transitions. [2023-11-06 22:48:15,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 22:48:15,542 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 360 transitions. [2023-11-06 22:48:15,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-06 22:48:15,545 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:15,546 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:15,560 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:48:15,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:48:15,753 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:15,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:15,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1563796536, now seen corresponding path program 2 times [2023-11-06 22:48:15,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:15,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265802232] [2023-11-06 22:48:15,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:15,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:16,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:48:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:16,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:48:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:16,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:48:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:16,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:48:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:16,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:48:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:16,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:48:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:16,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:48:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:16,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 22:48:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:16,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:48:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:16,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-06 22:48:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:16,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:48:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:16,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:48:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:16,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:48:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:16,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-06 22:48:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:16,246 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2023-11-06 22:48:16,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:16,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265802232] [2023-11-06 22:48:16,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265802232] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:48:16,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860544938] [2023-11-06 22:48:16,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:48:16,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:48:16,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:48:16,255 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:48:16,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:48:16,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:48:16,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:48:16,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:48:16,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2023-11-06 22:48:16,940 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:16,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860544938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:16,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:48:16,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-11-06 22:48:16,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154328102] [2023-11-06 22:48:16,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:16,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:16,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:16,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:16,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:48:16,942 INFO L87 Difference]: Start difference. First operand 231 states and 360 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-06 22:48:17,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:17,003 INFO L93 Difference]: Finished difference Result 439 states and 701 transitions. [2023-11-06 22:48:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:48:17,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2023-11-06 22:48:17,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:17,012 INFO L225 Difference]: With dead ends: 439 [2023-11-06 22:48:17,012 INFO L226 Difference]: Without dead ends: 405 [2023-11-06 22:48:17,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:48:17,016 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 280 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:17,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1076 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:48:17,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2023-11-06 22:48:17,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 404. [2023-11-06 22:48:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 254 states have (on average 1.4960629921259843) internal successors, (380), 258 states have internal predecessors, (380), 131 states have call successors, (131), 18 states have call predecessors, (131), 18 states have return successors, (139), 131 states have call predecessors, (139), 131 states have call successors, (139) [2023-11-06 22:48:17,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 650 transitions. [2023-11-06 22:48:17,092 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 650 transitions. Word has length 113 [2023-11-06 22:48:17,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:17,092 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 650 transitions. [2023-11-06 22:48:17,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-06 22:48:17,093 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 650 transitions. [2023-11-06 22:48:17,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-11-06 22:48:17,100 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:17,100 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:17,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:17,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:48:17,313 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:17,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:17,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1785513067, now seen corresponding path program 1 times [2023-11-06 22:48:17,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:17,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417887718] [2023-11-06 22:48:17,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:17,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:48:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:48:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:48:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:48:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:48:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:48:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:48:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:48:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:48:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:48:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-06 22:48:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 22:48:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:48:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 22:48:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 22:48:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-06 22:48:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-06 22:48:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-06 22:48:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-06 22:48:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-06 22:48:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-06 22:48:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-11-06 22:48:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-06 22:48:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-06 22:48:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-06 22:48:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-06 22:48:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2023-11-06 22:48:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2023-11-06 22:48:17,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:17,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417887718] [2023-11-06 22:48:17,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417887718] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:48:17,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784697873] [2023-11-06 22:48:17,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:17,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:48:17,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:48:17,940 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:48:17,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:48:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:18,513 INFO L262 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:48:18,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2023-11-06 22:48:18,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:48:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2023-11-06 22:48:18,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784697873] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:48:18,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:48:18,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 13 [2023-11-06 22:48:18,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637271660] [2023-11-06 22:48:18,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:48:18,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:48:18,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:18,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:48:18,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:48:18,758 INFO L87 Difference]: Start difference. First operand 404 states and 650 transitions. Second operand has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 9 states have internal predecessors, (114), 2 states have call successors, (54), 6 states have call predecessors, (54), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2023-11-06 22:48:21,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:48:23,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:48:25,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:48:27,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:48:28,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:28,272 INFO L93 Difference]: Finished difference Result 840 states and 1344 transitions. [2023-11-06 22:48:28,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:48:28,273 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 9 states have internal predecessors, (114), 2 states have call successors, (54), 6 states have call predecessors, (54), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 192 [2023-11-06 22:48:28,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:28,278 INFO L225 Difference]: With dead ends: 840 [2023-11-06 22:48:28,283 INFO L226 Difference]: Without dead ends: 439 [2023-11-06 22:48:28,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 434 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2023-11-06 22:48:28,291 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 109 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 241 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:28,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1770 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 791 Invalid, 4 Unknown, 0 Unchecked, 9.3s Time] [2023-11-06 22:48:28,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-11-06 22:48:28,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 433. [2023-11-06 22:48:28,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 281 states have (on average 1.4555160142348755) internal successors, (409), 287 states have internal predecessors, (409), 131 states have call successors, (131), 18 states have call predecessors, (131), 20 states have return successors, (143), 131 states have call predecessors, (143), 131 states have call successors, (143) [2023-11-06 22:48:28,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 683 transitions. [2023-11-06 22:48:28,354 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 683 transitions. Word has length 192 [2023-11-06 22:48:28,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:28,355 INFO L495 AbstractCegarLoop]: Abstraction has 433 states and 683 transitions. [2023-11-06 22:48:28,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 9 states have internal predecessors, (114), 2 states have call successors, (54), 6 states have call predecessors, (54), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2023-11-06 22:48:28,355 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 683 transitions. [2023-11-06 22:48:28,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-11-06 22:48:28,362 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:28,362 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 10, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:28,370 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-06 22:48:28,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:48:28,570 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:28,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:28,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1135590444, now seen corresponding path program 2 times [2023-11-06 22:48:28,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:28,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118592349] [2023-11-06 22:48:28,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:28,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:48:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:48:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:48:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:48:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:48:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:48:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:48:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:48:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:48:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:48:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-06 22:48:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 22:48:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:48:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:48:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 22:48:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:48:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-06 22:48:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-06 22:48:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-06 22:48:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-11-06 22:48:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-11-06 22:48:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2023-11-06 22:48:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-06 22:48:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-11-06 22:48:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2023-11-06 22:48:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-11-06 22:48:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2023-11-06 22:48:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2023-11-06 22:48:29,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:29,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118592349] [2023-11-06 22:48:29,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118592349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:29,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:29,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:48:29,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506981484] [2023-11-06 22:48:29,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:29,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:48:29,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:29,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:48:29,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:48:29,991 INFO L87 Difference]: Start difference. First operand 433 states and 683 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 4 states have internal predecessors, (64), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2023-11-06 22:48:32,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:48:34,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:48:36,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:48:38,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:48:40,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:48:42,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:48:44,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:44,213 INFO L93 Difference]: Finished difference Result 880 states and 1410 transitions. [2023-11-06 22:48:44,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:48:44,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 4 states have internal predecessors, (64), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 217 [2023-11-06 22:48:44,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:44,222 INFO L225 Difference]: With dead ends: 880 [2023-11-06 22:48:44,222 INFO L226 Difference]: Without dead ends: 842 [2023-11-06 22:48:44,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:48:44,227 INFO L413 NwaCegarLoop]: 343 mSDtfsCounter, 429 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 184 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:44,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1127 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 964 Invalid, 6 Unknown, 0 Unchecked, 13.9s Time] [2023-11-06 22:48:44,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2023-11-06 22:48:44,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 823. [2023-11-06 22:48:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 518 states have (on average 1.4826254826254825) internal successors, (768), 533 states have internal predecessors, (768), 261 states have call successors, (261), 36 states have call predecessors, (261), 43 states have return successors, (301), 261 states have call predecessors, (301), 261 states have call successors, (301) [2023-11-06 22:48:44,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1330 transitions. [2023-11-06 22:48:44,345 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1330 transitions. Word has length 217 [2023-11-06 22:48:44,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:44,347 INFO L495 AbstractCegarLoop]: Abstraction has 823 states and 1330 transitions. [2023-11-06 22:48:44,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 4 states have internal predecessors, (64), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2023-11-06 22:48:44,347 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1330 transitions. [2023-11-06 22:48:44,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2023-11-06 22:48:44,359 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:44,359 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 10, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:44,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:48:44,359 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:44,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:44,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1055093672, now seen corresponding path program 1 times [2023-11-06 22:48:44,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:44,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975747434] [2023-11-06 22:48:44,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:44,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:48:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:48:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:48:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:48:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:48:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:48:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:48:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:48:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:48:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 22:48:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:48:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:48:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:48:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:48:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-06 22:48:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-06 22:48:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-06 22:48:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-06 22:48:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-06 22:48:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-06 22:48:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-06 22:48:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-06 22:48:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-06 22:48:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-11-06 22:48:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-11-06 22:48:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-11-06 22:48:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-06 22:48:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2023-11-06 22:48:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 897 trivial. 0 not checked. [2023-11-06 22:48:45,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:45,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975747434] [2023-11-06 22:48:45,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975747434] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:45,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:45,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:48:45,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240052998] [2023-11-06 22:48:45,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:45,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:48:45,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:45,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:48:45,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:48:45,709 INFO L87 Difference]: Start difference. First operand 823 states and 1330 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2023-11-06 22:48:47,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:48:49,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:48:51,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:48:53,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:48:55,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:48:57,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:49:00,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:00,708 INFO L93 Difference]: Finished difference Result 1925 states and 3202 transitions. [2023-11-06 22:49:00,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:49:00,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 221 [2023-11-06 22:49:00,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:00,725 INFO L225 Difference]: With dead ends: 1925 [2023-11-06 22:49:00,725 INFO L226 Difference]: Without dead ends: 1149 [2023-11-06 22:49:00,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:49:00,733 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 746 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 576 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 576 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:00,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1106 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [576 Valid, 1162 Invalid, 6 Unknown, 0 Unchecked, 14.4s Time] [2023-11-06 22:49:00,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2023-11-06 22:49:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 894. [2023-11-06 22:49:00,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 560 states have (on average 1.4946428571428572) internal successors, (837), 580 states have internal predecessors, (837), 288 states have call successors, (288), 35 states have call predecessors, (288), 45 states have return successors, (330), 288 states have call predecessors, (330), 288 states have call successors, (330) [2023-11-06 22:49:00,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1455 transitions. [2023-11-06 22:49:00,909 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1455 transitions. Word has length 221 [2023-11-06 22:49:00,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:00,910 INFO L495 AbstractCegarLoop]: Abstraction has 894 states and 1455 transitions. [2023-11-06 22:49:00,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2023-11-06 22:49:00,911 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1455 transitions. [2023-11-06 22:49:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-11-06 22:49:00,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:00,921 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 10, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:00,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:49:00,922 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:49:00,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:00,922 INFO L85 PathProgramCache]: Analyzing trace with hash 188036138, now seen corresponding path program 1 times [2023-11-06 22:49:00,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:00,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323662237] [2023-11-06 22:49:00,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:00,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:49:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:49:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:49:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:49:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:49:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:49:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:49:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:49:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:49:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:49:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-06 22:49:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 22:49:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:49:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:49:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 22:49:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:49:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-06 22:49:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-06 22:49:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-06 22:49:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-11-06 22:49:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-11-06 22:49:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2023-11-06 22:49:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-06 22:49:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-11-06 22:49:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2023-11-06 22:49:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-11-06 22:49:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2023-11-06 22:49:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,978 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2023-11-06 22:49:01,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:01,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323662237] [2023-11-06 22:49:01,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323662237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:01,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:01,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:49:01,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837359597] [2023-11-06 22:49:01,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:01,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:49:01,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:01,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:49:01,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:49:01,982 INFO L87 Difference]: Start difference. First operand 894 states and 1455 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 4 states have internal predecessors, (64), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2023-11-06 22:49:04,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:49:06,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:49:08,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:49:10,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:49:12,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:12,009 INFO L93 Difference]: Finished difference Result 1367 states and 2185 transitions. [2023-11-06 22:49:12,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:49:12,009 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 4 states have internal predecessors, (64), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 217 [2023-11-06 22:49:12,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:12,017 INFO L225 Difference]: With dead ends: 1367 [2023-11-06 22:49:12,017 INFO L226 Difference]: Without dead ends: 826 [2023-11-06 22:49:12,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:49:12,022 INFO L413 NwaCegarLoop]: 351 mSDtfsCounter, 473 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 407 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:12,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1235 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 920 Invalid, 4 Unknown, 0 Unchecked, 9.7s Time] [2023-11-06 22:49:12,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2023-11-06 22:49:12,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 716. [2023-11-06 22:49:12,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 458 states have (on average 1.4410480349344978) internal successors, (660), 471 states have internal predecessors, (660), 214 states have call successors, (214), 35 states have call predecessors, (214), 43 states have return successors, (244), 215 states have call predecessors, (244), 214 states have call successors, (244) [2023-11-06 22:49:12,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1118 transitions. [2023-11-06 22:49:12,123 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1118 transitions. Word has length 217 [2023-11-06 22:49:12,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:12,123 INFO L495 AbstractCegarLoop]: Abstraction has 716 states and 1118 transitions. [2023-11-06 22:49:12,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 4 states have internal predecessors, (64), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2023-11-06 22:49:12,124 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1118 transitions. [2023-11-06 22:49:12,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2023-11-06 22:49:12,132 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:12,133 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 10, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:12,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:49:12,133 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:49:12,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:12,134 INFO L85 PathProgramCache]: Analyzing trace with hash 642681938, now seen corresponding path program 1 times [2023-11-06 22:49:12,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:12,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281357954] [2023-11-06 22:49:12,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:12,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:12,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:49:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:49:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:49:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:49:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:49:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:49:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:49:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:49:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:49:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 22:49:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:49:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:49:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:49:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:49:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-06 22:49:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-06 22:49:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-06 22:49:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-06 22:49:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-06 22:49:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-06 22:49:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-06 22:49:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-06 22:49:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-06 22:49:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-11-06 22:49:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-11-06 22:49:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-11-06 22:49:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-06 22:49:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2023-11-06 22:49:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2023-11-06 22:49:13,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:13,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281357954] [2023-11-06 22:49:13,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281357954] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:49:13,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492685837] [2023-11-06 22:49:13,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:13,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:49:13,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:13,354 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:49:13,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39694973-4114-4af7-b1f9-7f06357233fd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:49:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:14,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-06 22:49:14,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:14,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:14,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:20,269 WARN L293 SmtUtils]: Spent 5.62s on a formula simplification. DAG size of input: 304 DAG size of output: 95 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-06 22:49:20,270 INFO L322 Elim1Store]: treesize reduction 1550, result has 20.1 percent of original size [2023-11-06 22:49:20,271 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 5254 treesize of output 2535 [2023-11-06 22:49:20,606 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-11-06 22:49:20,915 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-11-06 22:49:21,097 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-11-06 22:49:21,339 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-11-06 22:49:21,528 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-11-06 22:49:23,765 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-11-06 22:49:24,000 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-11-06 22:49:24,340 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-11-06 22:49:24,506 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-11-06 22:49:24,785 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-11-06 22:49:25,061 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-11-06 22:49:25,446 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-11-06 22:49:27,278 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-11-06 22:49:27,588 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-11-06 22:49:27,763 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-11-06 22:49:29,096 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-11-06 22:49:29,390 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-11-06 22:49:29,594 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-11-06 22:49:31,078 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7