./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 eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_lazy.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 18:43:52,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 18:43:52,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 18:43:52,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 18:43:52,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 18:43:52,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 18:43:52,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 18:43:52,573 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 18:43:52,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 18:43:52,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 18:43:52,577 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 18:43:52,578 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 18:43:52,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 18:43:52,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 18:43:52,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 18:43:52,581 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 18:43:52,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 18:43:52,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 18:43:52,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 18:43:52,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 18:43:52,588 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 18:43:52,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 18:43:52,589 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 18:43:52,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 18:43:52,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 18:43:52,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 18:43:52,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 18:43:52,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 18:43:52,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 18:43:52,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 18:43:52,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 18:43:52,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 18:43:52,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 18:43:52,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 18:43:52,599 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 18:43:52,600 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 18:43:52,600 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 18:43:52,601 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 18:43:52,601 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 18:43:52,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 18:43:52,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 18:43:52,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 18:43:52,604 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 18:43:52,622 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 18:43:52,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 18:43:52,623 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 18:43:52,623 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 18:43:52,624 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 18:43:52,624 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 18:43:52,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 18:43:52,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 18:43:52,625 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 18:43:52,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 18:43:52,626 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 18:43:52,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 18:43:52,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 18:43:52,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 18:43:52,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 18:43:52,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 18:43:52,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 18:43:52,627 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 18:43:52,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 18:43:52,628 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 18:43:52,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 18:43:52,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 18:43:52,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 18:43:52,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 18:43:52,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 18:43:52,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 18:43:52,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 18:43:52,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 18:43:52,629 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 18:43:52,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 18:43:52,630 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 18:43:52,630 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 18:43:52,630 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 18:43:52,630 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-07-19 18:43:52,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 18:43:52,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 18:43:52,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 18:43:52,917 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 18:43:52,918 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 18:43:52,919 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lazy.i [2022-07-19 18:43:52,983 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b43dab747/322a4ef1611a4740b40770f2d31af203/FLAG7111f1058 [2022-07-19 18:43:53,508 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 18:43:53,509 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i [2022-07-19 18:43:53,533 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b43dab747/322a4ef1611a4740b40770f2d31af203/FLAG7111f1058 [2022-07-19 18:43:53,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b43dab747/322a4ef1611a4740b40770f2d31af203 [2022-07-19 18:43:53,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 18:43:53,827 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 18:43:53,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 18:43:53,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 18:43:53,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 18:43:53,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 06:43:53" (1/1) ... [2022-07-19 18:43:53,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@330f500b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:43:53, skipping insertion in model container [2022-07-19 18:43:53,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 06:43:53" (1/1) ... [2022-07-19 18:43:53,839 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 18:43:53,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 18:43:54,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i[23394,23407] [2022-07-19 18:43:54,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 18:43:54,317 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 18:43:54,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i[23394,23407] [2022-07-19 18:43:54,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 18:43:54,441 INFO L208 MainTranslator]: Completed translation [2022-07-19 18:43:54,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:43:54 WrapperNode [2022-07-19 18:43:54,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 18:43:54,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 18:43:54,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 18:43:54,444 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 18:43:54,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:43:54" (1/1) ... [2022-07-19 18:43:54,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:43:54" (1/1) ... [2022-07-19 18:43:54,521 INFO L137 Inliner]: procedures = 145, calls = 212, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 514 [2022-07-19 18:43:54,522 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 18:43:54,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 18:43:54,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 18:43:54,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 18:43:54,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:43:54" (1/1) ... [2022-07-19 18:43:54,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:43:54" (1/1) ... [2022-07-19 18:43:54,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:43:54" (1/1) ... [2022-07-19 18:43:54,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:43:54" (1/1) ... [2022-07-19 18:43:54,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:43:54" (1/1) ... [2022-07-19 18:43:54,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:43:54" (1/1) ... [2022-07-19 18:43:54,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:43:54" (1/1) ... [2022-07-19 18:43:54,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 18:43:54,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 18:43:54,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 18:43:54,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 18:43:54,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:43:54" (1/1) ... [2022-07-19 18:43:54,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 18:43:54,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:43:54,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 18:43:54,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 18:43:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 18:43:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 18:43:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 18:43:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 18:43:54,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 18:43:54,656 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-07-19 18:43:54,656 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-07-19 18:43:54,656 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-19 18:43:54,657 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-19 18:43:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 18:43:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-19 18:43:54,657 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-19 18:43:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-19 18:43:54,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-19 18:43:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 18:43:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 18:43:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-19 18:43:54,659 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-19 18:43:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 18:43:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-07-19 18:43:54,659 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-07-19 18:43:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 18:43:54,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 18:43:54,871 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 18:43:54,873 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 18:43:55,150 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2022-07-19 18:43:55,151 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != ~__CS_ret~0 % 256); [2022-07-19 18:43:55,151 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2022-07-19 18:43:55,151 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##33: assume !(0 != ~__CS_ret~0 % 256); [2022-07-19 18:43:55,151 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: SUMMARY for call __CS_cs(); srcloc: null [2022-07-19 18:43:55,151 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2022-07-19 18:43:55,151 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume !(0 != ~__CS_ret~0 % 256); [2022-07-19 18:43:55,845 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 18:43:55,852 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 18:43:55,852 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 18:43:55,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 06:43:55 BoogieIcfgContainer [2022-07-19 18:43:55,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 18:43:55,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 18:43:55,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 18:43:55,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 18:43:55,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 06:43:53" (1/3) ... [2022-07-19 18:43:55,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e14116f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 06:43:55, skipping insertion in model container [2022-07-19 18:43:55,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:43:54" (2/3) ... [2022-07-19 18:43:55,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e14116f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 06:43:55, skipping insertion in model container [2022-07-19 18:43:55,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 06:43:55" (3/3) ... [2022-07-19 18:43:55,864 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_lazy.i [2022-07-19 18:43:55,877 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 18:43:55,877 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 18:43:55,930 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 18:43:55,943 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1448811f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@bdb4ba2 [2022-07-19 18:43:55,943 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 18:43:55,950 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-07-19 18:43:55,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 18:43:55,965 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:43:55,967 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-07-19 18:43:55,968 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:43:55,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:43:55,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1643557001, now seen corresponding path program 1 times [2022-07-19 18:43:55,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:43:55,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903466709] [2022-07-19 18:43:55,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:43:55,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:43:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:43:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 18:43:56,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:43:56,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903466709] [2022-07-19 18:43:56,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903466709] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:43:56,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:43:56,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 18:43:56,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556712299] [2022-07-19 18:43:56,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:43:56,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 18:43:56,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:43:56,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 18:43:56,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:43:56,415 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-07-19 18:43:56,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:43:56,493 INFO L93 Difference]: Finished difference Result 331 states and 539 transitions. [2022-07-19 18:43:56,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 18:43:56,496 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-07-19 18:43:56,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:43:56,505 INFO L225 Difference]: With dead ends: 331 [2022-07-19 18:43:56,505 INFO L226 Difference]: Without dead ends: 165 [2022-07-19 18:43:56,511 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-07-19 18:43:56,514 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-07-19 18:43:56,515 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-07-19 18:43:56,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-19 18:43:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2022-07-19 18:43:56,559 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-07-19 18:43:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 234 transitions. [2022-07-19 18:43:56,563 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 234 transitions. Word has length 34 [2022-07-19 18:43:56,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:43:56,563 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 234 transitions. [2022-07-19 18:43:56,563 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-07-19 18:43:56,564 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 234 transitions. [2022-07-19 18:43:56,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 18:43:56,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:43:56,567 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-07-19 18:43:56,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 18:43:56,568 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:43:56,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:43:56,568 INFO L85 PathProgramCache]: Analyzing trace with hash -883018881, now seen corresponding path program 1 times [2022-07-19 18:43:56,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:43:56,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828579936] [2022-07-19 18:43:56,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:43:56,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:43:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:43:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 18:43:56,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:43:56,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828579936] [2022-07-19 18:43:56,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828579936] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:43:56,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:43:56,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 18:43:56,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214155316] [2022-07-19 18:43:56,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:43:56,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 18:43:56,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:43:56,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 18:43:56,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:43:56,702 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-07-19 18:43:56,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:43:56,759 INFO L93 Difference]: Finished difference Result 321 states and 468 transitions. [2022-07-19 18:43:56,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 18:43:56,760 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-07-19 18:43:56,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:43:56,763 INFO L225 Difference]: With dead ends: 321 [2022-07-19 18:43:56,765 INFO L226 Difference]: Without dead ends: 163 [2022-07-19 18:43:56,767 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-07-19 18:43:56,768 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-07-19 18:43:56,770 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-07-19 18:43:56,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-19 18:43:56,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2022-07-19 18:43:56,797 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-07-19 18:43:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 235 transitions. [2022-07-19 18:43:56,799 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 235 transitions. Word has length 38 [2022-07-19 18:43:56,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:43:56,800 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 235 transitions. [2022-07-19 18:43:56,800 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-07-19 18:43:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 235 transitions. [2022-07-19 18:43:56,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 18:43:56,805 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:43:56,805 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-07-19 18:43:56,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 18:43:56,805 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:43:56,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:43:56,806 INFO L85 PathProgramCache]: Analyzing trace with hash -786448707, now seen corresponding path program 1 times [2022-07-19 18:43:56,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:43:56,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797606032] [2022-07-19 18:43:56,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:43:56,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:43:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:43:56,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 18:43:56,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:43:56,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797606032] [2022-07-19 18:43:56,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797606032] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:43:56,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906988487] [2022-07-19 18:43:56,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:43:56,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:43:56,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:43:56,979 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:43:57,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 18:43:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:43:57,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 18:43:57,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:43:57,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 18:43:57,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:43:57,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 18:43:57,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906988487] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:43:57,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 18:43:57,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-19 18:43:57,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526409750] [2022-07-19 18:43:57,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 18:43:57,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 18:43:57,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:43:57,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 18:43:57,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-19 18:43:57,478 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-07-19 18:43:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:43:57,532 INFO L93 Difference]: Finished difference Result 327 states and 476 transitions. [2022-07-19 18:43:57,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 18:43:57,537 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-07-19 18:43:57,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:43:57,545 INFO L225 Difference]: With dead ends: 327 [2022-07-19 18:43:57,549 INFO L226 Difference]: Without dead ends: 168 [2022-07-19 18:43:57,550 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-07-19 18:43:57,553 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-07-19 18:43:57,553 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-07-19 18:43:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-19 18:43:57,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-07-19 18:43:57,578 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-07-19 18:43:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 241 transitions. [2022-07-19 18:43:57,580 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 241 transitions. Word has length 40 [2022-07-19 18:43:57,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:43:57,580 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 241 transitions. [2022-07-19 18:43:57,581 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-07-19 18:43:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 241 transitions. [2022-07-19 18:43:57,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 18:43:57,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:43:57,593 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-07-19 18:43:57,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 18:43:57,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:43:57,794 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:43:57,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:43:57,794 INFO L85 PathProgramCache]: Analyzing trace with hash 386454391, now seen corresponding path program 2 times [2022-07-19 18:43:57,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:43:57,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177494558] [2022-07-19 18:43:57,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:43:57,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:43:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:43:57,970 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 18:43:57,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:43:57,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177494558] [2022-07-19 18:43:57,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177494558] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:43:57,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975003993] [2022-07-19 18:43:57,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 18:43:57,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:43:57,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:43:57,975 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:43:57,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 18:43:58,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 18:43:58,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 18:43:58,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 18:43:58,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:43:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 18:43:58,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:43:58,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975003993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:43:58,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 18:43:58,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-19 18:43:58,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170900444] [2022-07-19 18:43:58,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:43:58,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 18:43:58,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:43:58,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 18:43:58,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 18:43:58,465 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-07-19 18:43:58,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:43:58,496 INFO L93 Difference]: Finished difference Result 318 states and 470 transitions. [2022-07-19 18:43:58,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 18:43:58,497 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-07-19 18:43:58,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:43:58,502 INFO L225 Difference]: With dead ends: 318 [2022-07-19 18:43:58,502 INFO L226 Difference]: Without dead ends: 292 [2022-07-19 18:43:58,503 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-07-19 18:43:58,504 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-07-19 18:43:58,504 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-07-19 18:43:58,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-07-19 18:43:58,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2022-07-19 18:43:58,544 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-07-19 18:43:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 441 transitions. [2022-07-19 18:43:58,548 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 441 transitions. Word has length 46 [2022-07-19 18:43:58,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:43:58,549 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 441 transitions. [2022-07-19 18:43:58,549 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-07-19 18:43:58,553 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 441 transitions. [2022-07-19 18:43:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-19 18:43:58,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:43:58,557 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-07-19 18:43:58,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-19 18:43:58,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-19 18:43:58,765 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:43:58,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:43:58,766 INFO L85 PathProgramCache]: Analyzing trace with hash -413357882, now seen corresponding path program 1 times [2022-07-19 18:43:58,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:43:58,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012062256] [2022-07-19 18:43:58,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:43:58,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:43:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:43:58,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 18:43:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:43:59,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:43:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:43:59,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 18:43:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:43:59,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 18:43:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:43:59,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 18:43:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:43:59,059 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 18:43:59,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:43:59,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012062256] [2022-07-19 18:43:59,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012062256] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:43:59,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023234404] [2022-07-19 18:43:59,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:43:59,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:43:59,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:43:59,064 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:43:59,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 18:43:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:43:59,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 18:43:59,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:43:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 18:43:59,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:43:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 18:43:59,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023234404] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:43:59,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 18:43:59,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 8 [2022-07-19 18:43:59,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156381906] [2022-07-19 18:43:59,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 18:43:59,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 18:43:59,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:43:59,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 18:43:59,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-19 18:43:59,610 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-07-19 18:44:01,649 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:44:03,673 WARN L534 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-07-19 18:44:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:04,168 INFO L93 Difference]: Finished difference Result 589 states and 899 transitions. [2022-07-19 18:44:04,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 18:44:04,169 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-07-19 18:44:04,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:04,175 INFO L225 Difference]: With dead ends: 589 [2022-07-19 18:44:04,175 INFO L226 Difference]: Without dead ends: 313 [2022-07-19 18:44:04,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-19 18:44:04,179 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 79 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 114 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.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, 303 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:04,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 762 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 303 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2022-07-19 18:44:04,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-19 18:44:04,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 307. [2022-07-19 18:44:04,220 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-07-19 18:44:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 462 transitions. [2022-07-19 18:44:04,224 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 462 transitions. Word has length 91 [2022-07-19 18:44:04,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:04,226 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 462 transitions. [2022-07-19 18:44:04,226 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-07-19 18:44:04,226 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 462 transitions. [2022-07-19 18:44:04,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-19 18:44:04,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:04,230 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-07-19 18:44:04,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 18:44:04,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:04,444 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:04,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:04,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1310826886, now seen corresponding path program 2 times [2022-07-19 18:44:04,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:04,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23353904] [2022-07-19 18:44:04,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:04,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:04,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 18:44:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:04,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:44:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:04,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 18:44:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:04,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 18:44:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:04,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 18:44:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:04,842 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-19 18:44:04,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:04,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23353904] [2022-07-19 18:44:04,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23353904] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:44:04,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:44:04,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 18:44:04,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391707151] [2022-07-19 18:44:04,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:44:04,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 18:44:04,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:04,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 18:44:04,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 18:44:04,849 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-07-19 18:44:06,866 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:44:07,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:07,717 INFO L93 Difference]: Finished difference Result 634 states and 980 transitions. [2022-07-19 18:44:07,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 18:44:07,717 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-07-19 18:44:07,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:07,722 INFO L225 Difference]: With dead ends: 634 [2022-07-19 18:44:07,722 INFO L226 Difference]: Without dead ends: 608 [2022-07-19 18:44:07,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-19 18:44:07,723 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 331 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 205 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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, 2.7s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:07,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 762 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 487 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-07-19 18:44:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-07-19 18:44:07,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 567. [2022-07-19 18:44:07,768 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-07-19 18:44:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 895 transitions. [2022-07-19 18:44:07,772 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 895 transitions. Word has length 103 [2022-07-19 18:44:07,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:07,774 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 895 transitions. [2022-07-19 18:44:07,774 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-07-19 18:44:07,774 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 895 transitions. [2022-07-19 18:44:07,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-19 18:44:07,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:07,784 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-07-19 18:44:07,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 18:44:07,784 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:07,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:07,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2058851120, now seen corresponding path program 1 times [2022-07-19 18:44:07,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:07,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196714108] [2022-07-19 18:44:07,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:07,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:08,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 18:44:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:08,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:44:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:08,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 18:44:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:08,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 18:44:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:08,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 18:44:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-19 18:44:08,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:08,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196714108] [2022-07-19 18:44:08,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196714108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:44:08,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:44:08,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 18:44:08,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918190883] [2022-07-19 18:44:08,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:44:08,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 18:44:08,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:08,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 18:44:08,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 18:44:08,107 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-07-19 18:44:10,123 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:44:10,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:10,941 INFO L93 Difference]: Finished difference Result 1105 states and 1722 transitions. [2022-07-19 18:44:10,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 18:44:10,942 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-07-19 18:44:10,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:10,947 INFO L225 Difference]: With dead ends: 1105 [2022-07-19 18:44:10,947 INFO L226 Difference]: Without dead ends: 608 [2022-07-19 18:44:10,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-19 18:44:10,951 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 366 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 265 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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, 2.7s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:10,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 762 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 470 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-07-19 18:44:10,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-07-19 18:44:10,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 570. [2022-07-19 18:44:10,981 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-07-19 18:44:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 894 transitions. [2022-07-19 18:44:10,989 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 894 transitions. Word has length 103 [2022-07-19 18:44:10,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:10,989 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 894 transitions. [2022-07-19 18:44:10,989 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-07-19 18:44:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 894 transitions. [2022-07-19 18:44:10,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-19 18:44:10,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:10,993 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-07-19 18:44:10,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 18:44:10,993 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:10,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1861347046, now seen corresponding path program 1 times [2022-07-19 18:44:10,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:10,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716235870] [2022-07-19 18:44:10,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:10,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:11,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 18:44:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:11,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:44:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:11,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 18:44:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:11,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 18:44:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:11,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 18:44:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:11,316 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-19 18:44:11,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:11,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716235870] [2022-07-19 18:44:11,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716235870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:44:11,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:44:11,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 18:44:11,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195099748] [2022-07-19 18:44:11,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:44:11,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 18:44:11,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:11,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 18:44:11,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 18:44:11,319 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-07-19 18:44:13,341 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:44:14,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:14,298 INFO L93 Difference]: Finished difference Result 1128 states and 1755 transitions. [2022-07-19 18:44:14,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 18:44:14,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-07-19 18:44:14,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:14,303 INFO L225 Difference]: With dead ends: 1128 [2022-07-19 18:44:14,303 INFO L226 Difference]: Without dead ends: 565 [2022-07-19 18:44:14,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-19 18:44:14,308 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 302 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 149 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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, 2.8s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:14,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 836 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 632 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-07-19 18:44:14,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-07-19 18:44:14,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 527. [2022-07-19 18:44:14,338 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-07-19 18:44:14,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 803 transitions. [2022-07-19 18:44:14,343 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 803 transitions. Word has length 103 [2022-07-19 18:44:14,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:14,344 INFO L495 AbstractCegarLoop]: Abstraction has 527 states and 803 transitions. [2022-07-19 18:44:14,344 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-07-19 18:44:14,344 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 803 transitions. [2022-07-19 18:44:14,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-19 18:44:14,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:14,347 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-07-19 18:44:14,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 18:44:14,348 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:14,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:14,348 INFO L85 PathProgramCache]: Analyzing trace with hash 544197250, now seen corresponding path program 1 times [2022-07-19 18:44:14,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:14,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077066193] [2022-07-19 18:44:14,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:14,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:14,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 18:44:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:14,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:44:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:14,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 18:44:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:14,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 18:44:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:14,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 18:44:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-19 18:44:14,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:14,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077066193] [2022-07-19 18:44:14,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077066193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:44:14,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:44:14,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 18:44:14,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743485118] [2022-07-19 18:44:14,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:44:14,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 18:44:14,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:14,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 18:44:14,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 18:44:14,654 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-07-19 18:44:16,679 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:44:18,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:18,641 INFO L93 Difference]: Finished difference Result 897 states and 1333 transitions. [2022-07-19 18:44:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 18:44:18,642 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-07-19 18:44:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:18,645 INFO L225 Difference]: With dead ends: 897 [2022-07-19 18:44:18,646 INFO L226 Difference]: Without dead ends: 533 [2022-07-19 18:44:18,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-19 18:44:18,649 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 284 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 113 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:18,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 936 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 617 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-07-19 18:44:18,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-07-19 18:44:18,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 489. [2022-07-19 18:44:18,671 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-07-19 18:44:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 734 transitions. [2022-07-19 18:44:18,674 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 734 transitions. Word has length 103 [2022-07-19 18:44:18,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:18,675 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 734 transitions. [2022-07-19 18:44:18,675 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-07-19 18:44:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 734 transitions. [2022-07-19 18:44:18,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-19 18:44:18,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:18,678 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-07-19 18:44:18,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 18:44:18,678 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:18,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:18,679 INFO L85 PathProgramCache]: Analyzing trace with hash -689449485, now seen corresponding path program 1 times [2022-07-19 18:44:18,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:18,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079091402] [2022-07-19 18:44:18,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:18,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:21,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 18:44:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:21,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 18:44:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:21,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 18:44:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:21,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 18:44:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:21,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 18:44:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:21,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 18:44:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:21,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 18:44:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-19 18:44:21,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:21,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079091402] [2022-07-19 18:44:21,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079091402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:44:21,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:44:21,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 18:44:21,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984523125] [2022-07-19 18:44:21,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:44:21,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 18:44:21,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:21,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 18:44:21,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-19 18:44:21,161 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-07-19 18:44:23,259 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:44:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:23,796 INFO L93 Difference]: Finished difference Result 740 states and 1085 transitions. [2022-07-19 18:44:23,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 18:44:23,797 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-07-19 18:44:23,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:23,800 INFO L225 Difference]: With dead ends: 740 [2022-07-19 18:44:23,801 INFO L226 Difference]: Without dead ends: 507 [2022-07-19 18:44:23,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-19 18:44:23,803 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 106 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 162 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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, 2.5s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:23,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 853 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 457 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-07-19 18:44:23,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-07-19 18:44:23,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 493. [2022-07-19 18:44:23,827 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-07-19 18:44:23,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 739 transitions. [2022-07-19 18:44:23,831 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 739 transitions. Word has length 117 [2022-07-19 18:44:23,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:23,831 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 739 transitions. [2022-07-19 18:44:23,832 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-07-19 18:44:23,832 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 739 transitions. [2022-07-19 18:44:23,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-19 18:44:23,835 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:23,835 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-07-19 18:44:23,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 18:44:23,835 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:23,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:23,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1402171026, now seen corresponding path program 1 times [2022-07-19 18:44:23,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:23,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263807624] [2022-07-19 18:44:23,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:23,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 18:44:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 18:44:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 18:44:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 18:44:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 18:44:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 18:44:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 18:44:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 18:44:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 18:44:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2022-07-19 18:44:26,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:26,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263807624] [2022-07-19 18:44:26,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263807624] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:44:26,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:44:26,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 18:44:26,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132642141] [2022-07-19 18:44:26,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:44:26,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 18:44:26,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:26,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 18:44:26,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-19 18:44:26,205 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-07-19 18:44:28,308 WARN L534 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-07-19 18:44:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:28,943 INFO L93 Difference]: Finished difference Result 769 states and 1126 transitions. [2022-07-19 18:44:28,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 18:44:28,944 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-07-19 18:44:28,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:28,947 INFO L225 Difference]: With dead ends: 769 [2022-07-19 18:44:28,948 INFO L226 Difference]: Without dead ends: 504 [2022-07-19 18:44:28,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-19 18:44:28,950 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 40 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:28,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 984 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 678 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-07-19 18:44:28,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-07-19 18:44:28,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 491. [2022-07-19 18:44:28,973 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-07-19 18:44:28,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 736 transitions. [2022-07-19 18:44:28,976 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 736 transitions. Word has length 137 [2022-07-19 18:44:28,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:28,976 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 736 transitions. [2022-07-19 18:44:28,977 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-07-19 18:44:28,977 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 736 transitions. [2022-07-19 18:44:28,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-19 18:44:28,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:28,979 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-07-19 18:44:28,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 18:44:28,980 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:28,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:28,980 INFO L85 PathProgramCache]: Analyzing trace with hash 359767575, now seen corresponding path program 1 times [2022-07-19 18:44:28,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:28,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897936500] [2022-07-19 18:44:28,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:28,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:29,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 18:44:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:29,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 18:44:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:29,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 18:44:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:29,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 18:44:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:29,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 18:44:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:29,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 18:44:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:29,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 18:44:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:29,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 18:44:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:29,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 18:44:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:29,403 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-07-19 18:44:29,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:29,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897936500] [2022-07-19 18:44:29,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897936500] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:44:29,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695762023] [2022-07-19 18:44:29,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:29,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:29,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:44:29,406 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:44:29,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 18:44:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 1480 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-19 18:44:30,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:44:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-07-19 18:44:30,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:44:30,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695762023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:44:30,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 18:44:30,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2022-07-19 18:44:30,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505593524] [2022-07-19 18:44:30,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:44:30,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 18:44:30,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:30,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 18:44:30,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-07-19 18:44:30,279 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-07-19 18:44:30,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:30,741 INFO L93 Difference]: Finished difference Result 1207 states and 1913 transitions. [2022-07-19 18:44:30,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 18:44:30,742 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-07-19 18:44:30,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:30,747 INFO L225 Difference]: With dead ends: 1207 [2022-07-19 18:44:30,747 INFO L226 Difference]: Without dead ends: 746 [2022-07-19 18:44:30,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-07-19 18:44:30,752 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 322 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:30,752 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.4s Time] [2022-07-19 18:44:30,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-07-19 18:44:30,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 694. [2022-07-19 18:44:30,784 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-07-19 18:44:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1051 transitions. [2022-07-19 18:44:30,788 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1051 transitions. Word has length 135 [2022-07-19 18:44:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:30,789 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 1051 transitions. [2022-07-19 18:44:30,789 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-07-19 18:44:30,789 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1051 transitions. [2022-07-19 18:44:30,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-19 18:44:30,792 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:30,793 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-07-19 18:44:30,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 18:44:31,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:31,017 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:31,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:31,017 INFO L85 PathProgramCache]: Analyzing trace with hash -462837888, now seen corresponding path program 1 times [2022-07-19 18:44:31,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:31,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165228999] [2022-07-19 18:44:31,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:31,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:32,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 18:44:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:32,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 18:44:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:32,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 18:44:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:32,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 18:44:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:32,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 18:44:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:32,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 18:44:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:32,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 18:44:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:32,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 18:44:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:32,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 18:44:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-19 18:44:32,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:32,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165228999] [2022-07-19 18:44:32,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165228999] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:44:32,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787910523] [2022-07-19 18:44:32,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:32,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:32,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:44:32,755 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:44:32,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 18:44:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:33,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 99 conjunts are in the unsatisfiable core [2022-07-19 18:44:33,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:44:33,512 INFO L356 Elim1Store]: treesize reduction 80, result has 29.2 percent of original size [2022-07-19 18:44:33,513 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-07-19 18:44:33,663 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-07-19 18:44:33,819 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-07-19 18:44:33,960 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-07-19 18:44:34,055 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-07-19 18:44:34,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, 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-07-19 18:44:34,346 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-07-19 18:44:34,483 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-07-19 18:44:34,604 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-07-19 18:44:34,752 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-07-19 18:44:34,759 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-07-19 18:44:34,867 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-07-19 18:44:34,873 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-07-19 18:44:34,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:34,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:34,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:34,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:34,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:34,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:34,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:34,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:34,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:34,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:35,073 INFO L356 Elim1Store]: treesize reduction 114, result has 31.3 percent of original size [2022-07-19 18:44:35,074 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-07-19 18:44:35,107 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-19 18:44:35,108 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 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-19 18:44:35,377 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-07-19 18:44:35,504 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-07-19 18:44:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 33 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-19 18:44:35,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:44:35,770 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-07-19 18:44:35,803 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-07-19 18:44:35,866 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-07-19 18:44:35,916 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-07-19 18:44:35,968 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-07-19 18:44:36,022 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-07-19 18:44:36,097 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-07-19 18:44:36,182 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-07-19 18:44:36,259 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-07-19 18:44:36,333 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-07-19 18:44:36,417 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-07-19 18:44:36,651 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 70 trivial. 78 not checked. [2022-07-19 18:44:36,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787910523] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:44:36,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 18:44:36,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 17] total 34 [2022-07-19 18:44:36,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57783990] [2022-07-19 18:44:36,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 18:44:36,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-19 18:44:36,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:36,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-19 18:44:36,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=423, Unknown=12, NotChecked=572, Total=1122 [2022-07-19 18:44:36,654 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-07-19 18:44:39,124 WARN L534 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-07-19 18:44:41,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:41,421 INFO L93 Difference]: Finished difference Result 1554 states and 2277 transitions. [2022-07-19 18:44:41,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-19 18:44:41,422 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-07-19 18:44:41,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:41,429 INFO L225 Difference]: With dead ends: 1554 [2022-07-19 18:44:41,429 INFO L226 Difference]: Without dead ends: 1045 [2022-07-19 18:44:41,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 282 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=334, Invalid=1338, Unknown=12, NotChecked=968, Total=2652 [2022-07-19 18:44:41,433 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 591 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 408 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s 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, 3.7s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:41,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1287 Invalid, 6856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1667 Invalid, 1 Unknown, 4780 Unchecked, 3.7s Time] [2022-07-19 18:44:41,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2022-07-19 18:44:41,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 976. [2022-07-19 18:44:41,495 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-07-19 18:44:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1470 transitions. [2022-07-19 18:44:41,501 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1470 transitions. Word has length 136 [2022-07-19 18:44:41,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:41,501 INFO L495 AbstractCegarLoop]: Abstraction has 976 states and 1470 transitions. [2022-07-19 18:44:41,501 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-07-19 18:44:41,501 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1470 transitions. [2022-07-19 18:44:41,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-19 18:44:41,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:41,506 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-07-19 18:44:41,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 18:44:41,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-19 18:44:41,728 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:41,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:41,728 INFO L85 PathProgramCache]: Analyzing trace with hash -442404352, now seen corresponding path program 1 times [2022-07-19 18:44:41,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:41,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014297447] [2022-07-19 18:44:41,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:41,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:43,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 18:44:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:43,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 18:44:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:43,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 18:44:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:43,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 18:44:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:43,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 18:44:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:43,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 18:44:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:43,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 18:44:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:43,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 18:44:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:43,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 18:44:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:43,669 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-19 18:44:43,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:43,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014297447] [2022-07-19 18:44:43,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014297447] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:44:43,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429278292] [2022-07-19 18:44:43,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:43,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:43,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:44:43,672 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:44:43,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 18:44:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:44,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-19 18:44:44,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:44:44,523 INFO L356 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-07-19 18:44:44,524 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-07-19 18:44:44,686 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-07-19 18:44:44,760 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-07-19 18:44:44,847 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-07-19 18:44:44,953 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-07-19 18:44:45,085 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-07-19 18:44:45,231 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-07-19 18:44:45,352 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-07-19 18:44:45,449 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-07-19 18:44:45,556 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-07-19 18:44:45,659 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-07-19 18:44:45,666 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-07-19 18:44:45,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:45,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:45,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:45,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:45,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:45,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:45,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:45,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:45,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:45,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:45,867 INFO L356 Elim1Store]: treesize reduction 130, result has 29.7 percent of original size [2022-07-19 18:44:45,868 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-07-19 18:44:45,895 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-19 18:44:45,895 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 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-19 18:44:46,146 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-07-19 18:44:46,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:46,260 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-07-19 18:44:46,298 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-07-19 18:44:46,316 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 33 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-19 18:44:46,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:44:46,456 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-07-19 18:44:46,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429278292] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:44:46,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 18:44:46,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2022-07-19 18:44:46,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914230478] [2022-07-19 18:44:46,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 18:44:46,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 18:44:46,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:46,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 18:44:46,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=380, Unknown=1, NotChecked=40, Total=506 [2022-07-19 18:44:46,477 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-07-19 18:44:48,693 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:44:50,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:50,169 INFO L93 Difference]: Finished difference Result 1167 states and 1697 transitions. [2022-07-19 18:44:50,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 18:44:50,170 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-07-19 18:44:50,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:50,176 INFO L225 Difference]: With dead ends: 1167 [2022-07-19 18:44:50,177 INFO L226 Difference]: Without dead ends: 1042 [2022-07-19 18:44:50,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=809, Unknown=1, NotChecked=60, Total=1056 [2022-07-19 18:44:50,179 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 365 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 232 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s 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.2s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:50,179 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.2s Time] [2022-07-19 18:44:50,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2022-07-19 18:44:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1023. [2022-07-19 18:44:50,235 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-07-19 18:44:50,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1532 transitions. [2022-07-19 18:44:50,239 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1532 transitions. Word has length 136 [2022-07-19 18:44:50,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:50,239 INFO L495 AbstractCegarLoop]: Abstraction has 1023 states and 1532 transitions. [2022-07-19 18:44:50,239 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-07-19 18:44:50,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1532 transitions. [2022-07-19 18:44:50,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-19 18:44:50,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:50,244 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-07-19 18:44:50,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-19 18:44:50,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:50,471 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:50,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:50,472 INFO L85 PathProgramCache]: Analyzing trace with hash 762367328, now seen corresponding path program 1 times [2022-07-19 18:44:50,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:50,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289652773] [2022-07-19 18:44:50,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:50,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 18:44:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 18:44:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 18:44:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 18:44:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 18:44:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 18:44:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 18:44:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 18:44:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 18:44:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,878 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-19 18:44:51,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:51,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289652773] [2022-07-19 18:44:51,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289652773] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:44:51,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850259633] [2022-07-19 18:44:51,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:51,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:51,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:44:51,884 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:44:51,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 18:44:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:52,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 81 conjunts are in the unsatisfiable core [2022-07-19 18:44:52,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:44:52,694 INFO L356 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-07-19 18:44:52,694 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-07-19 18:44:52,837 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-07-19 18:44:52,939 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-07-19 18:44:53,020 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-07-19 18:44:53,137 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-07-19 18:44:53,280 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-07-19 18:44:53,438 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-07-19 18:44:53,503 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-07-19 18:44:53,644 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-07-19 18:44:53,745 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-07-19 18:44:53,842 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-07-19 18:44:53,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:53,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:53,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:53,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:53,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:53,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:53,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:53,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:53,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:53,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:54,060 INFO L356 Elim1Store]: treesize reduction 130, result has 29.7 percent of original size [2022-07-19 18:44:54,060 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-07-19 18:44:54,085 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-19 18:44:54,085 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 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-19 18:44:54,315 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-07-19 18:44:54,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:44:54,423 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-07-19 18:44:54,450 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-07-19 18:44:54,466 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 33 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-19 18:44:54,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:44:54,587 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-07-19 18:44:54,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850259633] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:44:54,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 18:44:54,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2022-07-19 18:44:54,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560929535] [2022-07-19 18:44:54,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 18:44:54,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 18:44:54,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:54,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 18:44:54,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=380, Unknown=1, NotChecked=40, Total=506 [2022-07-19 18:44:54,605 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-07-19 18:44:56,770 WARN L534 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-07-19 18:44:58,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:58,366 INFO L93 Difference]: Finished difference Result 1556 states and 2214 transitions. [2022-07-19 18:44:58,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 18:44:58,367 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-07-19 18:44:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:58,373 INFO L225 Difference]: With dead ends: 1556 [2022-07-19 18:44:58,373 INFO L226 Difference]: Without dead ends: 1007 [2022-07-19 18:44:58,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=809, Unknown=1, NotChecked=60, Total=1056 [2022-07-19 18:44:58,375 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 341 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 244 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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, 3.4s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:58,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1341 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1755 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-07-19 18:44:58,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2022-07-19 18:44:58,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 982. [2022-07-19 18:44:58,426 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-07-19 18:44:58,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1472 transitions. [2022-07-19 18:44:58,431 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1472 transitions. Word has length 136 [2022-07-19 18:44:58,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:58,431 INFO L495 AbstractCegarLoop]: Abstraction has 982 states and 1472 transitions. [2022-07-19 18:44:58,431 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-07-19 18:44:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1472 transitions. [2022-07-19 18:44:58,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-19 18:44:58,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:58,435 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-07-19 18:44:58,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 18:44:58,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:58,660 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:58,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:58,660 INFO L85 PathProgramCache]: Analyzing trace with hash 945379520, now seen corresponding path program 1 times [2022-07-19 18:44:58,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:58,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655086985] [2022-07-19 18:44:58,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:58,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:45:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:00,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 18:45:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:00,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 18:45:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:00,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 18:45:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:00,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 18:45:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:00,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 18:45:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:00,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 18:45:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:00,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 18:45:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:00,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 18:45:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:00,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 18:45:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-19 18:45:00,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:45:00,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655086985] [2022-07-19 18:45:00,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655086985] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:45:00,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299474362] [2022-07-19 18:45:00,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:00,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:00,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:45:00,864 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:45:00,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 18:45:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:01,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-19 18:45:01,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:45:01,671 INFO L356 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-07-19 18:45:01,671 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-07-19 18:45:01,766 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-07-19 18:45:01,843 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-07-19 18:45:01,924 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-07-19 18:45:02,005 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-07-19 18:45:02,127 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-07-19 18:45:02,314 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-07-19 18:45:02,415 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-07-19 18:45:02,481 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-07-19 18:45:02,610 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-07-19 18:45:02,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-07-19 18:45:02,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:02,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:02,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:02,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:02,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:02,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:02,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:02,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:02,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:02,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:02,961 INFO L356 Elim1Store]: treesize reduction 130, result has 29.7 percent of original size [2022-07-19 18:45:02,962 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 2496 treesize of output 897 [2022-07-19 18:45:02,991 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-19 18:45:02,991 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 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-19 18:45:03,227 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-07-19 18:45:03,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:03,311 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-07-19 18:45:03,329 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-07-19 18:45:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 33 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-19 18:45:03,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:45:03,480 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10019 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_~#__CS_thread_status~0.base| v_ArrVal_10019) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-19 18:45:03,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299474362] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:45:03,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 18:45:03,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2022-07-19 18:45:03,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111155828] [2022-07-19 18:45:03,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 18:45:03,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 18:45:03,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:45:03,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 18:45:03,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=380, Unknown=1, NotChecked=40, Total=506 [2022-07-19 18:45:03,496 INFO L87 Difference]: Start difference. First operand 982 states and 1472 transitions. Second operand has 20 states, 20 states have (on average 6.8) internal successors, (136), 16 states have internal predecessors, (136), 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-07-19 18:45:05,661 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:45:07,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:45:07,233 INFO L93 Difference]: Finished difference Result 1486 states and 2137 transitions. [2022-07-19 18:45:07,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 18:45:07,234 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.8) internal successors, (136), 16 states have internal predecessors, (136), 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-07-19 18:45:07,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:45:07,239 INFO L225 Difference]: With dead ends: 1486 [2022-07-19 18:45:07,240 INFO L226 Difference]: Without dead ends: 950 [2022-07-19 18:45:07,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=809, Unknown=1, NotChecked=60, Total=1056 [2022-07-19 18:45:07,243 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 404 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 1678 mSolverCounterSat, 257 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 1678 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-19 18:45:07,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1298 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 1678 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-07-19 18:45:07,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2022-07-19 18:45:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 931. [2022-07-19 18:45:07,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 691 states have (on average 1.227206946454414) internal successors, (848), 623 states have internal predecessors, (848), 169 states have call successors, (169), 38 states have call predecessors, (169), 70 states have return successors, (385), 269 states have call predecessors, (385), 169 states have call successors, (385) [2022-07-19 18:45:07,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1402 transitions. [2022-07-19 18:45:07,297 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1402 transitions. Word has length 136 [2022-07-19 18:45:07,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:45:07,297 INFO L495 AbstractCegarLoop]: Abstraction has 931 states and 1402 transitions. [2022-07-19 18:45:07,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.8) internal successors, (136), 16 states have internal predecessors, (136), 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-07-19 18:45:07,297 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1402 transitions. [2022-07-19 18:45:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-19 18:45:07,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:45:07,301 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:45:07,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-19 18:45:07,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-19 18:45:07,520 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:45:07,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:45:07,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1167717052, now seen corresponding path program 1 times [2022-07-19 18:45:07,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:45:07,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615891487] [2022-07-19 18:45:07,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:07,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:45:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:09,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 18:45:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:09,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 18:45:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:09,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 18:45:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:09,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 18:45:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:09,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 18:45:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:09,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 18:45:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:09,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 18:45:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-19 18:45:09,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:45:09,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615891487] [2022-07-19 18:45:09,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615891487] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:45:09,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:45:09,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 18:45:09,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667330419] [2022-07-19 18:45:09,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:45:09,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 18:45:09,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:45:09,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 18:45:09,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-19 18:45:09,197 INFO L87 Difference]: Start difference. First operand 931 states and 1402 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-19 18:45:10,980 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:45:12,998 WARN L534 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-07-19 18:45:15,674 WARN L534 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-07-19 18:45:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:45:16,420 INFO L93 Difference]: Finished difference Result 1169 states and 1714 transitions. [2022-07-19 18:45:16,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 18:45:16,420 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 118 [2022-07-19 18:45:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:45:16,425 INFO L225 Difference]: With dead ends: 1169 [2022-07-19 18:45:16,426 INFO L226 Difference]: Without dead ends: 962 [2022-07-19 18:45:16,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2022-07-19 18:45:16,428 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 545 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 269 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:45:16,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 748 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 582 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-07-19 18:45:16,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2022-07-19 18:45:16,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 916. [2022-07-19 18:45:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 678 states have (on average 1.2271386430678466) internal successors, (832), 614 states have internal predecessors, (832), 167 states have call successors, (167), 37 states have call predecessors, (167), 70 states have return successors, (379), 264 states have call predecessors, (379), 167 states have call successors, (379) [2022-07-19 18:45:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1378 transitions. [2022-07-19 18:45:16,489 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1378 transitions. Word has length 118 [2022-07-19 18:45:16,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:45:16,489 INFO L495 AbstractCegarLoop]: Abstraction has 916 states and 1378 transitions. [2022-07-19 18:45:16,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-19 18:45:16,490 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1378 transitions. [2022-07-19 18:45:16,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-19 18:45:16,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:45:16,495 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:45:16,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 18:45:16,495 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:45:16,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:45:16,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1474702243, now seen corresponding path program 1 times [2022-07-19 18:45:16,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:45:16,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131623553] [2022-07-19 18:45:16,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:16,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:45:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:16,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 18:45:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:16,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 18:45:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:16,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 18:45:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:16,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 18:45:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:17,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 18:45:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:17,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 18:45:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:17,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:45:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:17,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 18:45:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:17,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 18:45:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:17,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 18:45:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-07-19 18:45:17,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:45:17,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131623553] [2022-07-19 18:45:17,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131623553] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:45:17,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555709241] [2022-07-19 18:45:17,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:17,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:17,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:45:17,093 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:45:17,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 18:45:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:17,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 1675 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-19 18:45:17,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:45:17,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2022-07-19 18:45:17,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-19 18:45:18,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 18:45:18,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-19 18:45:18,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-07-19 18:45:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-07-19 18:45:18,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:45:18,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 8 [2022-07-19 18:45:18,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555709241] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:45:18,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 18:45:18,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2022-07-19 18:45:18,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047621123] [2022-07-19 18:45:18,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 18:45:18,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 18:45:18,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:45:18,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 18:45:18,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-07-19 18:45:18,322 INFO L87 Difference]: Start difference. First operand 916 states and 1378 transitions. Second operand has 18 states, 17 states have (on average 6.823529411764706) internal successors, (116), 14 states have internal predecessors, (116), 9 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-07-19 18:45:20,367 WARN L534 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-07-19 18:45:23,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:45:23,630 INFO L93 Difference]: Finished difference Result 1983 states and 3071 transitions. [2022-07-19 18:45:23,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-19 18:45:23,631 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.823529411764706) internal successors, (116), 14 states have internal predecessors, (116), 9 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) Word has length 147 [2022-07-19 18:45:23,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:45:23,638 INFO L225 Difference]: With dead ends: 1983 [2022-07-19 18:45:23,638 INFO L226 Difference]: Without dead ends: 1112 [2022-07-19 18:45:23,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=563, Invalid=2299, Unknown=0, NotChecked=0, Total=2862 [2022-07-19 18:45:23,644 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 827 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 2395 mSolverCounterSat, 556 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 2435 SdHoareTripleChecker+Invalid, 3260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 556 IncrementalHoareTripleChecker+Valid, 2395 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 308 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:45:23,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 2435 Invalid, 3260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [556 Valid, 2395 Invalid, 1 Unknown, 308 Unchecked, 4.0s Time] [2022-07-19 18:45:23,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2022-07-19 18:45:23,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 960. [2022-07-19 18:45:23,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 694 states have (on average 1.2507204610951008) internal successors, (868), 612 states have internal predecessors, (868), 199 states have call successors, (199), 33 states have call predecessors, (199), 66 states have return successors, (459), 314 states have call predecessors, (459), 199 states have call successors, (459) [2022-07-19 18:45:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1526 transitions. [2022-07-19 18:45:23,718 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1526 transitions. Word has length 147 [2022-07-19 18:45:23,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:45:23,718 INFO L495 AbstractCegarLoop]: Abstraction has 960 states and 1526 transitions. [2022-07-19 18:45:23,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.823529411764706) internal successors, (116), 14 states have internal predecessors, (116), 9 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-07-19 18:45:23,719 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1526 transitions. [2022-07-19 18:45:23,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-19 18:45:23,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:45:23,724 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:45:23,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 18:45:23,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-19 18:45:23,950 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:45:23,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:45:23,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1732460611, now seen corresponding path program 1 times [2022-07-19 18:45:23,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:45:23,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672942150] [2022-07-19 18:45:23,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:23,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:45:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:24,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 18:45:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:24,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 18:45:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:24,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 18:45:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:24,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 18:45:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:24,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 18:45:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:24,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 18:45:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:24,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:45:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:24,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 18:45:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:24,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 18:45:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:24,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 18:45:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:24,471 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-07-19 18:45:24,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:45:24,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672942150] [2022-07-19 18:45:24,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672942150] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:45:24,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393352583] [2022-07-19 18:45:24,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:24,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:24,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:45:24,476 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:45:24,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 18:45:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:25,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 1675 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-19 18:45:25,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:45:25,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2022-07-19 18:45:25,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-19 18:45:25,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 18:45:25,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-19 18:45:25,577 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-07-19 18:45:25,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:45:25,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 8 [2022-07-19 18:45:25,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393352583] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:45:25,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 18:45:25,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 17 [2022-07-19 18:45:25,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280551879] [2022-07-19 18:45:25,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 18:45:25,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 18:45:25,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:45:25,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 18:45:25,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-07-19 18:45:25,746 INFO L87 Difference]: Start difference. First operand 960 states and 1526 transitions. Second operand has 17 states, 16 states have (on average 6.5) internal successors, (104), 13 states have internal predecessors, (104), 8 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-07-19 18:45:27,771 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:45:30,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:45:30,853 INFO L93 Difference]: Finished difference Result 1744 states and 2635 transitions. [2022-07-19 18:45:30,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-19 18:45:30,853 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.5) internal successors, (104), 13 states have internal predecessors, (104), 8 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Word has length 147 [2022-07-19 18:45:30,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:45:30,860 INFO L225 Difference]: With dead ends: 1744 [2022-07-19 18:45:30,860 INFO L226 Difference]: Without dead ends: 1149 [2022-07-19 18:45:30,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 241 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=554, Invalid=2098, Unknown=0, NotChecked=0, Total=2652 [2022-07-19 18:45:30,864 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 732 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 621 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 2242 SdHoareTripleChecker+Invalid, 3034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 621 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 330 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-19 18:45:30,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 2242 Invalid, 3034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [621 Valid, 2082 Invalid, 1 Unknown, 330 Unchecked, 3.9s Time] [2022-07-19 18:45:30,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2022-07-19 18:45:30,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1003. [2022-07-19 18:45:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 731 states have (on average 1.2462380300957592) internal successors, (911), 660 states have internal predecessors, (911), 192 states have call successors, (192), 39 states have call predecessors, (192), 79 states have return successors, (450), 303 states have call predecessors, (450), 192 states have call successors, (450) [2022-07-19 18:45:30,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1553 transitions. [2022-07-19 18:45:30,945 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1553 transitions. Word has length 147 [2022-07-19 18:45:30,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:45:30,946 INFO L495 AbstractCegarLoop]: Abstraction has 1003 states and 1553 transitions. [2022-07-19 18:45:30,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.5) internal successors, (104), 13 states have internal predecessors, (104), 8 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-07-19 18:45:30,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1553 transitions. [2022-07-19 18:45:30,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-19 18:45:30,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:45:30,952 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:45:30,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 18:45:31,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:31,176 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:45:31,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:45:31,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2098606569, now seen corresponding path program 1 times [2022-07-19 18:45:31,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:45:31,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524986747] [2022-07-19 18:45:31,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:31,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:45:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:31,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 18:45:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:31,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 18:45:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:31,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 18:45:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:31,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 18:45:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:31,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 18:45:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:31,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 18:45:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:31,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 18:45:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:31,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 18:45:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:31,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 18:45:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:31,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 18:45:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:31,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 18:45:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:31,535 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-07-19 18:45:31,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:45:31,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524986747] [2022-07-19 18:45:31,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524986747] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:45:31,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120760784] [2022-07-19 18:45:31,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:31,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:31,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:45:31,538 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:45:31,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-19 18:45:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:32,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 1701 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-19 18:45:32,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:45:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-07-19 18:45:32,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:45:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-07-19 18:45:33,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120760784] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:45:33,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 18:45:33,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 21 [2022-07-19 18:45:33,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073354877] [2022-07-19 18:45:33,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 18:45:33,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-19 18:45:33,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:45:33,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-19 18:45:33,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2022-07-19 18:45:33,017 INFO L87 Difference]: Start difference. First operand 1003 states and 1553 transitions. Second operand has 21 states, 20 states have (on average 5.55) internal successors, (111), 17 states have internal predecessors, (111), 9 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (26), 8 states have call predecessors, (26), 9 states have call successors, (26) [2022-07-19 18:45:35,034 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:45:37,415 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:45:41,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:45:41,091 INFO L93 Difference]: Finished difference Result 2865 states and 4529 transitions. [2022-07-19 18:45:41,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-19 18:45:41,096 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.55) internal successors, (111), 17 states have internal predecessors, (111), 9 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (26), 8 states have call predecessors, (26), 9 states have call successors, (26) Word has length 146 [2022-07-19 18:45:41,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:45:41,109 INFO L225 Difference]: With dead ends: 2865 [2022-07-19 18:45:41,109 INFO L226 Difference]: Without dead ends: 1918 [2022-07-19 18:45:41,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=535, Invalid=2221, Unknown=0, NotChecked=0, Total=2756 [2022-07-19 18:45:41,118 INFO L413 NwaCegarLoop]: 439 mSDtfsCounter, 1306 mSDsluCounter, 2058 mSDsCounter, 0 mSdLazyCounter, 2535 mSolverCounterSat, 962 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 2497 SdHoareTripleChecker+Invalid, 3499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 962 IncrementalHoareTripleChecker+Valid, 2535 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-19 18:45:41,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 2497 Invalid, 3499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [962 Valid, 2535 Invalid, 2 Unknown, 0 Unchecked, 7.2s Time] [2022-07-19 18:45:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2022-07-19 18:45:41,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1768. [2022-07-19 18:45:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1293 states have (on average 1.2405259087393659) internal successors, (1604), 1173 states have internal predecessors, (1604), 325 states have call successors, (325), 75 states have call predecessors, (325), 149 states have return successors, (866), 519 states have call predecessors, (866), 325 states have call successors, (866) [2022-07-19 18:45:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 2795 transitions. [2022-07-19 18:45:41,300 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 2795 transitions. Word has length 146 [2022-07-19 18:45:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:45:41,301 INFO L495 AbstractCegarLoop]: Abstraction has 1768 states and 2795 transitions. [2022-07-19 18:45:41,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.55) internal successors, (111), 17 states have internal predecessors, (111), 9 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (26), 8 states have call predecessors, (26), 9 states have call successors, (26) [2022-07-19 18:45:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2795 transitions. [2022-07-19 18:45:41,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-19 18:45:41,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:45:41,310 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:45:41,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-19 18:45:41,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:41,526 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:45:41,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:45:41,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1887788041, now seen corresponding path program 1 times [2022-07-19 18:45:41,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:45:41,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659579723] [2022-07-19 18:45:41,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:41,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:45:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:43,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 18:45:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:43,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 18:45:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:43,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 18:45:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:43,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 18:45:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:43,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 18:45:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:43,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 18:45:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:44,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 18:45:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:44,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 18:45:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:44,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 18:45:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:44,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 18:45:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:44,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 18:45:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-07-19 18:45:44,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:45:44,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659579723] [2022-07-19 18:45:44,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659579723] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:45:44,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142893483] [2022-07-19 18:45:44,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:44,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:44,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:45:44,305 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:45:44,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-19 18:45:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:45,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 1847 conjuncts, 121 conjunts are in the unsatisfiable core [2022-07-19 18:45:45,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:45:45,584 INFO L356 Elim1Store]: treesize reduction 338, result has 14.0 percent of original size [2022-07-19 18:45:45,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 79 [2022-07-19 18:45:47,521 INFO L356 Elim1Store]: treesize reduction 156, result has 41.1 percent of original size [2022-07-19 18:45:47,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 894 treesize of output 805 [2022-07-19 18:45:47,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 18:45:47,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 18:45:47,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 18:45:47,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 18:45:48,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:48,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:48,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:48,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:48,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:48,795 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-07-19 18:45:48,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 557 treesize of output 512 [2022-07-19 18:45:48,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-19 18:45:48,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-19 18:45:48,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-19 18:45:49,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:49,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:49,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:49,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:49,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 18:45:49,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:49,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:49,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 18:45:49,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 38 [2022-07-19 18:45:49,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-19 18:45:49,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-19 18:45:49,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-19 18:45:49,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:49,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:49,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:49,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:49,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:49,128 INFO L356 Elim1Store]: treesize reduction 35, result has 31.4 percent of original size [2022-07-19 18:45:49,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 270 treesize of output 300 [2022-07-19 18:45:49,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 18:45:49,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 1 [2022-07-19 18:45:49,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-19 18:45:50,330 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-19 18:45:50,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 22 [2022-07-19 18:45:50,660 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-19 18:45:50,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 22 [2022-07-19 18:45:50,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:50,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:50,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:50,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:50,966 INFO L356 Elim1Store]: treesize reduction 69, result has 49.3 percent of original size [2022-07-19 18:45:50,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 450 treesize of output 464 [2022-07-19 18:45:50,981 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-19 18:45:51,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-19 18:45:51,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-19 18:45:51,195 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-19 18:45:51,199 INFO L158 Benchmark]: Toolchain (without parser) took 117371.50ms. Allocated memory was 121.6MB in the beginning and 809.5MB in the end (delta: 687.9MB). Free memory was 88.6MB in the beginning and 433.6MB in the end (delta: -345.0MB). Peak memory consumption was 341.5MB. Max. memory is 16.1GB. [2022-07-19 18:45:51,199 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 86.0MB. Free memory was 43.9MB in the beginning and 43.9MB in the end (delta: 43.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 18:45:51,199 INFO L158 Benchmark]: CACSL2BoogieTranslator took 613.07ms. Allocated memory is still 121.6MB. Free memory was 88.4MB in the beginning and 83.2MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 18:45:51,200 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.32ms. Allocated memory is still 121.6MB. Free memory was 83.2MB in the beginning and 78.9MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 18:45:51,200 INFO L158 Benchmark]: Boogie Preprocessor took 52.78ms. Allocated memory is still 121.6MB. Free memory was 78.9MB in the beginning and 75.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 18:45:51,200 INFO L158 Benchmark]: RCFGBuilder took 1277.93ms. Allocated memory is still 121.6MB. Free memory was 75.5MB in the beginning and 79.9MB in the end (delta: -4.4MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. [2022-07-19 18:45:51,200 INFO L158 Benchmark]: TraceAbstraction took 115342.85ms. Allocated memory was 121.6MB in the beginning and 809.5MB in the end (delta: 687.9MB). Free memory was 79.8MB in the beginning and 433.6MB in the end (delta: -353.8MB). Peak memory consumption was 334.6MB. Max. memory is 16.1GB. [2022-07-19 18:45:51,201 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 86.0MB. Free memory was 43.9MB in the beginning and 43.9MB in the end (delta: 43.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 613.07ms. Allocated memory is still 121.6MB. Free memory was 88.4MB in the beginning and 83.2MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.32ms. Allocated memory is still 121.6MB. Free memory was 83.2MB in the beginning and 78.9MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.78ms. Allocated memory is still 121.6MB. Free memory was 78.9MB in the beginning and 75.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1277.93ms. Allocated memory is still 121.6MB. Free memory was 75.5MB in the beginning and 79.9MB in the end (delta: -4.4MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. * TraceAbstraction took 115342.85ms. Allocated memory was 121.6MB in the beginning and 809.5MB in the end (delta: 687.9MB). Free memory was 79.8MB in the beginning and 433.6MB in the end (delta: -353.8MB). Peak memory consumption was 334.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-19 18:45:51,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_lazy.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 18:45:53,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 18:45:53,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 18:45:53,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 18:45:53,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 18:45:53,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 18:45:53,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 18:45:53,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 18:45:53,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 18:45:53,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 18:45:53,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 18:45:53,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 18:45:53,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 18:45:53,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 18:45:53,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 18:45:53,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 18:45:53,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 18:45:53,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 18:45:53,283 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 18:45:53,285 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 18:45:53,286 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 18:45:53,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 18:45:53,288 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 18:45:53,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 18:45:53,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 18:45:53,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 18:45:53,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 18:45:53,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 18:45:53,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 18:45:53,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 18:45:53,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 18:45:53,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 18:45:53,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 18:45:53,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 18:45:53,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 18:45:53,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 18:45:53,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 18:45:53,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 18:45:53,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 18:45:53,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 18:45:53,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 18:45:53,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 18:45:53,304 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 18:45:53,325 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 18:45:53,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 18:45:53,326 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 18:45:53,326 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 18:45:53,327 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 18:45:53,328 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 18:45:53,328 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 18:45:53,329 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 18:45:53,329 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 18:45:53,329 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 18:45:53,330 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 18:45:53,330 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 18:45:53,330 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 18:45:53,330 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 18:45:53,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 18:45:53,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 18:45:53,344 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 18:45:53,344 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 18:45:53,344 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 18:45:53,344 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 18:45:53,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 18:45:53,345 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 18:45:53,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 18:45:53,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 18:45:53,346 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 18:45:53,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 18:45:53,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 18:45:53,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 18:45:53,347 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 18:45:53,347 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 18:45:53,348 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 18:45:53,348 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 18:45:53,348 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 18:45:53,348 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 18:45:53,349 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 18:45:53,350 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 18:45:53,350 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-07-19 18:45:53,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 18:45:53,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 18:45:53,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 18:45:53,728 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 18:45:53,729 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 18:45:53,731 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lazy.i [2022-07-19 18:45:53,806 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e469c5980/a971fe9185014266a5a157b4d68b1ffd/FLAG438a65ca7 [2022-07-19 18:45:54,335 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 18:45:54,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i [2022-07-19 18:45:54,349 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e469c5980/a971fe9185014266a5a157b4d68b1ffd/FLAG438a65ca7 [2022-07-19 18:45:54,689 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e469c5980/a971fe9185014266a5a157b4d68b1ffd [2022-07-19 18:45:54,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 18:45:54,692 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 18:45:54,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 18:45:54,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 18:45:54,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 18:45:54,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 06:45:54" (1/1) ... [2022-07-19 18:45:54,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1465d48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:45:54, skipping insertion in model container [2022-07-19 18:45:54,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 06:45:54" (1/1) ... [2022-07-19 18:45:54,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 18:45:54,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 18:45:55,064 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i[23394,23407] [2022-07-19 18:45:55,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 18:45:55,210 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 18:45:55,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i[23394,23407] [2022-07-19 18:45:55,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 18:45:55,318 INFO L208 MainTranslator]: Completed translation [2022-07-19 18:45:55,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:45:55 WrapperNode [2022-07-19 18:45:55,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 18:45:55,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 18:45:55,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 18:45:55,328 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 18:45:55,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:45:55" (1/1) ... [2022-07-19 18:45:55,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:45:55" (1/1) ... [2022-07-19 18:45:55,430 INFO L137 Inliner]: procedures = 149, calls = 212, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2022-07-19 18:45:55,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 18:45:55,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 18:45:55,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 18:45:55,431 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 18:45:55,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:45:55" (1/1) ... [2022-07-19 18:45:55,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:45:55" (1/1) ... [2022-07-19 18:45:55,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:45:55" (1/1) ... [2022-07-19 18:45:55,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:45:55" (1/1) ... [2022-07-19 18:45:55,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:45:55" (1/1) ... [2022-07-19 18:45:55,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:45:55" (1/1) ... [2022-07-19 18:45:55,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:45:55" (1/1) ... [2022-07-19 18:45:55,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 18:45:55,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 18:45:55,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 18:45:55,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 18:45:55,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:45:55" (1/1) ... [2022-07-19 18:45:55,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 18:45:55,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:45:55,573 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 18:45:55,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 18:45:55,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-19 18:45:55,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 18:45:55,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 18:45:55,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 18:45:55,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 18:45:55,618 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-07-19 18:45:55,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-07-19 18:45:55,618 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-19 18:45:55,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-19 18:45:55,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 18:45:55,619 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-19 18:45:55,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-19 18:45:55,619 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-19 18:45:55,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-19 18:45:55,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-19 18:45:55,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 18:45:55,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 18:45:55,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 18:45:55,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 18:45:55,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-19 18:45:55,620 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-19 18:45:55,620 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-19 18:45:55,620 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-07-19 18:45:55,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-07-19 18:45:55,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 18:45:55,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 18:45:55,865 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 18:45:55,867 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 18:45:56,259 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv32, 0bv32; [2022-07-19 18:45:56,259 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-07-19 18:45:56,259 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv32, 0bv32; [2022-07-19 18:45:56,259 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##33: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-07-19 18:45:56,260 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: SUMMARY for call __CS_cs(); srcloc: null [2022-07-19 18:45:56,260 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv32, 0bv32; [2022-07-19 18:45:56,260 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-07-19 18:45:58,821 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 18:45:58,829 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 18:45:58,829 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 18:45:58,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 06:45:58 BoogieIcfgContainer [2022-07-19 18:45:58,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 18:45:58,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 18:45:58,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 18:45:58,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 18:45:58,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 06:45:54" (1/3) ... [2022-07-19 18:45:58,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f46a8cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 06:45:58, skipping insertion in model container [2022-07-19 18:45:58,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:45:55" (2/3) ... [2022-07-19 18:45:58,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f46a8cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 06:45:58, skipping insertion in model container [2022-07-19 18:45:58,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 06:45:58" (3/3) ... [2022-07-19 18:45:58,839 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_lazy.i [2022-07-19 18:45:58,852 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 18:45:58,852 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 18:45:58,908 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 18:45:58,916 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56589dff, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1b60796a [2022-07-19 18:45:58,916 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 18:45:58,920 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-07-19 18:45:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 18:45:58,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:45:58,934 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-07-19 18:45:58,934 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:45:58,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:45:58,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1643557001, now seen corresponding path program 1 times [2022-07-19 18:45:58,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:45:58,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3793370] [2022-07-19 18:45:58,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:58,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:45:58,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:45:58,957 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:45:58,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 18:45:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:59,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-19 18:45:59,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:45:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 18:45:59,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:45:59,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:45:59,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3793370] [2022-07-19 18:45:59,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3793370] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:45:59,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:45:59,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 18:45:59,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764132338] [2022-07-19 18:45:59,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:45:59,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 18:45:59,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:45:59,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 18:45:59,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 18:45:59,465 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 2 states, 2 states have (on average 17.0) internal successors, (34), 2 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-07-19 18:45:59,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:45:59,529 INFO L93 Difference]: Finished difference Result 326 states and 530 transitions. [2022-07-19 18:45:59,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 18:45:59,534 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 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-07-19 18:45:59,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:45:59,570 INFO L225 Difference]: With dead ends: 326 [2022-07-19 18:45:59,570 INFO L226 Difference]: Without dead ends: 160 [2022-07-19 18:45:59,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 18:45:59,585 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:45:59,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 18:45:59,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-19 18:45:59,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-07-19 18:45:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 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-07-19 18:45:59,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 233 transitions. [2022-07-19 18:45:59,665 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 233 transitions. Word has length 34 [2022-07-19 18:45:59,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:45:59,666 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 233 transitions. [2022-07-19 18:45:59,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 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-07-19 18:45:59,666 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 233 transitions. [2022-07-19 18:45:59,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 18:45:59,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:45:59,677 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-07-19 18:45:59,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-19 18:45:59,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:45:59,894 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:45:59,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:45:59,895 INFO L85 PathProgramCache]: Analyzing trace with hash 819536951, now seen corresponding path program 1 times [2022-07-19 18:45:59,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:45:59,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612667395] [2022-07-19 18:45:59,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:59,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:45:59,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:45:59,899 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:45:59,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 18:46:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:00,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 18:46:00,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:46:00,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 18:46:00,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:46:00,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:46:00,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612667395] [2022-07-19 18:46:00,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612667395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:46:00,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:46:00,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 18:46:00,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216316336] [2022-07-19 18:46:00,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:46:00,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 18:46:00,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:46:00,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 18:46:00,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:46:00,351 INFO L87 Difference]: Start difference. First operand 160 states and 233 transitions. 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-07-19 18:46:00,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:46:00,483 INFO L93 Difference]: Finished difference Result 318 states and 464 transitions. [2022-07-19 18:46:00,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 18:46:00,487 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-07-19 18:46:00,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:46:00,490 INFO L225 Difference]: With dead ends: 318 [2022-07-19 18:46:00,490 INFO L226 Difference]: Without dead ends: 165 [2022-07-19 18:46:00,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:46:00,492 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 5 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 456 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.1s IncrementalHoareTripleChecker+Time [2022-07-19 18:46:00,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 456 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 18:46:00,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-19 18:46:00,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2022-07-19 18:46:00,504 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-07-19 18:46:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 234 transitions. [2022-07-19 18:46:00,506 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 234 transitions. Word has length 34 [2022-07-19 18:46:00,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:46:00,506 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 234 transitions. [2022-07-19 18:46:00,507 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-07-19 18:46:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 234 transitions. [2022-07-19 18:46:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 18:46:00,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:46:00,508 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-07-19 18:46:00,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-19 18:46:00,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:46:00,712 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:46:00,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:46:00,713 INFO L85 PathProgramCache]: Analyzing trace with hash -883018881, now seen corresponding path program 1 times [2022-07-19 18:46:00,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:46:00,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217442922] [2022-07-19 18:46:00,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:46:00,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:46:00,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:46:00,715 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:46:00,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 18:46:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:01,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 18:46:01,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:46:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 18:46:01,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:46:01,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:46:01,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217442922] [2022-07-19 18:46:01,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217442922] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:46:01,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:46:01,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 18:46:01,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669672708] [2022-07-19 18:46:01,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:46:01,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 18:46:01,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:46:01,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 18:46:01,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:46:01,114 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-07-19 18:46:01,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:46:01,180 INFO L93 Difference]: Finished difference Result 321 states and 468 transitions. [2022-07-19 18:46:01,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 18:46:01,184 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-07-19 18:46:01,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:46:01,185 INFO L225 Difference]: With dead ends: 321 [2022-07-19 18:46:01,185 INFO L226 Difference]: Without dead ends: 163 [2022-07-19 18:46:01,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:46:01,187 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.1s IncrementalHoareTripleChecker+Time [2022-07-19 18:46:01,188 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.1s Time] [2022-07-19 18:46:01,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-19 18:46:01,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2022-07-19 18:46:01,199 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-07-19 18:46:01,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 235 transitions. [2022-07-19 18:46:01,200 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 235 transitions. Word has length 38 [2022-07-19 18:46:01,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:46:01,201 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 235 transitions. [2022-07-19 18:46:01,201 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-07-19 18:46:01,201 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 235 transitions. [2022-07-19 18:46:01,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 18:46:01,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:46:01,202 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-07-19 18:46:01,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-19 18:46:01,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:46:01,412 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:46:01,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:46:01,413 INFO L85 PathProgramCache]: Analyzing trace with hash -786448707, now seen corresponding path program 1 times [2022-07-19 18:46:01,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:46:01,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341445456] [2022-07-19 18:46:01,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:46:01,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:46:01,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:46:01,415 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:46:01,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 18:46:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:01,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 18:46:01,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:46:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 18:46:01,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:46:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 18:46:01,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:46:01,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341445456] [2022-07-19 18:46:01,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341445456] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:46:01,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 18:46:01,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-19 18:46:01,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693042298] [2022-07-19 18:46:01,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 18:46:01,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 18:46:01,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:46:01,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 18:46:01,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-19 18:46:01,961 INFO L87 Difference]: Start difference. First operand 162 states and 235 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-07-19 18:46:02,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:46:02,222 INFO L93 Difference]: Finished difference Result 327 states and 476 transitions. [2022-07-19 18:46:02,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 18:46:02,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-07-19 18:46:02,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:46:02,225 INFO L225 Difference]: With dead ends: 327 [2022-07-19 18:46:02,225 INFO L226 Difference]: Without dead ends: 168 [2022-07-19 18:46:02,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-07-19 18:46:02,227 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 4 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 18:46:02,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1143 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 18:46:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-19 18:46:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-07-19 18:46:02,238 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-07-19 18:46:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 241 transitions. [2022-07-19 18:46:02,240 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 241 transitions. Word has length 40 [2022-07-19 18:46:02,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:46:02,240 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 241 transitions. [2022-07-19 18:46:02,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-07-19 18:46:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 241 transitions. [2022-07-19 18:46:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 18:46:02,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:46:02,242 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-07-19 18:46:02,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-19 18:46:02,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:46:02,461 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:46:02,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:46:02,461 INFO L85 PathProgramCache]: Analyzing trace with hash 386454391, now seen corresponding path program 2 times [2022-07-19 18:46:02,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:46:02,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015495516] [2022-07-19 18:46:02,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 18:46:02,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:46:02,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:46:02,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:46:02,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 18:46:02,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 18:46:02,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 18:46:02,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 18:46:02,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:46:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 18:46:02,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:46:02,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:46:02,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015495516] [2022-07-19 18:46:02,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015495516] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:46:02,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:46:02,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 18:46:02,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719310834] [2022-07-19 18:46:02,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:46:02,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 18:46:02,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:46:02,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 18:46:02,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:46:02,914 INFO L87 Difference]: Start difference. First operand 168 states and 241 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) 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-07-19 18:46:02,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:46:02,934 INFO L93 Difference]: Finished difference Result 316 states and 457 transitions. [2022-07-19 18:46:02,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 18:46:02,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) 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-07-19 18:46:02,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:46:02,937 INFO L225 Difference]: With dead ends: 316 [2022-07-19 18:46:02,937 INFO L226 Difference]: Without dead ends: 168 [2022-07-19 18:46:02,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:46:02,939 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:46:02,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 18:46:02,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-19 18:46:02,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-07-19 18:46:02,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 124 states have internal predecessors, (166), 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-07-19 18:46:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 240 transitions. [2022-07-19 18:46:02,950 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 240 transitions. Word has length 46 [2022-07-19 18:46:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:46:02,951 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 240 transitions. [2022-07-19 18:46:02,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) 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-07-19 18:46:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 240 transitions. [2022-07-19 18:46:02,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-19 18:46:02,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:46:02,954 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:46:02,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-19 18:46:03,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:46:03,169 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:46:03,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:46:03,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1136086573, now seen corresponding path program 1 times [2022-07-19 18:46:03,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:46:03,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491165506] [2022-07-19 18:46:03,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:46:03,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:46:03,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:46:03,172 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:46:03,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-19 18:46:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:03,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 18:46:03,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:46:03,728 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 18:46:03,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:46:03,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-07-19 18:46:03,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:46:03,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491165506] [2022-07-19 18:46:03,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491165506] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:46:03,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 18:46:03,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-19 18:46:03,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344066434] [2022-07-19 18:46:03,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 18:46:03,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 18:46:03,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:46:03,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 18:46:03,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 18:46:03,842 INFO L87 Difference]: Start difference. First operand 168 states and 240 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 18:46:04,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:46:04,129 INFO L93 Difference]: Finished difference Result 344 states and 489 transitions. [2022-07-19 18:46:04,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 18:46:04,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2022-07-19 18:46:04,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:46:04,131 INFO L225 Difference]: With dead ends: 344 [2022-07-19 18:46:04,131 INFO L226 Difference]: Without dead ends: 191 [2022-07-19 18:46:04,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 18:46:04,133 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 14 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 18:46:04,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1132 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 18:46:04,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-19 18:46:04,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 180. [2022-07-19 18:46:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 136 states have (on average 1.3161764705882353) internal successors, (179), 136 states have internal predecessors, (179), 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-07-19 18:46:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 253 transitions. [2022-07-19 18:46:04,144 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 253 transitions. Word has length 64 [2022-07-19 18:46:04,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:46:04,144 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 253 transitions. [2022-07-19 18:46:04,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 18:46:04,144 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 253 transitions. [2022-07-19 18:46:04,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-19 18:46:04,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:46:04,146 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 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] [2022-07-19 18:46:04,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-19 18:46:04,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:46:04,360 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:46:04,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:46:04,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1095643411, now seen corresponding path program 2 times [2022-07-19 18:46:04,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:46:04,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989197244] [2022-07-19 18:46:04,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 18:46:04,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:46:04,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:46:04,362 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:46:04,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-19 18:46:04,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 18:46:04,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 18:46:04,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 18:46:04,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:46:05,065 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-19 18:46:05,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:46:05,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:46:05,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989197244] [2022-07-19 18:46:05,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989197244] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:46:05,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:46:05,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 18:46:05,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465413054] [2022-07-19 18:46:05,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:46:05,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 18:46:05,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:46:05,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 18:46:05,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 18:46:05,067 INFO L87 Difference]: Start difference. First operand 180 states and 253 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 18:46:06,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:46:06,196 INFO L93 Difference]: Finished difference Result 361 states and 535 transitions. [2022-07-19 18:46:06,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 18:46:06,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2022-07-19 18:46:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:46:06,201 INFO L225 Difference]: With dead ends: 361 [2022-07-19 18:46:06,201 INFO L226 Difference]: Without dead ends: 335 [2022-07-19 18:46:06,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 18:46:06,202 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 303 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-19 18:46:06,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 699 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-19 18:46:06,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-07-19 18:46:06,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 334. [2022-07-19 18:46:06,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 237 states have (on average 1.3670886075949367) internal successors, (324), 236 states have internal predecessors, (324), 81 states have call successors, (81), 12 states have call predecessors, (81), 15 states have return successors, (101), 85 states have call predecessors, (101), 81 states have call successors, (101) [2022-07-19 18:46:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 506 transitions. [2022-07-19 18:46:06,225 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 506 transitions. Word has length 76 [2022-07-19 18:46:06,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:46:06,226 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 506 transitions. [2022-07-19 18:46:06,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 18:46:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 506 transitions. [2022-07-19 18:46:06,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-19 18:46:06,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:46:06,229 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 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] [2022-07-19 18:46:06,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-19 18:46:06,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:46:06,446 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:46:06,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:46:06,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1669023574, now seen corresponding path program 1 times [2022-07-19 18:46:06,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:46:06,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400180050] [2022-07-19 18:46:06,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:46:06,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:46:06,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:46:06,448 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:46:06,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-19 18:46:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:07,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 18:46:07,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:46:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-19 18:46:07,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:46:07,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:46:07,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400180050] [2022-07-19 18:46:07,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400180050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:46:07,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:46:07,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 18:46:07,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385265359] [2022-07-19 18:46:07,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:46:07,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 18:46:07,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:46:07,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 18:46:07,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 18:46:07,349 INFO L87 Difference]: Start difference. First operand 334 states and 506 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-19 18:46:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:46:08,208 INFO L93 Difference]: Finished difference Result 809 states and 1302 transitions. [2022-07-19 18:46:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 18:46:08,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 121 [2022-07-19 18:46:08,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:46:08,213 INFO L225 Difference]: With dead ends: 809 [2022-07-19 18:46:08,213 INFO L226 Difference]: Without dead ends: 505 [2022-07-19 18:46:08,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-19 18:46:08,216 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 308 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 18:46:08,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 489 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 18:46:08,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-07-19 18:46:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 467. [2022-07-19 18:46:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 347 states have (on average 1.2564841498559078) internal successors, (436), 298 states have internal predecessors, (436), 95 states have call successors, (95), 14 states have call predecessors, (95), 24 states have return successors, (190), 154 states have call predecessors, (190), 95 states have call successors, (190) [2022-07-19 18:46:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 721 transitions. [2022-07-19 18:46:08,267 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 721 transitions. Word has length 121 [2022-07-19 18:46:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:46:08,269 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 721 transitions. [2022-07-19 18:46:08,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-19 18:46:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 721 transitions. [2022-07-19 18:46:08,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-19 18:46:08,283 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:46:08,283 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 3, 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] [2022-07-19 18:46:08,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-19 18:46:08,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:46:08,492 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:46:08,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:46:08,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1837039795, now seen corresponding path program 1 times [2022-07-19 18:46:08,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:46:08,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024194097] [2022-07-19 18:46:08,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:46:08,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:46:08,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:46:08,494 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:46:08,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-19 18:46:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:09,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 18:46:09,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:46:09,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2022-07-19 18:46:09,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-19 18:46:10,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-07-19 18:46:10,074 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-19 18:46:10,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:46:10,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 8 [2022-07-19 18:46:10,390 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-19 18:46:10,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:46:10,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024194097] [2022-07-19 18:46:10,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024194097] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:46:10,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 18:46:10,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-07-19 18:46:10,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019844644] [2022-07-19 18:46:10,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 18:46:10,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 18:46:10,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:46:10,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 18:46:10,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 18:46:10,392 INFO L87 Difference]: Start difference. First operand 467 states and 721 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 18:46:12,413 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:46:14,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:46:14,043 INFO L93 Difference]: Finished difference Result 1084 states and 1758 transitions. [2022-07-19 18:46:14,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 18:46:14,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 122 [2022-07-19 18:46:14,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:46:14,054 INFO L225 Difference]: With dead ends: 1084 [2022-07-19 18:46:14,054 INFO L226 Difference]: Without dead ends: 1056 [2022-07-19 18:46:14,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-19 18:46:14,057 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 711 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 389 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-19 18:46:14,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 633 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 317 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-07-19 18:46:14,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2022-07-19 18:46:14,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1004. [2022-07-19 18:46:14,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 719 states have (on average 1.262865090403338) internal successors, (908), 616 states have internal predecessors, (908), 224 states have call successors, (224), 28 states have call predecessors, (224), 60 states have return successors, (520), 359 states have call predecessors, (520), 224 states have call successors, (520) [2022-07-19 18:46:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1652 transitions. [2022-07-19 18:46:14,128 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1652 transitions. Word has length 122 [2022-07-19 18:46:14,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:46:14,129 INFO L495 AbstractCegarLoop]: Abstraction has 1004 states and 1652 transitions. [2022-07-19 18:46:14,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 18:46:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1652 transitions. [2022-07-19 18:46:14,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-19 18:46:14,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:46:14,134 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 3, 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] [2022-07-19 18:46:14,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-19 18:46:14,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:46:14,347 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:46:14,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:46:14,348 INFO L85 PathProgramCache]: Analyzing trace with hash -2094798163, now seen corresponding path program 1 times [2022-07-19 18:46:14,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:46:14,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884413288] [2022-07-19 18:46:14,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:46:14,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:46:14,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:46:14,356 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:46:14,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-19 18:46:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:15,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 18:46:15,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:46:15,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2022-07-19 18:46:15,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-19 18:46:15,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-07-19 18:46:15,998 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-19 18:46:15,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:46:16,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 8 [2022-07-19 18:46:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-19 18:46:16,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:46:16,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884413288] [2022-07-19 18:46:16,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884413288] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:46:16,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 18:46:16,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-07-19 18:46:16,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627140581] [2022-07-19 18:46:16,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 18:46:16,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 18:46:16,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:46:16,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 18:46:16,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 18:46:16,410 INFO L87 Difference]: Start difference. First operand 1004 states and 1652 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 18:46:18,431 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:46:20,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:46:20,414 INFO L93 Difference]: Finished difference Result 1653 states and 2632 transitions. [2022-07-19 18:46:20,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 18:46:20,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 122 [2022-07-19 18:46:20,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:46:20,422 INFO L225 Difference]: With dead ends: 1653 [2022-07-19 18:46:20,422 INFO L226 Difference]: Without dead ends: 1056 [2022-07-19 18:46:20,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-19 18:46:20,426 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 395 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 186 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-19 18:46:20,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 750 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 430 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-07-19 18:46:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2022-07-19 18:46:20,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1010. [2022-07-19 18:46:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 723 states have (on average 1.2614107883817427) internal successors, (912), 622 states have internal predecessors, (912), 224 states have call successors, (224), 28 states have call predecessors, (224), 62 states have return successors, (518), 359 states have call predecessors, (518), 224 states have call successors, (518) [2022-07-19 18:46:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1654 transitions. [2022-07-19 18:46:20,496 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1654 transitions. Word has length 122 [2022-07-19 18:46:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:46:20,497 INFO L495 AbstractCegarLoop]: Abstraction has 1010 states and 1654 transitions. [2022-07-19 18:46:20,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 18:46:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1654 transitions. [2022-07-19 18:46:20,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-19 18:46:20,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:46:20,502 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 3, 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] [2022-07-19 18:46:20,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-19 18:46:20,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:46:20,715 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:46:20,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:46:20,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1285087731, now seen corresponding path program 1 times [2022-07-19 18:46:20,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:46:20,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162177641] [2022-07-19 18:46:20,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:46:20,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:46:20,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:46:20,718 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:46:20,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-19 18:46:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:21,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 18:46:21,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:46:21,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2022-07-19 18:46:22,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-19 18:46:22,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-07-19 18:46:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-19 18:46:22,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:46:22,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 8 [2022-07-19 18:46:22,880 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-19 18:46:22,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:46:22,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162177641] [2022-07-19 18:46:22,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162177641] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:46:22,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 18:46:22,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-07-19 18:46:22,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289569194] [2022-07-19 18:46:22,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 18:46:22,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 18:46:22,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:46:22,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 18:46:22,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 18:46:22,882 INFO L87 Difference]: Start difference. First operand 1010 states and 1654 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 18:46:24,907 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:46:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:46:27,507 INFO L93 Difference]: Finished difference Result 1994 states and 3215 transitions. [2022-07-19 18:46:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 18:46:27,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 122 [2022-07-19 18:46:27,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:46:27,515 INFO L225 Difference]: With dead ends: 1994 [2022-07-19 18:46:27,515 INFO L226 Difference]: Without dead ends: 1026 [2022-07-19 18:46:27,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-19 18:46:27,522 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 453 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 249 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-19 18:46:27,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 887 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 445 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-07-19 18:46:27,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2022-07-19 18:46:27,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 980. [2022-07-19 18:46:27,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 703 states have (on average 1.2588904694167853) internal successors, (885), 605 states have internal predecessors, (885), 216 states have call successors, (216), 28 states have call predecessors, (216), 60 states have return successors, (495), 346 states have call predecessors, (495), 216 states have call successors, (495) [2022-07-19 18:46:27,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1596 transitions. [2022-07-19 18:46:27,583 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1596 transitions. Word has length 122 [2022-07-19 18:46:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:46:27,583 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1596 transitions. [2022-07-19 18:46:27,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 18:46:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1596 transitions. [2022-07-19 18:46:27,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-19 18:46:27,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:46:27,588 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, 1] [2022-07-19 18:46:27,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-19 18:46:27,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:46:27,807 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:46:27,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:46:27,808 INFO L85 PathProgramCache]: Analyzing trace with hash -892722353, now seen corresponding path program 1 times [2022-07-19 18:46:27,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:46:27,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377037108] [2022-07-19 18:46:27,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:46:27,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:46:27,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:46:27,810 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:46:27,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-19 18:46:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:28,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 18:46:28,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:46:28,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 18:46:28,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 18:46:28,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-19 18:46:28,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-19 18:46:28,829 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-19 18:46:28,829 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:46:28,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:46:28,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377037108] [2022-07-19 18:46:28,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377037108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:46:28,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:46:28,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 18:46:28,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887716280] [2022-07-19 18:46:28,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:46:28,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 18:46:28,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:46:28,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 18:46:28,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 18:46:28,831 INFO L87 Difference]: Start difference. First operand 980 states and 1596 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 18:46:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:46:29,618 INFO L93 Difference]: Finished difference Result 1980 states and 3213 transitions. [2022-07-19 18:46:29,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 18:46:29,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (5), 1 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 104 [2022-07-19 18:46:29,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:46:29,627 INFO L225 Difference]: With dead ends: 1980 [2022-07-19 18:46:29,627 INFO L226 Difference]: Without dead ends: 1001 [2022-07-19 18:46:29,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 18:46:29,634 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 269 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 18:46:29,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 721 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 18:46:29,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2022-07-19 18:46:29,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 949. [2022-07-19 18:46:29,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 681 states have (on average 1.2555066079295154) internal successors, (855), 590 states have internal predecessors, (855), 207 states have call successors, (207), 28 states have call predecessors, (207), 60 states have return successors, (490), 330 states have call predecessors, (490), 207 states have call successors, (490) [2022-07-19 18:46:29,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1552 transitions. [2022-07-19 18:46:29,691 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1552 transitions. Word has length 104 [2022-07-19 18:46:29,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:46:29,692 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1552 transitions. [2022-07-19 18:46:29,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 18:46:29,692 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1552 transitions. [2022-07-19 18:46:29,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-19 18:46:29,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:46:29,696 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-07-19 18:46:29,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-19 18:46:29,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:46:29,915 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:46:29,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:46:29,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1964731096, now seen corresponding path program 1 times [2022-07-19 18:46:29,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:46:29,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933826471] [2022-07-19 18:46:29,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:46:29,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:46:29,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:46:29,919 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:46:29,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-19 18:46:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:31,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 18:46:31,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:46:31,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2022-07-19 18:46:31,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-19 18:46:31,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-07-19 18:46:31,651 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-19 18:46:31,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:46:31,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 8 [2022-07-19 18:46:32,232 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-19 18:46:32,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:46:32,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933826471] [2022-07-19 18:46:32,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933826471] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:46:32,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 18:46:32,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-07-19 18:46:32,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945387791] [2022-07-19 18:46:32,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 18:46:32,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 18:46:32,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:46:32,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 18:46:32,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 18:46:32,234 INFO L87 Difference]: Start difference. First operand 949 states and 1552 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-07-19 18:46:34,254 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:46:35,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:46:35,869 INFO L93 Difference]: Finished difference Result 1041 states and 1676 transitions. [2022-07-19 18:46:35,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 18:46:35,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 136 [2022-07-19 18:46:35,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:46:35,884 INFO L225 Difference]: With dead ends: 1041 [2022-07-19 18:46:35,885 INFO L226 Difference]: Without dead ends: 1013 [2022-07-19 18:46:35,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-19 18:46:35,887 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 458 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 277 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-19 18:46:35,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 724 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 369 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-07-19 18:46:35,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2022-07-19 18:46:35,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 961. [2022-07-19 18:46:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 689 states have (on average 1.2525399129172714) internal successors, (863), 602 states have internal predecessors, (863), 207 states have call successors, (207), 28 states have call predecessors, (207), 64 states have return successors, (492), 330 states have call predecessors, (492), 207 states have call successors, (492) [2022-07-19 18:46:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1562 transitions. [2022-07-19 18:46:35,949 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1562 transitions. Word has length 136 [2022-07-19 18:46:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:46:35,951 INFO L495 AbstractCegarLoop]: Abstraction has 961 states and 1562 transitions. [2022-07-19 18:46:35,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-07-19 18:46:35,952 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1562 transitions. [2022-07-19 18:46:35,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-19 18:46:35,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:46:35,956 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-07-19 18:46:35,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-19 18:46:36,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:46:36,171 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:46:36,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:46:36,172 INFO L85 PathProgramCache]: Analyzing trace with hash -462837888, now seen corresponding path program 1 times [2022-07-19 18:46:36,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:46:36,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320828721] [2022-07-19 18:46:36,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:46:36,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:46:36,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:46:36,173 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:46:36,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-19 18:46:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:38,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 119 conjunts are in the unsatisfiable core [2022-07-19 18:46:38,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:46:39,225 INFO L356 Elim1Store]: treesize reduction 96, result has 43.2 percent of original size [2022-07-19 18:46:39,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 15 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 76 treesize of output 130 [2022-07-19 18:46:54,147 WARN L233 SmtUtils]: Spent 12.44s on a formula simplification. DAG size of input: 79 DAG size of output: 43 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-19 18:46:54,148 INFO L356 Elim1Store]: treesize reduction 364, result has 23.0 percent of original size [2022-07-19 18:46:54,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 392 treesize of output 469 [2022-07-19 18:46:54,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:54,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:54,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:54,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:54,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:54,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:54,368 INFO L244 Elim1Store]: Index analysis took 120 ms [2022-07-19 18:46:54,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:46:54,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320828721] [2022-07-19 18:46:54,401 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-19 18:46:54,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-07-19 18:46:54,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:46:54,602 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @2a551a63) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.constructNestedStoreUpdateConstraintForOnePosition(ArrayIndexEqualityManager.java:415) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.constructNestedStoreUpdateConstraint(ArrayIndexEqualityManager.java:449) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.constructWriteConstraints2(Elim1Store.java:995) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:314) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyEliminationToAtom(QuantifierPusher.java:299) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-19 18:46:54,604 INFO L158 Benchmark]: Toolchain (without parser) took 59911.70ms. Allocated memory was 54.5MB in the beginning and 104.9MB in the end (delta: 50.3MB). Free memory was 32.0MB in the beginning and 29.0MB in the end (delta: 3.0MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2022-07-19 18:46:54,605 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 54.5MB. Free memory was 36.6MB in the beginning and 36.6MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 18:46:54,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 624.28ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 31.7MB in the beginning and 36.8MB in the end (delta: -5.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 18:46:54,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.23ms. Allocated memory is still 69.2MB. Free memory was 36.8MB in the beginning and 47.7MB in the end (delta: -10.9MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2022-07-19 18:46:54,605 INFO L158 Benchmark]: Boogie Preprocessor took 99.80ms. Allocated memory is still 69.2MB. Free memory was 47.7MB in the beginning and 43.7MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 18:46:54,606 INFO L158 Benchmark]: RCFGBuilder took 3299.79ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 43.7MB in the beginning and 50.3MB in the end (delta: -6.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-19 18:46:54,606 INFO L158 Benchmark]: TraceAbstraction took 55770.60ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 49.8MB in the beginning and 29.0MB in the end (delta: 20.8MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2022-07-19 18:46:54,608 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.58ms. Allocated memory is still 54.5MB. Free memory was 36.6MB in the beginning and 36.6MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 624.28ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 31.7MB in the beginning and 36.8MB in the end (delta: -5.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 110.23ms. Allocated memory is still 69.2MB. Free memory was 36.8MB in the beginning and 47.7MB in the end (delta: -10.9MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.80ms. Allocated memory is still 69.2MB. Free memory was 47.7MB in the beginning and 43.7MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 3299.79ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 43.7MB in the beginning and 50.3MB in the end (delta: -6.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 55770.60ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 49.8MB in the beginning and 29.0MB in the end (delta: 20.8MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @2a551a63) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @2a551a63): de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:103) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-19 18:46:54,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @2a551a63)