./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-pthread/cs_lazy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-pthread/cs_lazy.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc --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 b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:28:32,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:28:32,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:28:32,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:28:32,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:28:32,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:28:32,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:28:32,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:28:32,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:28:32,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:28:32,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:28:32,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:28:32,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:28:32,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:28:32,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:28:32,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:28:32,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:28:32,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:28:32,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:28:32,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:28:32,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:28:32,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:28:32,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:28:32,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:28:32,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:28:32,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:28:32,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:28:32,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:28:32,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:28:32,577 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:28:32,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:28:32,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:28:32,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:28:32,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:28:32,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:28:32,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:28:32,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:28:32,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:28:32,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:28:32,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:28:32,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:28:32,592 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:28:32,633 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:28:32,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:28:32,639 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:28:32,639 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:28:32,640 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:28:32,640 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:28:32,641 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:28:32,641 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:28:32,642 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:28:32,642 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:28:32,643 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:28:32,644 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:28:32,644 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:28:32,644 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:28:32,644 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:28:32,645 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:28:32,645 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:28:32,645 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:28:32,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:28:32,646 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:28:32,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:28:32,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:28:32,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:28:32,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:28:32,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:28:32,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:28:32,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:28:32,648 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:28:32,648 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:28:32,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:28:32,649 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:28:32,649 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:28:32,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:28:32,650 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/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_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc 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 -> b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f [2022-11-02 20:28:33,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:28:33,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:28:33,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:28:33,103 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:28:33,104 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:28:33,106 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/seq-pthread/cs_lazy.i [2022-11-02 20:28:33,191 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/data/4e2e1ad8a/2cfa515e72474d029982a7f08fb4ab3d/FLAGabfbcfbdb [2022-11-02 20:28:33,924 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:28:33,925 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/sv-benchmarks/c/seq-pthread/cs_lazy.i [2022-11-02 20:28:33,941 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/data/4e2e1ad8a/2cfa515e72474d029982a7f08fb4ab3d/FLAGabfbcfbdb [2022-11-02 20:28:34,160 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/data/4e2e1ad8a/2cfa515e72474d029982a7f08fb4ab3d [2022-11-02 20:28:34,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:28:34,166 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:28:34,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:28:34,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:28:34,176 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:28:34,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:28:34" (1/1) ... [2022-11-02 20:28:34,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fe35e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:34, skipping insertion in model container [2022-11-02 20:28:34,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:28:34" (1/1) ... [2022-11-02 20:28:34,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:28:34,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:28:34,636 WARN L230 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_2d2e71ba-2ea5-49fc-846a-198b1220ab16/sv-benchmarks/c/seq-pthread/cs_lazy.i[23394,23407] [2022-11-02 20:28:34,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:28:34,834 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:28:34,873 WARN L230 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_2d2e71ba-2ea5-49fc-846a-198b1220ab16/sv-benchmarks/c/seq-pthread/cs_lazy.i[23394,23407] [2022-11-02 20:28:34,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:28:34,967 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:28:34,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:34 WrapperNode [2022-11-02 20:28:34,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:28:34,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:28:34,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:28:34,971 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:28:34,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:34" (1/1) ... [2022-11-02 20:28:35,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:34" (1/1) ... [2022-11-02 20:28:35,083 INFO L138 Inliner]: procedures = 145, calls = 212, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 514 [2022-11-02 20:28:35,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:28:35,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:28:35,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:28:35,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:28:35,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:34" (1/1) ... [2022-11-02 20:28:35,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:34" (1/1) ... [2022-11-02 20:28:35,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:34" (1/1) ... [2022-11-02 20:28:35,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:34" (1/1) ... [2022-11-02 20:28:35,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:34" (1/1) ... [2022-11-02 20:28:35,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:34" (1/1) ... [2022-11-02 20:28:35,185 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:34" (1/1) ... [2022-11-02 20:28:35,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:34" (1/1) ... [2022-11-02 20:28:35,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:28:35,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:28:35,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:28:35,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:28:35,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:34" (1/1) ... [2022-11-02 20:28:35,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:28:35,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:28:35,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:28:35,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:28:35,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:28:35,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:28:35,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:28:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:28:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:28:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-11-02 20:28:35,302 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-11-02 20:28:35,304 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-11-02 20:28:35,306 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-11-02 20:28:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:28:35,307 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-11-02 20:28:35,307 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-11-02 20:28:35,307 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-11-02 20:28:35,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-11-02 20:28:35,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:28:35,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:28:35,308 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-11-02 20:28:35,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-11-02 20:28:35,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:28:35,309 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-11-02 20:28:35,309 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-11-02 20:28:35,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:28:35,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:28:35,580 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:28:35,583 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:28:36,007 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2022-11-02 20:28:36,008 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != ~__CS_ret~0 % 256); [2022-11-02 20:28:36,008 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2022-11-02 20:28:36,008 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##33: assume !(0 != ~__CS_ret~0 % 256); [2022-11-02 20:28:36,008 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: SUMMARY for call __CS_cs(); srcloc: null [2022-11-02 20:28:36,008 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2022-11-02 20:28:36,009 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume !(0 != ~__CS_ret~0 % 256); [2022-11-02 20:28:38,432 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:28:38,441 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:28:38,441 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:28:38,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:28:38 BoogieIcfgContainer [2022-11-02 20:28:38,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:28:38,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:28:38,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:28:38,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:28:38,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:28:34" (1/3) ... [2022-11-02 20:28:38,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f991833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:28:38, skipping insertion in model container [2022-11-02 20:28:38,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:34" (2/3) ... [2022-11-02 20:28:38,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f991833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:28:38, skipping insertion in model container [2022-11-02 20:28:38,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:28:38" (3/3) ... [2022-11-02 20:28:38,465 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_lazy.i [2022-11-02 20:28:38,481 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:28:38,482 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:28:38,551 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:28:38,559 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;@ff25ecc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:28:38,560 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:28:38,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 119 states have (on average 1.495798319327731) internal successors, (178), 120 states have internal predecessors, (178), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-11-02 20:28:38,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:28:38,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:38,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:38,605 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:38,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:38,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1643557001, now seen corresponding path program 1 times [2022-11-02 20:28:38,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:38,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148049593] [2022-11-02 20:28:38,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:38,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:39,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:39,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:39,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148049593] [2022-11-02 20:28:39,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148049593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:39,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:39,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:28:39,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699899766] [2022-11-02 20:28:39,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:39,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:39,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:39,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:39,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:39,582 INFO L87 Difference]: Start difference. First operand has 164 states, 119 states have (on average 1.495798319327731) internal successors, (178), 120 states have internal predecessors, (178), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:39,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:39,679 INFO L93 Difference]: Finished difference Result 331 states and 539 transitions. [2022-11-02 20:28:39,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:39,687 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-02 20:28:39,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:39,702 INFO L225 Difference]: With dead ends: 331 [2022-11-02 20:28:39,705 INFO L226 Difference]: Without dead ends: 165 [2022-11-02 20:28:39,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:39,728 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 5 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:39,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 464 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:28:39,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-02 20:28:39,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2022-11-02 20:28:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 117 states have (on average 1.3675213675213675) internal successors, (160), 117 states have internal predecessors, (160), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-11-02 20:28:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 234 transitions. [2022-11-02 20:28:39,838 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 234 transitions. Word has length 34 [2022-11-02 20:28:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:39,838 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 234 transitions. [2022-11-02 20:28:39,839 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:39,840 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 234 transitions. [2022-11-02 20:28:39,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:28:39,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:39,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:39,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:28:39,853 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:39,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:39,855 INFO L85 PathProgramCache]: Analyzing trace with hash -883018881, now seen corresponding path program 1 times [2022-11-02 20:28:39,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:39,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558121389] [2022-11-02 20:28:39,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:39,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:40,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:40,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558121389] [2022-11-02 20:28:40,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558121389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:40,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:40,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:28:40,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898951565] [2022-11-02 20:28:40,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:40,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:40,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:40,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:40,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:40,209 INFO L87 Difference]: Start difference. First operand 161 states and 234 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:40,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:40,282 INFO L93 Difference]: Finished difference Result 321 states and 468 transitions. [2022-11-02 20:28:40,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:40,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-02 20:28:40,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:40,291 INFO L225 Difference]: With dead ends: 321 [2022-11-02 20:28:40,294 INFO L226 Difference]: Without dead ends: 163 [2022-11-02 20:28:40,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:40,297 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 1 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:40,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 459 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:28:40,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-02 20:28:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2022-11-02 20:28:40,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 118 states have (on average 1.3644067796610169) internal successors, (161), 118 states have internal predecessors, (161), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-11-02 20:28:40,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 235 transitions. [2022-11-02 20:28:40,319 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 235 transitions. Word has length 38 [2022-11-02 20:28:40,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:40,321 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 235 transitions. [2022-11-02 20:28:40,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 235 transitions. [2022-11-02 20:28:40,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:28:40,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:40,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:40,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:28:40,326 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:40,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:40,327 INFO L85 PathProgramCache]: Analyzing trace with hash -786448707, now seen corresponding path program 1 times [2022-11-02 20:28:40,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:40,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864201614] [2022-11-02 20:28:40,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:40,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:40,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:40,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864201614] [2022-11-02 20:28:40,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864201614] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:28:40,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579116604] [2022-11-02 20:28:40,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:40,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:28:40,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:28:40,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:28:40,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:28:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:41,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:28:41,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:28:41,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:41,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:28:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:41,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579116604] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:28:41,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:28:41,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-02 20:28:41,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906099416] [2022-11-02 20:28:41,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:28:41,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:28:41,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:41,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:28:41,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:28:41,154 INFO L87 Difference]: Start difference. First operand 162 states and 235 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:41,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:41,214 INFO L93 Difference]: Finished difference Result 327 states and 476 transitions. [2022-11-02 20:28:41,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:28:41,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-02 20:28:41,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:41,217 INFO L225 Difference]: With dead ends: 327 [2022-11-02 20:28:41,217 INFO L226 Difference]: Without dead ends: 168 [2022-11-02 20:28:41,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:28:41,220 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 6 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:41,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 687 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:28:41,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-02 20:28:41,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-11-02 20:28:41,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 124 states have (on average 1.346774193548387) internal successors, (167), 124 states have internal predecessors, (167), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-11-02 20:28:41,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 241 transitions. [2022-11-02 20:28:41,234 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 241 transitions. Word has length 40 [2022-11-02 20:28:41,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:41,235 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 241 transitions. [2022-11-02 20:28:41,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:41,235 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 241 transitions. [2022-11-02 20:28:41,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:28:41,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:41,237 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:41,278 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:28:41,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:28:41,463 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:41,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:41,464 INFO L85 PathProgramCache]: Analyzing trace with hash 386454391, now seen corresponding path program 2 times [2022-11-02 20:28:41,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:41,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800373563] [2022-11-02 20:28:41,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:41,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:28:41,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:41,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800373563] [2022-11-02 20:28:41,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800373563] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:28:41,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708032441] [2022-11-02 20:28:41,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:28:41,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:28:41,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:28:41,843 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:28:41,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:28:42,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-02 20:28:42,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:28:42,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:28:42,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:28:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:28:42,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:28:42,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708032441] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:42,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:28:42,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-02 20:28:42,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966631147] [2022-11-02 20:28:42,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:42,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:28:42,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:42,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:28:42,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:28:42,559 INFO L87 Difference]: Start difference. First operand 168 states and 241 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:42,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:42,611 INFO L93 Difference]: Finished difference Result 318 states and 470 transitions. [2022-11-02 20:28:42,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:28:42,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-11-02 20:28:42,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:42,617 INFO L225 Difference]: With dead ends: 318 [2022-11-02 20:28:42,617 INFO L226 Difference]: Without dead ends: 292 [2022-11-02 20:28:42,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:28:42,619 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 190 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 807 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 [2022-11-02 20:28:42,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 807 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:28:42,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-02 20:28:42,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2022-11-02 20:28:42,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 205 states have (on average 1.395121951219512) internal successors, (286), 205 states have internal predecessors, (286), 73 states have call successors, (73), 12 states have call predecessors, (73), 12 states have return successors, (82), 73 states have call predecessors, (82), 73 states have call successors, (82) [2022-11-02 20:28:42,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 441 transitions. [2022-11-02 20:28:42,662 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 441 transitions. Word has length 46 [2022-11-02 20:28:42,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:42,663 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 441 transitions. [2022-11-02 20:28:42,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:42,663 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 441 transitions. [2022-11-02 20:28:42,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:28:42,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:42,668 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-11-02 20:28:42,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:28:42,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:28:42,895 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:42,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:42,896 INFO L85 PathProgramCache]: Analyzing trace with hash -413357882, now seen corresponding path program 1 times [2022-11-02 20:28:42,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:42,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811852834] [2022-11-02 20:28:42,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:42,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:43,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:28:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:43,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:28:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:43,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:28:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:43,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:28:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:43,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:28:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:43,368 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-02 20:28:43,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:43,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811852834] [2022-11-02 20:28:43,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811852834] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:28:43,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150961410] [2022-11-02 20:28:43,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:43,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:28:43,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:28:43,371 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:28:43,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:28:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:43,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:28:43,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:28:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-02 20:28:43,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:28:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-02 20:28:44,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150961410] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:28:44,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:28:44,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 8 [2022-11-02 20:28:44,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861864296] [2022-11-02 20:28:44,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:28:44,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:28:44,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:44,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:28:44,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:28:44,038 INFO L87 Difference]: Start difference. First operand 291 states and 441 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:28:46,099 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 [] [2022-11-02 20:28:47,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:47,618 INFO L93 Difference]: Finished difference Result 589 states and 899 transitions. [2022-11-02 20:28:47,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:28:47,619 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 91 [2022-11-02 20:28:47,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:47,623 INFO L225 Difference]: With dead ends: 589 [2022-11-02 20:28:47,624 INFO L226 Difference]: Without dead ends: 313 [2022-11-02 20:28:47,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 186 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:28:47,627 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 79 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 114 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:47,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 762 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 304 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-11-02 20:28:47,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-11-02 20:28:47,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 307. [2022-11-02 20:28:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 219 states have (on average 1.3744292237442923) internal successors, (301), 221 states have internal predecessors, (301), 73 states have call successors, (73), 12 states have call predecessors, (73), 14 states have return successors, (88), 73 states have call predecessors, (88), 73 states have call successors, (88) [2022-11-02 20:28:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 462 transitions. [2022-11-02 20:28:47,660 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 462 transitions. Word has length 91 [2022-11-02 20:28:47,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:47,660 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 462 transitions. [2022-11-02 20:28:47,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:28:47,661 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 462 transitions. [2022-11-02 20:28:47,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-02 20:28:47,664 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:47,664 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:28:47,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-02 20:28:47,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:28:47,879 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:47,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:47,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1310826886, now seen corresponding path program 2 times [2022-11-02 20:28:47,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:47,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239754152] [2022-11-02 20:28:47,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:47,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:48,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:28:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:48,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:28:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:48,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:28:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:48,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:28:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:48,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:28:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:48,855 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-11-02 20:28:48,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:48,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239754152] [2022-11-02 20:28:48,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239754152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:48,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:48,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:28:48,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055607389] [2022-11-02 20:28:48,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:48,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:28:48,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:48,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:28:48,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:28:48,859 INFO L87 Difference]: Start difference. First operand 307 states and 462 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:28:50,885 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 [] [2022-11-02 20:28:52,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:52,298 INFO L93 Difference]: Finished difference Result 634 states and 980 transitions. [2022-11-02 20:28:52,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:28:52,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2022-11-02 20:28:52,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:52,305 INFO L225 Difference]: With dead ends: 634 [2022-11-02 20:28:52,305 INFO L226 Difference]: Without dead ends: 608 [2022-11-02 20:28:52,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:28:52,307 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 331 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 205 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:52,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 762 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 487 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-11-02 20:28:52,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-11-02 20:28:52,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 567. [2022-11-02 20:28:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 390 states have (on average 1.4076923076923078) internal successors, (549), 397 states have internal predecessors, (549), 145 states have call successors, (145), 24 states have call predecessors, (145), 31 states have return successors, (201), 145 states have call predecessors, (201), 145 states have call successors, (201) [2022-11-02 20:28:52,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 895 transitions. [2022-11-02 20:28:52,416 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 895 transitions. Word has length 103 [2022-11-02 20:28:52,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:52,416 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 895 transitions. [2022-11-02 20:28:52,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:28:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 895 transitions. [2022-11-02 20:28:52,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-02 20:28:52,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:52,420 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:28:52,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:28:52,420 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:52,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:52,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2058851120, now seen corresponding path program 1 times [2022-11-02 20:28:52,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:52,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401107272] [2022-11-02 20:28:52,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:52,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:53,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:28:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:53,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:28:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:53,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:28:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:53,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:28:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:53,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:28:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-11-02 20:28:53,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:53,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401107272] [2022-11-02 20:28:53,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401107272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:53,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:53,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:28:53,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156281715] [2022-11-02 20:28:53,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:53,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:28:53,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:53,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:28:53,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:28:53,336 INFO L87 Difference]: Start difference. First operand 567 states and 895 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:28:55,357 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 [] [2022-11-02 20:28:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:56,597 INFO L93 Difference]: Finished difference Result 1105 states and 1722 transitions. [2022-11-02 20:28:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:28:56,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2022-11-02 20:28:56,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:56,603 INFO L225 Difference]: With dead ends: 1105 [2022-11-02 20:28:56,603 INFO L226 Difference]: Without dead ends: 608 [2022-11-02 20:28:56,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:28:56,606 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 366 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 265 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:56,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 762 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 470 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-11-02 20:28:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-11-02 20:28:56,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 570. [2022-11-02 20:28:56,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 392 states have (on average 1.405612244897959) internal successors, (551), 400 states have internal predecessors, (551), 145 states have call successors, (145), 24 states have call predecessors, (145), 32 states have return successors, (198), 145 states have call predecessors, (198), 145 states have call successors, (198) [2022-11-02 20:28:56,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 894 transitions. [2022-11-02 20:28:56,667 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 894 transitions. Word has length 103 [2022-11-02 20:28:56,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:56,667 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 894 transitions. [2022-11-02 20:28:56,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:28:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 894 transitions. [2022-11-02 20:28:56,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-02 20:28:56,672 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:56,672 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:28:56,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:28:56,673 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:56,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:56,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1861347046, now seen corresponding path program 1 times [2022-11-02 20:28:56,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:56,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827425339] [2022-11-02 20:28:56,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:56,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:57,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:28:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:57,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:28:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:57,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:28:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:57,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:28:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:57,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:28:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-11-02 20:28:57,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:57,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827425339] [2022-11-02 20:28:57,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827425339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:57,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:57,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:28:57,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234188524] [2022-11-02 20:28:57,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:57,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:28:57,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:57,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:28:57,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:28:57,486 INFO L87 Difference]: Start difference. First operand 570 states and 894 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:28:59,525 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 [] [2022-11-02 20:29:01,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:01,049 INFO L93 Difference]: Finished difference Result 1128 states and 1755 transitions. [2022-11-02 20:29:01,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:29:01,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2022-11-02 20:29:01,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:01,057 INFO L225 Difference]: With dead ends: 1128 [2022-11-02 20:29:01,057 INFO L226 Difference]: Without dead ends: 565 [2022-11-02 20:29:01,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:29:01,062 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 302 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 149 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:01,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 836 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 632 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-11-02 20:29:01,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-11-02 20:29:01,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 527. [2022-11-02 20:29:01,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 370 states have (on average 1.3837837837837839) internal successors, (512), 375 states have internal predecessors, (512), 125 states have call successors, (125), 23 states have call predecessors, (125), 31 states have return successors, (166), 128 states have call predecessors, (166), 125 states have call successors, (166) [2022-11-02 20:29:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 803 transitions. [2022-11-02 20:29:01,117 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 803 transitions. Word has length 103 [2022-11-02 20:29:01,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:01,117 INFO L495 AbstractCegarLoop]: Abstraction has 527 states and 803 transitions. [2022-11-02 20:29:01,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:29:01,118 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 803 transitions. [2022-11-02 20:29:01,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-02 20:29:01,121 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:01,121 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:29:01,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:29:01,122 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:01,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:01,122 INFO L85 PathProgramCache]: Analyzing trace with hash 544197250, now seen corresponding path program 1 times [2022-11-02 20:29:01,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:01,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098558986] [2022-11-02 20:29:01,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:01,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:01,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:29:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:01,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:29:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:01,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:29:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:01,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:29:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:01,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:29:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:02,001 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-11-02 20:29:02,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:02,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098558986] [2022-11-02 20:29:02,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098558986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:02,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:02,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:29:02,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403350904] [2022-11-02 20:29:02,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:02,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:29:02,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:02,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:29:02,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:29:02,006 INFO L87 Difference]: Start difference. First operand 527 states and 803 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:29:04,046 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 [] [2022-11-02 20:29:06,066 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 [] [2022-11-02 20:29:08,077 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 [] [2022-11-02 20:29:09,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:09,422 INFO L93 Difference]: Finished difference Result 897 states and 1333 transitions. [2022-11-02 20:29:09,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:29:09,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2022-11-02 20:29:09,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:09,428 INFO L225 Difference]: With dead ends: 897 [2022-11-02 20:29:09,429 INFO L226 Difference]: Without dead ends: 533 [2022-11-02 20:29:09,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:29:09,433 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 284 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 113 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:09,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 936 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 615 Invalid, 3 Unknown, 0 Unchecked, 7.2s Time] [2022-11-02 20:29:09,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-11-02 20:29:09,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 489. [2022-11-02 20:29:09,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 347 states have (on average 1.3688760806916427) internal successors, (475), 354 states have internal predecessors, (475), 110 states have call successors, (110), 23 states have call predecessors, (110), 31 states have return successors, (149), 111 states have call predecessors, (149), 110 states have call successors, (149) [2022-11-02 20:29:09,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 734 transitions. [2022-11-02 20:29:09,501 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 734 transitions. Word has length 103 [2022-11-02 20:29:09,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:09,503 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 734 transitions. [2022-11-02 20:29:09,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:29:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 734 transitions. [2022-11-02 20:29:09,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-02 20:29:09,509 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:09,509 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 20:29:09,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:29:09,510 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:09,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:09,510 INFO L85 PathProgramCache]: Analyzing trace with hash -689449485, now seen corresponding path program 1 times [2022-11-02 20:29:09,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:09,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486165753] [2022-11-02 20:29:09,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:09,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:23,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:29:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:23,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:29:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:23,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:29:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:23,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:29:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:23,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:29:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:23,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:29:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:23,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:29:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-11-02 20:29:23,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:23,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486165753] [2022-11-02 20:29:23,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486165753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:23,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:23,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:29:23,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756505346] [2022-11-02 20:29:23,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:23,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:29:23,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:23,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:29:23,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:29:23,946 INFO L87 Difference]: Start difference. First operand 489 states and 734 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:29:26,092 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 [] [2022-11-02 20:29:27,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:27,088 INFO L93 Difference]: Finished difference Result 740 states and 1085 transitions. [2022-11-02 20:29:27,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:29:27,089 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 117 [2022-11-02 20:29:27,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:27,094 INFO L225 Difference]: With dead ends: 740 [2022-11-02 20:29:27,094 INFO L226 Difference]: Without dead ends: 507 [2022-11-02 20:29:27,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:29:27,097 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 106 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 162 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:27,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 853 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 457 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-11-02 20:29:27,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-11-02 20:29:27,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 493. [2022-11-02 20:29:27,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 351 states have (on average 1.3675213675213675) internal successors, (480), 358 states have internal predecessors, (480), 110 states have call successors, (110), 23 states have call predecessors, (110), 31 states have return successors, (149), 111 states have call predecessors, (149), 110 states have call successors, (149) [2022-11-02 20:29:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 739 transitions. [2022-11-02 20:29:27,142 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 739 transitions. Word has length 117 [2022-11-02 20:29:27,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:27,143 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 739 transitions. [2022-11-02 20:29:27,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:29:27,143 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 739 transitions. [2022-11-02 20:29:27,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-02 20:29:27,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:27,147 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:27,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:29:27,148 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:27,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:27,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1402171026, now seen corresponding path program 1 times [2022-11-02 20:29:27,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:27,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183197381] [2022-11-02 20:29:27,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:27,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:37,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:29:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:37,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:29:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:37,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:29:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:37,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:29:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:37,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:29:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:37,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:29:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:37,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:29:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:37,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:29:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:37,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:29:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:37,353 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2022-11-02 20:29:37,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:37,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183197381] [2022-11-02 20:29:37,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183197381] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:37,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:37,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:29:37,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204185355] [2022-11-02 20:29:37,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:37,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:29:37,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:37,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:29:37,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:29:37,357 INFO L87 Difference]: Start difference. First operand 493 states and 739 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:29:39,508 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 [] [2022-11-02 20:29:40,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:40,614 INFO L93 Difference]: Finished difference Result 769 states and 1126 transitions. [2022-11-02 20:29:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:29:40,617 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-11-02 20:29:40,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:40,621 INFO L225 Difference]: With dead ends: 769 [2022-11-02 20:29:40,621 INFO L226 Difference]: Without dead ends: 504 [2022-11-02 20:29:40,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:29:40,627 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 40 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:40,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 983 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 679 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-11-02 20:29:40,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-11-02 20:29:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 491. [2022-11-02 20:29:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 349 states have (on average 1.3667621776504297) internal successors, (477), 356 states have internal predecessors, (477), 110 states have call successors, (110), 23 states have call predecessors, (110), 31 states have return successors, (149), 111 states have call predecessors, (149), 110 states have call successors, (149) [2022-11-02 20:29:40,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 736 transitions. [2022-11-02 20:29:40,677 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 736 transitions. Word has length 137 [2022-11-02 20:29:40,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:40,677 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 736 transitions. [2022-11-02 20:29:40,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:29:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 736 transitions. [2022-11-02 20:29:40,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-02 20:29:40,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:40,681 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 5, 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] [2022-11-02 20:29:40,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:29:40,682 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:40,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:40,683 INFO L85 PathProgramCache]: Analyzing trace with hash 359767575, now seen corresponding path program 1 times [2022-11-02 20:29:40,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:40,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867486150] [2022-11-02 20:29:40,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:40,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:41,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:29:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:41,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:29:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:41,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:29:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:41,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:29:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:41,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:29:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:41,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:29:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:41,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:29:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:41,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:29:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:41,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:29:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-11-02 20:29:41,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:41,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867486150] [2022-11-02 20:29:41,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867486150] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:29:41,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553101564] [2022-11-02 20:29:41,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:41,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:29:41,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:29:41,653 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:29:41,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:29:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:42,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 1480 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-02 20:29:42,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:29:42,763 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-02 20:29:42,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:29:42,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553101564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:42,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:29:42,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2022-11-02 20:29:42,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846288143] [2022-11-02 20:29:42,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:42,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:29:42,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:42,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:29:42,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:29:42,773 INFO L87 Difference]: Start difference. First operand 491 states and 736 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:29:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:43,610 INFO L93 Difference]: Finished difference Result 1207 states and 1913 transitions. [2022-11-02 20:29:43,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:29:43,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 135 [2022-11-02 20:29:43,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:43,619 INFO L225 Difference]: With dead ends: 1207 [2022-11-02 20:29:43,619 INFO L226 Difference]: Without dead ends: 746 [2022-11-02 20:29:43,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:29:43,626 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 322 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:43,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 563 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:29:43,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-11-02 20:29:43,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 694. [2022-11-02 20:29:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 513 states have (on average 1.2553606237816763) internal successors, (644), 462 states have internal predecessors, (644), 129 states have call successors, (129), 27 states have call predecessors, (129), 51 states have return successors, (278), 204 states have call predecessors, (278), 129 states have call successors, (278) [2022-11-02 20:29:43,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1051 transitions. [2022-11-02 20:29:43,701 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1051 transitions. Word has length 135 [2022-11-02 20:29:43,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:43,702 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 1051 transitions. [2022-11-02 20:29:43,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:29:43,702 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1051 transitions. [2022-11-02 20:29:43,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-02 20:29:43,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:43,707 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 3, 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] [2022-11-02 20:29:43,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:29:43,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:29:43,922 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:43,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:43,923 INFO L85 PathProgramCache]: Analyzing trace with hash -462837888, now seen corresponding path program 1 times [2022-11-02 20:29:43,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:43,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166834318] [2022-11-02 20:29:43,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:43,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:52,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:29:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:52,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:29:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:52,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:29:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:52,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:29:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:52,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:29:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:52,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:29:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:52,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:29:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:52,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:29:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:52,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:29:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:52,882 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-11-02 20:29:52,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:52,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166834318] [2022-11-02 20:29:52,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166834318] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:29:52,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333300569] [2022-11-02 20:29:52,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:52,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:29:52,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:29:52,885 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:29:52,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:29:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:53,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 99 conjunts are in the unsatisfiable core [2022-11-02 20:29:53,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:29:53,899 INFO L356 Elim1Store]: treesize reduction 80, result has 29.2 percent of original size [2022-11-02 20:29:53,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 55 treesize of output 75 [2022-11-02 20:29:54,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:29:54,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:29:54,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:29:54,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:29:55,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:29:55,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:29:55,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:29:55,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:29:56,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2022-11-02 20:29:56,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:29:56,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-02 20:29:56,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:29:56,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:56,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:56,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:56,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:56,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:56,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:56,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:56,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:56,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:56,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:56,495 INFO L356 Elim1Store]: treesize reduction 114, result has 31.3 percent of original size [2022-11-02 20:29:56,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1248 treesize of output 478 [2022-11-02 20:29:56,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-02 20:29:56,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-02 20:29:57,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:29:57,152 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 33 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-02 20:29:57,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:29:57,539 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7135 (Array Int Int)) (|~#mutex~0.offset| Int) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7128 (Array Int Int)) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7132 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store |c_#memory_int| |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-11-02 20:29:57,603 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_7122 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7135 (Array Int Int)) (|~#mutex~0.offset| Int) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7128 (Array Int Int)) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7132 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |c_ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|)) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7122) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-11-02 20:29:57,713 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_7122 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_7113 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7135 (Array Int Int)) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7128 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|)) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7113))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7122) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-11-02 20:29:57,855 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_7122 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_7113 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7135 (Array Int Int)) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7128 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7112))) (store .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7113))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7122) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-11-02 20:29:57,970 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7110 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_7122 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_7113 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7135 (Array Int Int)) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7128 (Array Int Int)) (v_ArrVal_7109 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (let ((.cse2 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7109) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7110) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7112))) (store .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7113))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7122) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-11-02 20:29:58,092 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7110 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_7122 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_7113 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7135 (Array Int Int)) (v_ArrVal_7107 (Array Int Int)) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7128 (Array Int Int)) (v_ArrVal_7109 (Array Int Int)) (v_ArrVal_7108 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (let ((.cse2 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7107) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7109) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7110) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7112))) (store .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7113))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7122) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-11-02 20:29:58,292 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7110 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_7122 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_7113 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7135 (Array Int Int)) (v_ArrVal_7105 (Array Int Int)) (v_ArrVal_7107 (Array Int Int)) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7106 (Array Int Int)) (v_ArrVal_7128 (Array Int Int)) (v_ArrVal_7109 (Array Int Int)) (v_ArrVal_7108 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (let ((.cse2 (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7105) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7106) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7107) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7109) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7110) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7112))) (store .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7113))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7122) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-11-02 20:29:58,506 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (v_ArrVal_7110 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_7113 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7135 (Array Int Int)) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7122 (Array Int Int)) (v_ArrVal_7103 (Array Int Int)) (v_ArrVal_7105 (Array Int Int)) (v_ArrVal_7104 (Array Int Int)) (v_ArrVal_7107 (Array Int Int)) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7106 (Array Int Int)) (v_ArrVal_7128 (Array Int Int)) (v_ArrVal_7109 (Array Int Int)) (v_ArrVal_7108 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (let ((.cse2 (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7104) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7105) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7106) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7107) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7109) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7110) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7112))) (store .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7113))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7122) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-11-02 20:29:58,679 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (v_ArrVal_7110 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_7113 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7135 (Array Int Int)) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7101 (Array Int Int)) (v_ArrVal_7122 (Array Int Int)) (v_ArrVal_7103 (Array Int Int)) (v_ArrVal_7102 (Array Int Int)) (v_ArrVal_7105 (Array Int Int)) (v_ArrVal_7104 (Array Int Int)) (v_ArrVal_7107 (Array Int Int)) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7106 (Array Int Int)) (v_ArrVal_7128 (Array Int Int)) (v_ArrVal_7109 (Array Int Int)) (v_ArrVal_7108 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (let ((.cse2 (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7101) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7102) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7104) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7105) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7106) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7107) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7109) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7110) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7112))) (store .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7113))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7122) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-11-02 20:29:58,944 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (v_ArrVal_7099 (Array Int Int)) (v_ArrVal_7110 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_7113 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7135 (Array Int Int)) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7101 (Array Int Int)) (v_ArrVal_7100 (Array Int Int)) (v_ArrVal_7122 (Array Int Int)) (v_ArrVal_7103 (Array Int Int)) (v_ArrVal_7102 (Array Int Int)) (v_ArrVal_7105 (Array Int Int)) (v_ArrVal_7104 (Array Int Int)) (v_ArrVal_7107 (Array Int Int)) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7106 (Array Int Int)) (v_ArrVal_7128 (Array Int Int)) (v_ArrVal_7109 (Array Int Int)) (v_ArrVal_7108 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (let ((.cse2 (store (store (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7100) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7099) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7101) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7102) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7104) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7105) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7106) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7107) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7109) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7110) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7112))) (store .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7113))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7122) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-11-02 20:29:59,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (v_ArrVal_7097 (Array Int Int)) (v_ArrVal_7099 (Array Int Int)) (v_ArrVal_7110 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7098 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_7113 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7135 (Array Int Int)) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7101 (Array Int Int)) (v_ArrVal_7100 (Array Int Int)) (v_ArrVal_7122 (Array Int Int)) (v_ArrVal_7103 (Array Int Int)) (v_ArrVal_7102 (Array Int Int)) (v_ArrVal_7105 (Array Int Int)) (v_ArrVal_7104 (Array Int Int)) (v_ArrVal_7107 (Array Int Int)) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7106 (Array Int Int)) (v_ArrVal_7128 (Array Int Int)) (v_ArrVal_7109 (Array Int Int)) (v_ArrVal_7108 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (let ((.cse2 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7098) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7097) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7100) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7099) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7101) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7102) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7104) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7105) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7106) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7107) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7109) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7110) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7112))) (store .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7113))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7122) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-11-02 20:29:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 70 trivial. 78 not checked. [2022-11-02 20:29:59,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333300569] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:29:59,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:29:59,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 17] total 34 [2022-11-02 20:29:59,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444295578] [2022-11-02 20:29:59,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:29:59,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-02 20:29:59,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:59,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-02 20:29:59,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=424, Unknown=11, NotChecked=572, Total=1122 [2022-11-02 20:29:59,726 INFO L87 Difference]: Start difference. First operand 694 states and 1051 transitions. Second operand has 34 states, 34 states have (on average 5.5) internal successors, (187), 30 states have internal predecessors, (187), 8 states have call successors, (27), 9 states have call predecessors, (27), 6 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2022-11-02 20:30:02,353 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 [] [2022-11-02 20:30:05,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:05,759 INFO L93 Difference]: Finished difference Result 1554 states and 2277 transitions. [2022-11-02 20:30:05,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 20:30:05,760 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.5) internal successors, (187), 30 states have internal predecessors, (187), 8 states have call successors, (27), 9 states have call predecessors, (27), 6 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) Word has length 136 [2022-11-02 20:30:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:05,769 INFO L225 Difference]: With dead ends: 1554 [2022-11-02 20:30:05,770 INFO L226 Difference]: Without dead ends: 1045 [2022-11-02 20:30:05,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 282 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=334, Invalid=1339, Unknown=11, NotChecked=968, Total=2652 [2022-11-02 20:30:05,775 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 591 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 408 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 6856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 4780 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:05,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1287 Invalid, 6856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1667 Invalid, 1 Unknown, 4780 Unchecked, 4.5s Time] [2022-11-02 20:30:05,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2022-11-02 20:30:05,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 976. [2022-11-02 20:30:05,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 727 states have (on average 1.2283356258596974) internal successors, (893), 658 states have internal predecessors, (893), 172 states have call successors, (172), 39 states have call predecessors, (172), 76 states have return successors, (405), 278 states have call predecessors, (405), 172 states have call successors, (405) [2022-11-02 20:30:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1470 transitions. [2022-11-02 20:30:05,883 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1470 transitions. Word has length 136 [2022-11-02 20:30:05,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:05,884 INFO L495 AbstractCegarLoop]: Abstraction has 976 states and 1470 transitions. [2022-11-02 20:30:05,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.5) internal successors, (187), 30 states have internal predecessors, (187), 8 states have call successors, (27), 9 states have call predecessors, (27), 6 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2022-11-02 20:30:05,885 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1470 transitions. [2022-11-02 20:30:05,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-02 20:30:05,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:05,890 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 4, 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] [2022-11-02 20:30:05,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:30:06,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 20:30:06,103 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:30:06,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:06,103 INFO L85 PathProgramCache]: Analyzing trace with hash -442404352, now seen corresponding path program 1 times [2022-11-02 20:30:06,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:06,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207903636] [2022-11-02 20:30:06,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:06,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:12,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:30:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:12,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:30:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:12,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:30:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:12,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:30:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:12,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:30:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:12,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:30:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:12,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:30:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:12,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:30:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:12,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:30:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-11-02 20:30:12,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:12,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207903636] [2022-11-02 20:30:12,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207903636] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:30:12,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179944869] [2022-11-02 20:30:12,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:12,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:30:12,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:30:12,465 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:30:12,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:30:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:13,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-02 20:30:13,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:30:13,453 INFO L356 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-11-02 20:30:13,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 56 [2022-11-02 20:30:13,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:13,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:13,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:14,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:14,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:14,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:14,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:15,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:15,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:15,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-02 20:30:15,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:30:15,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:15,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:15,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:15,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:15,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:15,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:15,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:15,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:15,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:15,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:15,806 INFO L356 Elim1Store]: treesize reduction 130, result has 29.7 percent of original size [2022-11-02 20:30:15,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1248 treesize of output 481 [2022-11-02 20:30:15,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-02 20:30:16,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-02 20:30:16,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:16,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:30:16,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:30:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 33 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-02 20:30:16,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:30:16,697 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8102 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_~#__CS_thread_status~0.base| v_ArrVal_8102) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-11-02 20:30:16,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179944869] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:30:16,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:30:16,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2022-11-02 20:30:16,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787260202] [2022-11-02 20:30:16,723 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:30:16,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-02 20:30:16,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:16,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 20:30:16,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=380, Unknown=1, NotChecked=40, Total=506 [2022-11-02 20:30:16,724 INFO L87 Difference]: Start difference. First operand 976 states and 1470 transitions. Second operand has 20 states, 20 states have (on average 7.0) internal successors, (140), 16 states have internal predecessors, (140), 6 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-11-02 20:30:18,960 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 [] [2022-11-02 20:30:21,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:21,200 INFO L93 Difference]: Finished difference Result 1167 states and 1697 transitions. [2022-11-02 20:30:21,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:30:21,201 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.0) internal successors, (140), 16 states have internal predecessors, (140), 6 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 136 [2022-11-02 20:30:21,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:21,209 INFO L225 Difference]: With dead ends: 1167 [2022-11-02 20:30:21,209 INFO L226 Difference]: Without dead ends: 1042 [2022-11-02 20:30:21,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=186, Invalid=809, Unknown=1, NotChecked=60, Total=1056 [2022-11-02 20:30:21,211 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 365 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 232 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:21,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1209 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1473 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2022-11-02 20:30:21,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2022-11-02 20:30:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1023. [2022-11-02 20:30:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 764 states have (on average 1.225130890052356) internal successors, (936), 695 states have internal predecessors, (936), 177 states have call successors, (177), 43 states have call predecessors, (177), 81 states have return successors, (419), 284 states have call predecessors, (419), 177 states have call successors, (419) [2022-11-02 20:30:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1532 transitions. [2022-11-02 20:30:21,327 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1532 transitions. Word has length 136 [2022-11-02 20:30:21,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:21,327 INFO L495 AbstractCegarLoop]: Abstraction has 1023 states and 1532 transitions. [2022-11-02 20:30:21,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.0) internal successors, (140), 16 states have internal predecessors, (140), 6 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-11-02 20:30:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1532 transitions. [2022-11-02 20:30:21,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-02 20:30:21,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:21,333 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 4, 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] [2022-11-02 20:30:21,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:30:21,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:30:21,547 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:30:21,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:21,547 INFO L85 PathProgramCache]: Analyzing trace with hash 762367328, now seen corresponding path program 1 times [2022-11-02 20:30:21,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:21,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615040498] [2022-11-02 20:30:21,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:21,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:27,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:30:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:27,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:30:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:27,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:30:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:27,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:30:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:27,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:30:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:27,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:30:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:27,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:30:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:27,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:30:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:27,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:30:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-11-02 20:30:27,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:27,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615040498] [2022-11-02 20:30:27,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615040498] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:30:27,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794708610] [2022-11-02 20:30:27,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:27,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:30:27,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:30:27,883 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:30:27,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:30:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:28,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-02 20:30:28,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:30:28,824 INFO L356 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-11-02 20:30:28,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 56 [2022-11-02 20:30:29,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:29,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:29,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:29,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:29,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:30,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:30,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:30,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:30,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:30,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:30,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:30,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:30,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:30,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:30,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:30,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:30,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:30,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:30,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:30,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:31,049 INFO L356 Elim1Store]: treesize reduction 130, result has 29.7 percent of original size [2022-11-02 20:30:31,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 624 treesize of output 273 [2022-11-02 20:30:31,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-02 20:30:31,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-02 20:30:31,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:31,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:30:31,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:30:31,638 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 33 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-02 20:30:31,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:30:31,813 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9061 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_~#__CS_thread_status~0.base| v_ArrVal_9061) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-11-02 20:30:31,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794708610] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:30:31,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:30:31,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2022-11-02 20:30:31,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281800641] [2022-11-02 20:30:31,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:30:31,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-02 20:30:31,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:31,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 20:30:31,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=380, Unknown=1, NotChecked=40, Total=506 [2022-11-02 20:30:31,836 INFO L87 Difference]: Start difference. First operand 1023 states and 1532 transitions. Second operand has 20 states, 20 states have (on average 6.9) internal successors, (138), 16 states have internal predecessors, (138), 6 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-11-02 20:30:34,078 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 [] [2022-11-02 20:30:36,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:36,476 INFO L93 Difference]: Finished difference Result 1556 states and 2214 transitions. [2022-11-02 20:30:36,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:30:36,477 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.9) internal successors, (138), 16 states have internal predecessors, (138), 6 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 136 [2022-11-02 20:30:36,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:36,487 INFO L225 Difference]: With dead ends: 1556 [2022-11-02 20:30:36,487 INFO L226 Difference]: Without dead ends: 1007 [2022-11-02 20:30:36,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=186, Invalid=809, Unknown=1, NotChecked=60, Total=1056 [2022-11-02 20:30:36,494 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 341 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 244 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1755 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:36,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1341 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1755 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-11-02 20:30:36,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2022-11-02 20:30:36,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 982. [2022-11-02 20:30:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 732 states have (on average 1.2240437158469946) internal successors, (896), 662 states have internal predecessors, (896), 174 states have call successors, (174), 42 states have call predecessors, (174), 75 states have return successors, (402), 277 states have call predecessors, (402), 174 states have call successors, (402) [2022-11-02 20:30:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1472 transitions. [2022-11-02 20:30:36,592 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1472 transitions. Word has length 136 [2022-11-02 20:30:36,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:36,592 INFO L495 AbstractCegarLoop]: Abstraction has 982 states and 1472 transitions. [2022-11-02 20:30:36,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.9) internal successors, (138), 16 states have internal predecessors, (138), 6 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-11-02 20:30:36,593 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1472 transitions. [2022-11-02 20:30:36,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-02 20:30:36,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:36,597 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 3, 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] [2022-11-02 20:30:36,639 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-02 20:30:36,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:30:36,823 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:30:36,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:36,823 INFO L85 PathProgramCache]: Analyzing trace with hash 924945984, now seen corresponding path program 1 times [2022-11-02 20:30:36,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:36,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539270324] [2022-11-02 20:30:36,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:36,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:46,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:30:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:46,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:30:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:46,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:30:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:46,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:30:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:46,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:30:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:46,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:30:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:46,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:30:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:46,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:30:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:46,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:30:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:46,424 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-11-02 20:30:46,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:46,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539270324] [2022-11-02 20:30:46,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539270324] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:30:46,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617288848] [2022-11-02 20:30:46,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:46,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:30:46,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:30:46,427 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:30:46,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d2e71ba-2ea5-49fc-846a-198b1220ab16/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:30:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:47,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-02 20:30:47,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:30:47,475 INFO L356 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-11-02 20:30:47,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 56 [2022-11-02 20:30:47,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:47,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:47,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:48,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:48,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:48,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:48,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:49,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:49,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:49,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:30:49,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:49,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:49,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:49,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:49,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:49,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:49,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:49,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:49,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:49,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:31:23,930 WARN L234 SmtUtils]: Spent 34.35s on a formula simplification. DAG size of input: 457 DAG size of output: 167 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-02 20:31:23,931 INFO L356 Elim1Store]: treesize reduction 2076, result has 21.5 percent of original size [2022-11-02 20:31:23,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 9 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 1568 treesize of output 3728 [2022-11-02 20:31:24,482 INFO L244 Elim1Store]: Index analysis took 114 ms [2022-11-02 20:31:25,445 INFO L356 Elim1Store]: treesize reduction 67, result has 14.1 percent of original size [2022-11-02 20:31:25,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 147 [2022-11-02 20:31:26,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2022-11-02 20:31:36,672 INFO L356 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2022-11-02 20:31:36,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2022-11-02 20:31:41,056 INFO L356 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2022-11-02 20:31:41,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2022-11-02 20:31:44,159 INFO L244 Elim1Store]: Index analysis took 219 ms [2022-11-02 20:31:44,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 106 [2022-11-02 20:31:47,115 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-02 20:31:47,173 WARN L234 Elim1Store]: Array PQE input equivalent to false