./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/brs3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/array-fpi/brs3.c -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 c10f08fb4b6a5b6f03e91e10a510f262e1b7fa98e124f4a160c252b3d63b04c2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 10:59:22,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 10:59:22,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 10:59:22,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 10:59:22,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 10:59:22,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 10:59:22,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 10:59:22,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 10:59:22,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 10:59:22,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 10:59:22,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 10:59:22,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 10:59:22,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 10:59:22,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 10:59:22,534 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 10:59:22,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 10:59:22,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 10:59:22,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 10:59:22,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 10:59:22,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 10:59:22,547 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 10:59:22,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 10:59:22,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 10:59:22,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 10:59:22,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 10:59:22,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 10:59:22,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 10:59:22,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 10:59:22,558 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 10:59:22,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 10:59:22,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 10:59:22,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 10:59:22,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 10:59:22,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 10:59:22,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 10:59:22,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 10:59:22,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 10:59:22,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 10:59:22,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 10:59:22,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 10:59:22,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 10:59:22,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 10:59:22,568 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 10:59:22,599 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 10:59:22,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 10:59:22,603 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 10:59:22,603 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 10:59:22,604 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 10:59:22,604 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 10:59:22,605 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 10:59:22,605 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 10:59:22,605 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 10:59:22,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 10:59:22,606 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 10:59:22,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 10:59:22,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 10:59:22,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 10:59:22,607 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 10:59:22,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 10:59:22,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 10:59:22,607 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 10:59:22,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 10:59:22,608 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 10:59:22,608 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 10:59:22,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 10:59:22,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 10:59:22,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 10:59:22,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 10:59:22,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 10:59:22,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 10:59:22,610 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 10:59:22,610 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 10:59:22,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 10:59:22,610 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 10:59:22,610 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 10:59:22,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 10:59:22,611 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 -> c10f08fb4b6a5b6f03e91e10a510f262e1b7fa98e124f4a160c252b3d63b04c2 [2022-07-13 10:59:22,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 10:59:22,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 10:59:22,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 10:59:22,883 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 10:59:22,884 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 10:59:22,886 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/brs3.c [2022-07-13 10:59:22,942 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30a0424d/38da5ae8b33c44859604847b30ebc14c/FLAG36ab58320 [2022-07-13 10:59:23,275 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 10:59:23,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs3.c [2022-07-13 10:59:23,281 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30a0424d/38da5ae8b33c44859604847b30ebc14c/FLAG36ab58320 [2022-07-13 10:59:23,307 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30a0424d/38da5ae8b33c44859604847b30ebc14c [2022-07-13 10:59:23,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 10:59:23,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 10:59:23,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 10:59:23,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 10:59:23,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 10:59:23,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:59:23" (1/1) ... [2022-07-13 10:59:23,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c3fc08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:23, skipping insertion in model container [2022-07-13 10:59:23,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:59:23" (1/1) ... [2022-07-13 10:59:23,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 10:59:23,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 10:59:23,485 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/array-fpi/brs3.c[587,600] [2022-07-13 10:59:23,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 10:59:23,507 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 10:59:23,518 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/array-fpi/brs3.c[587,600] [2022-07-13 10:59:23,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 10:59:23,543 INFO L208 MainTranslator]: Completed translation [2022-07-13 10:59:23,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:23 WrapperNode [2022-07-13 10:59:23,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 10:59:23,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 10:59:23,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 10:59:23,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 10:59:23,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:23" (1/1) ... [2022-07-13 10:59:23,567 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:23" (1/1) ... [2022-07-13 10:59:23,587 INFO L137 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2022-07-13 10:59:23,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 10:59:23,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 10:59:23,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 10:59:23,589 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 10:59:23,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:23" (1/1) ... [2022-07-13 10:59:23,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:23" (1/1) ... [2022-07-13 10:59:23,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:23" (1/1) ... [2022-07-13 10:59:23,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:23" (1/1) ... [2022-07-13 10:59:23,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:23" (1/1) ... [2022-07-13 10:59:23,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:23" (1/1) ... [2022-07-13 10:59:23,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:23" (1/1) ... [2022-07-13 10:59:23,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 10:59:23,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 10:59:23,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 10:59:23,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 10:59:23,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:23" (1/1) ... [2022-07-13 10:59:23,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 10:59:23,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:59:23,638 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-13 10:59:23,640 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-13 10:59:23,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 10:59:23,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 10:59:23,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 10:59:23,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 10:59:23,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 10:59:23,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 10:59:23,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 10:59:23,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 10:59:23,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 10:59:23,740 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 10:59:23,743 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 10:59:23,922 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 10:59:23,926 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 10:59:23,927 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 10:59:23,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:59:23 BoogieIcfgContainer [2022-07-13 10:59:23,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 10:59:23,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 10:59:23,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 10:59:23,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 10:59:23,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:59:23" (1/3) ... [2022-07-13 10:59:23,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27287bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:59:23, skipping insertion in model container [2022-07-13 10:59:23,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:23" (2/3) ... [2022-07-13 10:59:23,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27287bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:59:23, skipping insertion in model container [2022-07-13 10:59:23,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:59:23" (3/3) ... [2022-07-13 10:59:23,950 INFO L111 eAbstractionObserver]: Analyzing ICFG brs3.c [2022-07-13 10:59:23,962 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 10:59:23,962 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 10:59:24,039 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 10:59:24,048 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@1f492a23, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3de5f343 [2022-07-13 10:59:24,049 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 10:59:24,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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-13 10:59:24,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 10:59:24,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:59:24,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:59:24,071 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:59:24,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:59:24,079 INFO L85 PathProgramCache]: Analyzing trace with hash 361760665, now seen corresponding path program 1 times [2022-07-13 10:59:24,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:59:24,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829249189] [2022-07-13 10:59:24,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:59:24,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:59:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:59:24,258 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-13 10:59:24,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:59:24,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829249189] [2022-07-13 10:59:24,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829249189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:59:24,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:59:24,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 10:59:24,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913836111] [2022-07-13 10:59:24,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:59:24,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 10:59:24,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:59:24,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 10:59:24,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 10:59:24,308 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-13 10:59:24,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:59:24,324 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-07-13 10:59:24,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 10:59:24,329 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2022-07-13 10:59:24,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:59:24,335 INFO L225 Difference]: With dead ends: 36 [2022-07-13 10:59:24,336 INFO L226 Difference]: Without dead ends: 16 [2022-07-13 10:59:24,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-13 10:59:24,342 INFO L413 NwaCegarLoop]: 24 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, 24 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-13 10:59:24,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:59:24,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-07-13 10:59:24,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-13 10:59:24,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-13 10:59:24,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-07-13 10:59:24,380 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2022-07-13 10:59:24,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:59:24,381 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-07-13 10:59:24,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-13 10:59:24,382 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-07-13 10:59:24,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 10:59:24,383 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:59:24,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:59:24,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 10:59:24,384 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:59:24,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:59:24,385 INFO L85 PathProgramCache]: Analyzing trace with hash -447913662, now seen corresponding path program 1 times [2022-07-13 10:59:24,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:59:24,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908709088] [2022-07-13 10:59:24,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:59:24,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:59:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:59:24,490 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-13 10:59:24,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:59:24,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908709088] [2022-07-13 10:59:24,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908709088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:59:24,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:59:24,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 10:59:24,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560124170] [2022-07-13 10:59:24,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:59:24,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 10:59:24,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:59:24,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 10:59:24,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 10:59:24,494 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-13 10:59:24,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:59:24,548 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-07-13 10:59:24,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 10:59:24,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-07-13 10:59:24,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:59:24,550 INFO L225 Difference]: With dead ends: 33 [2022-07-13 10:59:24,550 INFO L226 Difference]: Without dead ends: 22 [2022-07-13 10:59:24,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 10:59:24,551 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:59:24,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 12 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:59:24,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-13 10:59:24,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-07-13 10:59:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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-13 10:59:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-13 10:59:24,557 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 11 [2022-07-13 10:59:24,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:59:24,557 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-13 10:59:24,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-13 10:59:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-13 10:59:24,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 10:59:24,559 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:59:24,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:59:24,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 10:59:24,559 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:59:24,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:59:24,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1044113915, now seen corresponding path program 1 times [2022-07-13 10:59:24,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:59:24,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344858549] [2022-07-13 10:59:24,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:59:24,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:59:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:59:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 10:59:24,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:59:24,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344858549] [2022-07-13 10:59:24,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344858549] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:59:24,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:59:24,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 10:59:24,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475461566] [2022-07-13 10:59:24,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:59:24,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 10:59:24,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:59:24,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 10:59:24,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 10:59:24,643 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-13 10:59:24,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:59:24,694 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-07-13 10:59:24,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 10:59:24,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-07-13 10:59:24,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:59:24,695 INFO L225 Difference]: With dead ends: 27 [2022-07-13 10:59:24,696 INFO L226 Difference]: Without dead ends: 23 [2022-07-13 10:59:24,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 10:59:24,697 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:59:24,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 29 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:59:24,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-13 10:59:24,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-07-13 10:59:24,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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-13 10:59:24,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-07-13 10:59:24,703 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2022-07-13 10:59:24,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:59:24,703 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-07-13 10:59:24,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-13 10:59:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-07-13 10:59:24,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 10:59:24,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:59:24,705 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:59:24,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 10:59:24,705 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:59:24,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:59:24,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1654199858, now seen corresponding path program 1 times [2022-07-13 10:59:24,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:59:24,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695818258] [2022-07-13 10:59:24,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:59:24,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:59:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:59:24,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:59:24,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:59:24,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695818258] [2022-07-13 10:59:24,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695818258] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:59:24,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706782551] [2022-07-13 10:59:24,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:59:24,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:59:24,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:59:24,819 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-13 10:59:24,832 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-13 10:59:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:59:24,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 10:59:24,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:59:24,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:59:24,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:59:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:59:25,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706782551] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:59:25,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:59:25,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-13 10:59:25,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453649790] [2022-07-13 10:59:25,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:59:25,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 10:59:25,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:59:25,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 10:59:25,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 10:59:25,017 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 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-13 10:59:25,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:59:25,178 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-07-13 10:59:25,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 10:59:25,178 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 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 20 [2022-07-13 10:59:25,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:59:25,179 INFO L225 Difference]: With dead ends: 43 [2022-07-13 10:59:25,179 INFO L226 Difference]: Without dead ends: 29 [2022-07-13 10:59:25,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-13 10:59:25,189 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:59:25,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 32 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 10:59:25,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-13 10:59:25,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-07-13 10:59:25,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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-13 10:59:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-07-13 10:59:25,194 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 20 [2022-07-13 10:59:25,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:59:25,195 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-13 10:59:25,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 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-13 10:59:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-07-13 10:59:25,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 10:59:25,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:59:25,197 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:59:25,227 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-13 10:59:25,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:59:25,420 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:59:25,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:59:25,420 INFO L85 PathProgramCache]: Analyzing trace with hash 168847774, now seen corresponding path program 1 times [2022-07-13 10:59:25,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:59:25,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601577555] [2022-07-13 10:59:25,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:59:25,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:59:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:59:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:59:25,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:59:25,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601577555] [2022-07-13 10:59:25,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601577555] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:59:25,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887660313] [2022-07-13 10:59:25,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:59:25,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:59:25,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:59:25,868 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-13 10:59:25,878 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-13 10:59:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:59:25,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-13 10:59:25,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:59:25,971 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 10 treesize of output 8 [2022-07-13 10:59:26,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-07-13 10:59:26,160 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 29 treesize of output 28 [2022-07-13 10:59:26,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-07-13 10:59:26,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-07-13 10:59:26,423 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:59:26,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:59:27,388 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 0)) (<= (+ v_ArrVal_73 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_73)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (* c_~N~0 3)))) is different from false [2022-07-13 10:59:30,177 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 222 treesize of output 210 [2022-07-13 10:59:30,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-13 10:59:30,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887660313] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:59:30,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:59:30,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 27 [2022-07-13 10:59:30,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330973607] [2022-07-13 10:59:30,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:59:30,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 10:59:30,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:59:30,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 10:59:30,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=533, Unknown=2, NotChecked=48, Total=702 [2022-07-13 10:59:30,405 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 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-13 10:59:30,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:59:30,653 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-07-13 10:59:30,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 10:59:30,653 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 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 23 [2022-07-13 10:59:30,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:59:30,655 INFO L225 Difference]: With dead ends: 57 [2022-07-13 10:59:30,655 INFO L226 Difference]: Without dead ends: 37 [2022-07-13 10:59:30,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=172, Invalid=700, Unknown=2, NotChecked=56, Total=930 [2022-07-13 10:59:30,656 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:59:30,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 55 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 161 Invalid, 0 Unknown, 71 Unchecked, 0.1s Time] [2022-07-13 10:59:30,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-13 10:59:30,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-07-13 10:59:30,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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-13 10:59:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-07-13 10:59:30,668 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 23 [2022-07-13 10:59:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:59:30,669 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-07-13 10:59:30,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 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-13 10:59:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-07-13 10:59:30,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 10:59:30,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:59:30,670 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:59:30,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 10:59:30,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:59:30,871 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:59:30,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:59:30,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1961352373, now seen corresponding path program 2 times [2022-07-13 10:59:30,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:59:30,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696494073] [2022-07-13 10:59:30,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:59:30,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:59:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:59:30,980 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:59:30,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:59:30,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696494073] [2022-07-13 10:59:30,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696494073] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:59:30,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025596683] [2022-07-13 10:59:30,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 10:59:30,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:59:30,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:59:30,984 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-13 10:59:31,007 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-13 10:59:31,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 10:59:31,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:59:31,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 10:59:31,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:59:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:59:31,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:59:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:59:31,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025596683] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:59:31,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:59:31,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 10:59:31,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11354847] [2022-07-13 10:59:31,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:59:31,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 10:59:31,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:59:31,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 10:59:31,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-13 10:59:31,155 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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-13 10:59:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:59:31,325 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2022-07-13 10:59:31,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 10:59:31,326 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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 26 [2022-07-13 10:59:31,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:59:31,326 INFO L225 Difference]: With dead ends: 77 [2022-07-13 10:59:31,326 INFO L226 Difference]: Without dead ends: 55 [2022-07-13 10:59:31,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2022-07-13 10:59:31,327 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 52 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:59:31,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 48 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 10:59:31,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-13 10:59:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2022-07-13 10:59:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.175) internal successors, (47), 40 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-13 10:59:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-07-13 10:59:31,334 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 26 [2022-07-13 10:59:31,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:59:31,334 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-07-13 10:59:31,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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-13 10:59:31,334 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-07-13 10:59:31,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 10:59:31,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:59:31,335 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:59:31,362 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-13 10:59:31,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:59:31,552 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:59:31,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:59:31,552 INFO L85 PathProgramCache]: Analyzing trace with hash 719394766, now seen corresponding path program 3 times [2022-07-13 10:59:31,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:59:31,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111594754] [2022-07-13 10:59:31,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:59:31,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:59:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:59:31,650 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:59:31,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:59:31,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111594754] [2022-07-13 10:59:31,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111594754] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:59:31,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375833889] [2022-07-13 10:59:31,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 10:59:31,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:59:31,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:59:31,653 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-13 10:59:31,654 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-13 10:59:31,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 10:59:31,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:59:31,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-13 10:59:31,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:59:31,750 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 10 treesize of output 8 [2022-07-13 10:59:31,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 10:59:31,979 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 23 treesize of output 22 [2022-07-13 10:59:32,127 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 10:59:32,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2022-07-13 10:59:32,267 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 10:59:32,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2022-07-13 10:59:32,300 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 10:59:32,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:59:34,791 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 100 treesize of output 94 [2022-07-13 10:59:34,862 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 10:59:34,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375833889] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:59:34,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:59:34,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 14] total 34 [2022-07-13 10:59:34,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085687367] [2022-07-13 10:59:34,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:59:34,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-13 10:59:34,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:59:34,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-13 10:59:34,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2022-07-13 10:59:34,865 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 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-13 10:59:35,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:59:35,573 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-07-13 10:59:35,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-13 10:59:35,574 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 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 26 [2022-07-13 10:59:35,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:59:35,574 INFO L225 Difference]: With dead ends: 69 [2022-07-13 10:59:35,574 INFO L226 Difference]: Without dead ends: 55 [2022-07-13 10:59:35,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=530, Invalid=2332, Unknown=0, NotChecked=0, Total=2862 [2022-07-13 10:59:35,576 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 28 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:59:35,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 46 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 140 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2022-07-13 10:59:35,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-13 10:59:35,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2022-07-13 10:59:35,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 states have internal predecessors, (50), 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-13 10:59:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-07-13 10:59:35,586 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 26 [2022-07-13 10:59:35,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:59:35,586 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-07-13 10:59:35,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 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-13 10:59:35,586 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-07-13 10:59:35,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 10:59:35,587 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:59:35,587 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:59:35,592 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-13 10:59:35,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:59:35,792 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:59:35,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:59:35,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1198950171, now seen corresponding path program 4 times [2022-07-13 10:59:35,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:59:35,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215125626] [2022-07-13 10:59:35,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:59:35,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:59:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:59:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:59:36,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:59:36,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215125626] [2022-07-13 10:59:36,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215125626] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:59:36,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399738919] [2022-07-13 10:59:36,460 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 10:59:36,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:59:36,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:59:36,464 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-13 10:59:36,465 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-13 10:59:36,508 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 10:59:36,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:59:36,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-13 10:59:36,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:59:36,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 10:59:36,650 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 10:59:36,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 22 [2022-07-13 10:59:36,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:36,740 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 10:59:36,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-13 10:59:36,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:36,854 INFO L356 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-07-13 10:59:36,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 51 [2022-07-13 10:59:36,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:36,981 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 10:59:36,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 40 [2022-07-13 10:59:37,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:59:37,132 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 10:59:37,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 15 [2022-07-13 10:59:37,163 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:59:37,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:00:01,884 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 11:00:01,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2056 treesize of output 2002 [2022-07-13 11:00:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:00:02,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399738919] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:00:02,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:00:02,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 15] total 44 [2022-07-13 11:00:02,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713773477] [2022-07-13 11:00:02,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:00:02,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-13 11:00:02,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:00:02,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-13 11:00:02,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1655, Unknown=10, NotChecked=0, Total=1892 [2022-07-13 11:00:02,232 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 44 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 44 states have internal predecessors, (78), 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-13 11:00:03,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:00:03,760 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2022-07-13 11:00:03,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-13 11:00:03,761 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 44 states have internal predecessors, (78), 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 29 [2022-07-13 11:00:03,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:00:03,762 INFO L225 Difference]: With dead ends: 88 [2022-07-13 11:00:03,762 INFO L226 Difference]: Without dead ends: 54 [2022-07-13 11:00:03,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=528, Invalid=3368, Unknown=10, NotChecked=0, Total=3906 [2022-07-13 11:00:03,764 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 50 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:00:03,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 102 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 471 Invalid, 0 Unknown, 223 Unchecked, 0.3s Time] [2022-07-13 11:00:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-13 11:00:03,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 37. [2022-07-13 11:00:03,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 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-13 11:00:03,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-07-13 11:00:03,775 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 29 [2022-07-13 11:00:03,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:00:03,775 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-07-13 11:00:03,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 44 states have internal predecessors, (78), 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-13 11:00:03,776 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-07-13 11:00:03,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 11:00:03,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:00:03,778 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:00:03,798 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-13 11:00:03,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:00:03,992 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:00:03,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:00:03,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1722173266, now seen corresponding path program 5 times [2022-07-13 11:00:03,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:00:03,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188091141] [2022-07-13 11:00:03,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:00:03,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:00:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:00:04,083 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:00:04,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:00:04,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188091141] [2022-07-13 11:00:04,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188091141] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:00:04,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487518142] [2022-07-13 11:00:04,084 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:00:04,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:00:04,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:00:04,086 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-13 11:00:04,088 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-13 11:00:04,141 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-13 11:00:04,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:00:04,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:00:04,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:00:04,241 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:00:04,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:00:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:00:04,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487518142] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:00:04,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:00:04,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-13 11:00:04,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501658461] [2022-07-13 11:00:04,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:00:04,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:00:04,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:00:04,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:00:04,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:00:04,285 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 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-13 11:00:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:00:04,443 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-07-13 11:00:04,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:00:04,444 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 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 32 [2022-07-13 11:00:04,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:00:04,445 INFO L225 Difference]: With dead ends: 77 [2022-07-13 11:00:04,445 INFO L226 Difference]: Without dead ends: 56 [2022-07-13 11:00:04,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2022-07-13 11:00:04,446 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 50 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:00:04,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 48 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:00:04,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-13 11:00:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2022-07-13 11:00:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 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-13 11:00:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-07-13 11:00:04,452 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 32 [2022-07-13 11:00:04,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:00:04,452 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-07-13 11:00:04,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 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-13 11:00:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-07-13 11:00:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 11:00:04,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:00:04,454 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:00:04,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 11:00:04,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:00:04,664 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:00:04,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:00:04,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1273910208, now seen corresponding path program 6 times [2022-07-13 11:00:04,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:00:04,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243553607] [2022-07-13 11:00:04,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:00:04,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:00:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:00:05,476 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:00:05,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:00:05,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243553607] [2022-07-13 11:00:05,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243553607] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:00:05,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304976657] [2022-07-13 11:00:05,477 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 11:00:05,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:00:05,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:00:05,480 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-13 11:00:05,487 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-13 11:00:05,695 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-13 11:00:05,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:00:05,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-13 11:00:05,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:00:05,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 11:00:05,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:05,896 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 25 treesize of output 24 [2022-07-13 11:00:05,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:05,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:05,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:05,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 39 [2022-07-13 11:00:06,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:06,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:06,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:06,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:06,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-07-13 11:00:06,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:00:06,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:06,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:06,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:06,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:06,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 54 [2022-07-13 11:00:06,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:06,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:06,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:06,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:06,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:06,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:00:06,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2022-07-13 11:00:06,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:06,766 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 0 case distinctions, treesize of input 63 treesize of output 48 [2022-07-13 11:00:06,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:06,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 19 [2022-07-13 11:00:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:00:06,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:00:33,440 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-13 11:00:33,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7478 treesize of output 7382 [2022-07-13 11:00:36,818 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:00:36,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304976657] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:00:36,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:00:36,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 21] total 59 [2022-07-13 11:00:36,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662507179] [2022-07-13 11:00:36,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:00:36,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-13 11:00:36,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:00:36,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-13 11:00:36,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=486, Invalid=2925, Unknown=11, NotChecked=0, Total=3422 [2022-07-13 11:00:36,823 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 59 states, 59 states have (on average 1.6271186440677967) internal successors, (96), 59 states have internal predecessors, (96), 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-13 11:00:47,840 WARN L233 SmtUtils]: Spent 7.72s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 11:00:54,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:00:54,357 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2022-07-13 11:00:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-13 11:00:54,358 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.6271186440677967) internal successors, (96), 59 states have internal predecessors, (96), 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 35 [2022-07-13 11:00:54,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:00:54,359 INFO L225 Difference]: With dead ends: 119 [2022-07-13 11:00:54,359 INFO L226 Difference]: Without dead ends: 89 [2022-07-13 11:00:54,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2689 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=1090, Invalid=7086, Unknown=14, NotChecked=0, Total=8190 [2022-07-13 11:00:54,361 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 81 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 674 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:00:54,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 83 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 457 Invalid, 0 Unknown, 674 Unchecked, 0.3s Time] [2022-07-13 11:00:54,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-13 11:00:54,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2022-07-13 11:00:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 77 states have internal predecessors, (90), 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-13 11:00:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2022-07-13 11:00:54,375 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 35 [2022-07-13 11:00:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:00:54,375 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2022-07-13 11:00:54,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.6271186440677967) internal successors, (96), 59 states have internal predecessors, (96), 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-13 11:00:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2022-07-13 11:00:54,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-13 11:00:54,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:00:54,377 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:00:54,406 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-13 11:00:54,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:00:54,595 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:00:54,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:00:54,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1970704919, now seen corresponding path program 7 times [2022-07-13 11:00:54,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:00:54,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389109457] [2022-07-13 11:00:54,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:00:54,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:00:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:00:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:00:54,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:00:54,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389109457] [2022-07-13 11:00:54,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389109457] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:00:54,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325448338] [2022-07-13 11:00:54,696 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-13 11:00:54,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:00:54,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:00:54,700 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-13 11:00:54,704 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-13 11:00:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:00:54,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 11:00:54,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:00:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:00:54,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:00:54,913 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:00:54,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325448338] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:00:54,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:00:54,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-13 11:00:54,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330478207] [2022-07-13 11:00:54,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:00:54,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 11:00:54,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:00:54,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 11:00:54,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-13 11:00:54,916 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 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-13 11:00:55,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:00:55,105 INFO L93 Difference]: Finished difference Result 155 states and 177 transitions. [2022-07-13 11:00:55,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 11:00:55,105 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 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-13 11:00:55,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:00:55,106 INFO L225 Difference]: With dead ends: 155 [2022-07-13 11:00:55,106 INFO L226 Difference]: Without dead ends: 108 [2022-07-13 11:00:55,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=517, Unknown=0, NotChecked=0, Total=702 [2022-07-13 11:00:55,108 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 90 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:00:55,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 55 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:00:55,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-13 11:00:55,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 79. [2022-07-13 11:00:55,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.141025641025641) internal successors, (89), 78 states have internal predecessors, (89), 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-13 11:00:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2022-07-13 11:00:55,120 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 38 [2022-07-13 11:00:55,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:00:55,121 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2022-07-13 11:00:55,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 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-13 11:00:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2022-07-13 11:00:55,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 11:00:55,122 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:00:55,122 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:00:55,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 11:00:55,329 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,SelfDestructingSolverStorable10 [2022-07-13 11:00:55,329 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:00:55,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:00:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2029817088, now seen corresponding path program 8 times [2022-07-13 11:00:55,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:00:55,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777365570] [2022-07-13 11:00:55,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:00:55,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:00:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:00:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 22 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:00:55,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:00:55,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777365570] [2022-07-13 11:00:55,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777365570] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:00:55,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051186030] [2022-07-13 11:00:55,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:00:55,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:00:55,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:00:55,452 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-13 11:00:55,456 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-13 11:00:55,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:00:55,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:00:55,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 11:00:55,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:00:55,626 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 22 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 11:00:55,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:00:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 22 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 11:00:55,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051186030] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:00:55,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:00:55,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 22 [2022-07-13 11:00:55,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745268826] [2022-07-13 11:00:55,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:00:55,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 11:00:55,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:00:55,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 11:00:55,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-07-13 11:00:55,704 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 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-13 11:00:56,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:00:56,132 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2022-07-13 11:00:56,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 11:00:56,132 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 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 41 [2022-07-13 11:00:56,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:00:56,133 INFO L225 Difference]: With dead ends: 115 [2022-07-13 11:00:56,133 INFO L226 Difference]: Without dead ends: 91 [2022-07-13 11:00:56,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=329, Invalid=1153, Unknown=0, NotChecked=0, Total=1482 [2022-07-13 11:00:56,134 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 69 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:00:56,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 60 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:00:56,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-13 11:00:56,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 54. [2022-07-13 11:00:56,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 states have internal predecessors, (59), 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-13 11:00:56,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-07-13 11:00:56,145 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 41 [2022-07-13 11:00:56,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:00:56,146 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-07-13 11:00:56,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 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-13 11:00:56,146 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-07-13 11:00:56,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 11:00:56,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:00:56,147 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:00:56,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-13 11:00:56,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:00:56,351 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:00:56,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:00:56,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1332664835, now seen corresponding path program 9 times [2022-07-13 11:00:56,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:00:56,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900597593] [2022-07-13 11:00:56,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:00:56,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:00:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:00:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:00:57,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:00:57,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900597593] [2022-07-13 11:00:57,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900597593] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:00:57,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701031863] [2022-07-13 11:00:57,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:00:57,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:00:57,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:00:57,429 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-13 11:00:57,430 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-13 11:00:57,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-13 11:00:57,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:00:57,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-13 11:00:57,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:00:57,533 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 10 treesize of output 8 [2022-07-13 11:00:57,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 11:00:57,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:57,673 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 27 treesize of output 26 [2022-07-13 11:00:57,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:57,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:57,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:57,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 41 [2022-07-13 11:00:57,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:57,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:57,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:57,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:57,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:57,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:57,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2022-07-13 11:00:58,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 66 [2022-07-13 11:00:58,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:00:58,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2022-07-13 11:00:58,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,604 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-07-13 11:00:58,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 85 [2022-07-13 11:00:58,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:58,842 INFO L356 Elim1Store]: treesize reduction 153, result has 0.6 percent of original size [2022-07-13 11:00:58,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 101 treesize of output 99 [2022-07-13 11:00:59,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,208 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-13 11:00:59,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 13 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 102 [2022-07-13 11:00:59,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:00:59,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:00:59,620 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:00:59,620 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:00:59,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 23 [2022-07-13 11:00:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:00:59,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:02:16,435 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_439 Int) (v_ArrVal_438 Int) (v_ArrVal_436 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_436)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse2 (* |v_ULTIMATE.start_main_~i~0#1_146| 4))) (or (not (<= v_ArrVal_439 (+ v_ArrVal_438 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_438)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_436 0)) (<= (+ v_ArrVal_443 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_443)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2))) (* 3 ~N~0)) (not (<= v_ArrVal_438 0)) (not (<= v_ArrVal_441 (+ v_ArrVal_439 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_439)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse2))))) (not (<= v_ArrVal_443 (+ v_ArrVal_441 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_441)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse2 4))))) (not (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_146|) ~N~0)) (< (+ 3 |v_ULTIMATE.start_main_~i~0#1_146|) ~N~0))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-13 11:02:18,511 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_439 Int) (v_ArrVal_438 Int) (v_ArrVal_436 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_436)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse2 (* |v_ULTIMATE.start_main_~i~0#1_146| 4))) (or (not (<= v_ArrVal_436 0)) (not (<= v_ArrVal_439 (+ v_ArrVal_438 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_438)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (<= v_ArrVal_443 (+ v_ArrVal_441 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_441)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse2 4))))) (not (<= v_ArrVal_438 0)) (<= (+ v_ArrVal_443 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_443)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2))) (* 3 ~N~0)) (not (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_146|) ~N~0)) (< (+ 3 |v_ULTIMATE.start_main_~i~0#1_146|) ~N~0) (not (<= v_ArrVal_441 (+ v_ArrVal_439 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_439)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse2))))))))) is different from false [2022-07-13 11:02:20,649 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_439 Int) (v_ArrVal_438 Int) (v_ArrVal_436 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_434) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_436))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse2 (* |v_ULTIMATE.start_main_~i~0#1_146| 4))) (or (not (<= v_ArrVal_436 0)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (<= v_ArrVal_441 (+ v_ArrVal_439 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_439)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse2))))) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (<= v_ArrVal_438 0)) (not (<= v_ArrVal_443 (+ v_ArrVal_441 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_441)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse2 4))))) (not (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_146|) ~N~0)) (< (+ 3 |v_ULTIMATE.start_main_~i~0#1_146|) ~N~0) (not (<= v_ArrVal_439 (+ v_ArrVal_438 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_438)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_434 3)) (<= (+ v_ArrVal_443 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_443)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2))) (* 3 ~N~0)))))) is different from false [2022-07-13 11:02:22,827 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_439 Int) (v_ArrVal_438 Int) (v_ArrVal_436 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_434) (+ .cse3 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_436))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse2 (* |v_ULTIMATE.start_main_~i~0#1_146| 4))) (or (not (<= v_ArrVal_439 (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_438)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_438))) (not (<= v_ArrVal_436 0)) (not (<= v_ArrVal_441 (+ v_ArrVal_439 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_439)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse2))))) (not (<= v_ArrVal_438 0)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_146|) ~N~0)) (< (+ 3 |v_ULTIMATE.start_main_~i~0#1_146|) ~N~0) (not (<= v_ArrVal_443 (+ v_ArrVal_441 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_441)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse2 4))))) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (<= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_443)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2)) v_ArrVal_443) (* 3 ~N~0)) (not (<= v_ArrVal_434 3)))))) is different from false [2022-07-13 11:02:37,305 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_152| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_152|)) (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_443 Int) (v_ArrVal_431 Int) (v_ArrVal_441 Int) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_439 Int) (v_ArrVal_438 Int) (v_ArrVal_436 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (* |v_ULTIMATE.start_main_~i~0#1_152| 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_434) (+ .cse3 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_436))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse2 (* |v_ULTIMATE.start_main_~i~0#1_146| 4))) (or (<= (+ v_ArrVal_443 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_443)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2))) (* 3 ~N~0)) (not (<= v_ArrVal_436 0)) (not (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_152|) ~N~0)) (not (<= v_ArrVal_438 0)) (not (<= v_ArrVal_439 (+ v_ArrVal_438 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_438)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_146|) ~N~0)) (< (+ 3 |v_ULTIMATE.start_main_~i~0#1_146|) ~N~0) (< (+ 3 |v_ULTIMATE.start_main_~i~0#1_152|) ~N~0) (not (<= v_ArrVal_443 (+ v_ArrVal_441 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_441)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse2 4))))) (not (<= v_ArrVal_431 0)) (not (<= v_ArrVal_441 (+ v_ArrVal_439 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_439)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse2))))) (not (<= v_ArrVal_434 3)))))))) is different from false [2022-07-13 11:02:37,424 INFO L356 Elim1Store]: treesize reduction 87, result has 10.3 percent of original size [2022-07-13 11:02:37,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 322154 treesize of output 319652 [2022-07-13 11:02:39,338 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 11:02:39,342 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-13 11:02:39,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 11:02:39,539 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:545) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:348) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) 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:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) 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.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) 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-13 11:02:39,543 INFO L158 Benchmark]: Toolchain (without parser) took 196232.70ms. Allocated memory was 104.9MB in the beginning and 281.0MB in the end (delta: 176.2MB). Free memory was 68.1MB in the beginning and 134.7MB in the end (delta: -66.7MB). Peak memory consumption was 164.9MB. Max. memory is 16.1GB. [2022-07-13 11:02:39,543 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 104.9MB. Free memory was 84.7MB in the beginning and 84.5MB in the end (delta: 136.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:02:39,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.78ms. Allocated memory is still 104.9MB. Free memory was 67.9MB in the beginning and 73.4MB in the end (delta: -5.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:02:39,544 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.54ms. Allocated memory is still 104.9MB. Free memory was 73.4MB in the beginning and 71.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:02:39,544 INFO L158 Benchmark]: Boogie Preprocessor took 24.70ms. Allocated memory is still 104.9MB. Free memory was 71.8MB in the beginning and 70.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:02:39,544 INFO L158 Benchmark]: RCFGBuilder took 314.91ms. Allocated memory is still 104.9MB. Free memory was 70.6MB in the beginning and 59.9MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 11:02:39,545 INFO L158 Benchmark]: TraceAbstraction took 195612.83ms. Allocated memory was 104.9MB in the beginning and 281.0MB in the end (delta: 176.2MB). Free memory was 59.5MB in the beginning and 134.7MB in the end (delta: -75.2MB). Peak memory consumption was 159.3MB. Max. memory is 16.1GB. [2022-07-13 11:02:39,546 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.27ms. Allocated memory is still 104.9MB. Free memory was 84.7MB in the beginning and 84.5MB in the end (delta: 136.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.78ms. Allocated memory is still 104.9MB. Free memory was 67.9MB in the beginning and 73.4MB in the end (delta: -5.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.54ms. Allocated memory is still 104.9MB. Free memory was 73.4MB in the beginning and 71.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.70ms. Allocated memory is still 104.9MB. Free memory was 71.8MB in the beginning and 70.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 314.91ms. Allocated memory is still 104.9MB. Free memory was 70.6MB in the beginning and 59.9MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 195612.83ms. Allocated memory was 104.9MB in the beginning and 281.0MB in the end (delta: 176.2MB). Free memory was 59.5MB in the beginning and 134.7MB in the end (delta: -75.2MB). Peak memory consumption was 159.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 11:02:39,685 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 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/array-fpi/brs3.c -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 c10f08fb4b6a5b6f03e91e10a510f262e1b7fa98e124f4a160c252b3d63b04c2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:02:41,416 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:02:41,418 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:02:41,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:02:41,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:02:41,460 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:02:41,463 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:02:41,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:02:41,468 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:02:41,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:02:41,472 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:02:41,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:02:41,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:02:41,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:02:41,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:02:41,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:02:41,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:02:41,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:02:41,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:02:41,491 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:02:41,492 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:02:41,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:02:41,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:02:41,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:02:41,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:02:41,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:02:41,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:02:41,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:02:41,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:02:41,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:02:41,505 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:02:41,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:02:41,507 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:02:41,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:02:41,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:02:41,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:02:41,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:02:41,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:02:41,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:02:41,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:02:41,512 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:02:41,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:02:41,518 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 11:02:41,549 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:02:41,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:02:41,550 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:02:41,550 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:02:41,551 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:02:41,551 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:02:41,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:02:41,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:02:41,552 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:02:41,553 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:02:41,553 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:02:41,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:02:41,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:02:41,553 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:02:41,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:02:41,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:02:41,558 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 11:02:41,559 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 11:02:41,559 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 11:02:41,559 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:02:41,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:02:41,560 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:02:41,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:02:41,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:02:41,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:02:41,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:02:41,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:02:41,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:02:41,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:02:41,561 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:02:41,562 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 11:02:41,562 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 11:02:41,562 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:02:41,562 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:02:41,562 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:02:41,563 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 11:02:41,563 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 -> c10f08fb4b6a5b6f03e91e10a510f262e1b7fa98e124f4a160c252b3d63b04c2 [2022-07-13 11:02:41,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:02:41,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:02:41,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:02:41,877 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:02:41,877 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:02:41,879 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/brs3.c [2022-07-13 11:02:41,934 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2495b8cc6/894fe4df561a45f1bd11cda7170c500b/FLAG118411b19 [2022-07-13 11:02:42,322 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:02:42,323 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs3.c [2022-07-13 11:02:42,328 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2495b8cc6/894fe4df561a45f1bd11cda7170c500b/FLAG118411b19 [2022-07-13 11:02:42,346 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2495b8cc6/894fe4df561a45f1bd11cda7170c500b [2022-07-13 11:02:42,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:02:42,349 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:02:42,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:02:42,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:02:42,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:02:42,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:02:42" (1/1) ... [2022-07-13 11:02:42,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c0bd318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:42, skipping insertion in model container [2022-07-13 11:02:42,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:02:42" (1/1) ... [2022-07-13 11:02:42,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:02:42,375 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:02:42,524 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/array-fpi/brs3.c[587,600] [2022-07-13 11:02:42,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:02:42,561 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:02:42,598 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/array-fpi/brs3.c[587,600] [2022-07-13 11:02:42,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:02:42,631 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:02:42,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:42 WrapperNode [2022-07-13 11:02:42,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:02:42,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:02:42,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:02:42,636 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:02:42,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:42" (1/1) ... [2022-07-13 11:02:42,658 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:42" (1/1) ... [2022-07-13 11:02:42,681 INFO L137 Inliner]: procedures = 21, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2022-07-13 11:02:42,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:02:42,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:02:42,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:02:42,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:02:42,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:42" (1/1) ... [2022-07-13 11:02:42,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:42" (1/1) ... [2022-07-13 11:02:42,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:42" (1/1) ... [2022-07-13 11:02:42,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:42" (1/1) ... [2022-07-13 11:02:42,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:42" (1/1) ... [2022-07-13 11:02:42,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:42" (1/1) ... [2022-07-13 11:02:42,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:42" (1/1) ... [2022-07-13 11:02:42,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:02:42,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:02:42,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:02:42,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:02:42,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:42" (1/1) ... [2022-07-13 11:02:42,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:02:42,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:02:42,769 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-13 11:02:42,784 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-13 11:02:42,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:02:42,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 11:02:42,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 11:02:42,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-13 11:02:42,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:02:42,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 11:02:42,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:02:42,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:02:42,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-13 11:02:42,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 11:02:42,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 11:02:42,862 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:02:42,864 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:02:43,059 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:02:43,063 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:02:43,063 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 11:02:43,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:02:43 BoogieIcfgContainer [2022-07-13 11:02:43,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:02:43,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:02:43,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:02:43,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:02:43,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:02:42" (1/3) ... [2022-07-13 11:02:43,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5b1e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:02:43, skipping insertion in model container [2022-07-13 11:02:43,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:42" (2/3) ... [2022-07-13 11:02:43,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5b1e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:02:43, skipping insertion in model container [2022-07-13 11:02:43,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:02:43" (3/3) ... [2022-07-13 11:02:43,090 INFO L111 eAbstractionObserver]: Analyzing ICFG brs3.c [2022-07-13 11:02:43,102 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:02:43,102 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:02:43,149 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:02:43,156 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@bba52ce, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@14f9b4a7 [2022-07-13 11:02:43,157 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:02:43,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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-13 11:02:43,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 11:02:43,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:02:43,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:02:43,167 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:02:43,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:02:43,173 INFO L85 PathProgramCache]: Analyzing trace with hash 361760665, now seen corresponding path program 1 times [2022-07-13 11:02:43,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:02:43,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798853892] [2022-07-13 11:02:43,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:02:43,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:02:43,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:02:43,187 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-13 11:02:43,188 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-13 11:02:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:02:43,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 11:02:43,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:02:43,316 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-13 11:02:43,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:02:43,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:02:43,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798853892] [2022-07-13 11:02:43,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798853892] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:02:43,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:02:43,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:02:43,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061508072] [2022-07-13 11:02:43,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:02:43,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 11:02:43,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:02:43,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 11:02:43,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:02:43,356 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-13 11:02:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:02:43,370 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-07-13 11:02:43,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 11:02:43,371 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2022-07-13 11:02:43,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:02:43,377 INFO L225 Difference]: With dead ends: 36 [2022-07-13 11:02:43,378 INFO L226 Difference]: Without dead ends: 16 [2022-07-13 11:02:43,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-13 11:02:43,383 INFO L413 NwaCegarLoop]: 24 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, 24 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-13 11:02:43,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:02:43,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-07-13 11:02:43,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-13 11:02:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-13 11:02:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-07-13 11:02:43,423 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2022-07-13 11:02:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:02:43,423 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-07-13 11:02:43,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-13 11:02:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-07-13 11:02:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 11:02:43,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:02:43,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:02:43,439 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-13 11:02:43,634 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-13 11:02:43,635 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:02:43,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:02:43,636 INFO L85 PathProgramCache]: Analyzing trace with hash -447913662, now seen corresponding path program 1 times [2022-07-13 11:02:43,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:02:43,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718873207] [2022-07-13 11:02:43,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:02:43,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:02:43,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:02:43,643 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-13 11:02:43,645 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-13 11:02:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:02:43,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:02:43,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:02:43,848 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-13 11:02:43,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:02:43,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:02:43,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718873207] [2022-07-13 11:02:43,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718873207] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:02:43,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:02:43,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:02:43,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528059626] [2022-07-13 11:02:43,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:02:43,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:02:43,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:02:43,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:02:43,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:02:43,860 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-13 11:02:44,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:02:44,055 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-07-13 11:02:44,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:02:44,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2022-07-13 11:02:44,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:02:44,057 INFO L225 Difference]: With dead ends: 33 [2022-07-13 11:02:44,057 INFO L226 Difference]: Without dead ends: 22 [2022-07-13 11:02:44,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:02:44,058 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 43 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:02:44,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 10 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:02:44,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-13 11:02:44,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-07-13 11:02:44,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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-13 11:02:44,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-13 11:02:44,063 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 11 [2022-07-13 11:02:44,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:02:44,063 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-13 11:02:44,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-13 11:02:44,065 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-13 11:02:44,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 11:02:44,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:02:44,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:02:44,075 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-13 11:02:44,274 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-13 11:02:44,275 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:02:44,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:02:44,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1044113915, now seen corresponding path program 1 times [2022-07-13 11:02:44,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:02:44,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595759688] [2022-07-13 11:02:44,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:02:44,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:02:44,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:02:44,278 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-13 11:02:44,279 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-13 11:02:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:02:44,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 11:02:44,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:02:44,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:02:44,488 INFO L356 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2022-07-13 11:02:44,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-07-13 11:02:44,569 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-13 11:02:44,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 34 [2022-07-13 11:02:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:02:44,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:02:44,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:02:44,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595759688] [2022-07-13 11:02:44,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595759688] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:02:44,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:02:44,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:02:44,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94847575] [2022-07-13 11:02:44,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:02:44,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:02:44,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:02:44,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:02:44,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:02:44,601 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-13 11:02:44,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:02:44,807 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-07-13 11:02:44,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:02:44,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2022-07-13 11:02:44,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:02:44,808 INFO L225 Difference]: With dead ends: 27 [2022-07-13 11:02:44,808 INFO L226 Difference]: Without dead ends: 23 [2022-07-13 11:02:44,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:02:44,810 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:02:44,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 26 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:02:44,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-13 11:02:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-07-13 11:02:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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-13 11:02:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-07-13 11:02:44,814 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2022-07-13 11:02:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:02:44,814 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-07-13 11:02:44,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-13 11:02:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-07-13 11:02:44,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 11:02:44,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:02:44,816 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:02:44,825 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-13 11:02:45,024 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-13 11:02:45,025 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:02:45,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:02:45,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1654199858, now seen corresponding path program 1 times [2022-07-13 11:02:45,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:02:45,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788557822] [2022-07-13 11:02:45,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:02:45,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:02:45,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:02:45,028 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-13 11:02:45,030 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-13 11:02:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:02:45,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:02:45,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:02:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:02:45,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:02:45,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:02:45,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:02:45,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788557822] [2022-07-13 11:02:45,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788557822] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:02:45,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:02:45,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2022-07-13 11:02:45,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788080680] [2022-07-13 11:02:45,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:02:45,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:02:45,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:02:45,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:02:45,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:02:45,399 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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-13 11:02:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:02:45,840 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-07-13 11:02:45,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:02:45,841 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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 20 [2022-07-13 11:02:45,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:02:45,842 INFO L225 Difference]: With dead ends: 48 [2022-07-13 11:02:45,842 INFO L226 Difference]: Without dead ends: 28 [2022-07-13 11:02:45,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-07-13 11:02:45,843 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 65 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:02:45,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 20 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:02:45,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-13 11:02:45,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-07-13 11:02:45,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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-13 11:02:45,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-07-13 11:02:45,848 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2022-07-13 11:02:45,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:02:45,848 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-07-13 11:02:45,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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-13 11:02:45,849 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-07-13 11:02:45,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 11:02:45,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:02:45,849 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:02:45,857 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-13 11:02:46,055 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-13 11:02:46,056 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:02:46,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:02:46,056 INFO L85 PathProgramCache]: Analyzing trace with hash 168847774, now seen corresponding path program 1 times [2022-07-13 11:02:46,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:02:46,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521598142] [2022-07-13 11:02:46,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:02:46,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:02:46,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:02:46,058 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-13 11:02:46,060 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-13 11:02:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:02:46,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 11:02:46,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:02:46,208 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 10 treesize of output 8 [2022-07-13 11:02:46,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:02:46,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:02:46,415 INFO L356 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2022-07-13 11:02:46,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-07-13 11:02:46,600 INFO L356 Elim1Store]: treesize reduction 37, result has 26.0 percent of original size [2022-07-13 11:02:46,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 48 [2022-07-13 11:02:46,741 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-13 11:02:46,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 50 [2022-07-13 11:02:46,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:02:46,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:02:52,788 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 386 treesize of output 374 [2022-07-13 11:02:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:02:53,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:02:53,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521598142] [2022-07-13 11:02:53,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521598142] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:02:53,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:02:53,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-07-13 11:02:53,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582530191] [2022-07-13 11:02:53,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:02:53,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 11:02:53,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:02:53,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 11:02:53,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=365, Unknown=1, NotChecked=0, Total=462 [2022-07-13 11:02:53,847 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 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-13 11:02:55,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:02:55,137 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-07-13 11:02:55,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 11:02:55,138 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 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 23 [2022-07-13 11:02:55,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:02:55,139 INFO L225 Difference]: With dead ends: 46 [2022-07-13 11:02:55,139 INFO L226 Difference]: Without dead ends: 42 [2022-07-13 11:02:55,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=220, Invalid=771, Unknown=1, NotChecked=0, Total=992 [2022-07-13 11:02:55,141 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 75 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:02:55,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 36 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 146 Invalid, 0 Unknown, 90 Unchecked, 0.5s Time] [2022-07-13 11:02:55,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-13 11:02:55,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2022-07-13 11:02:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 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-13 11:02:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-07-13 11:02:55,147 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 23 [2022-07-13 11:02:55,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:02:55,147 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-07-13 11:02:55,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 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-13 11:02:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-07-13 11:02:55,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 11:02:55,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:02:55,149 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:02:55,165 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-13 11:02:55,359 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-13 11:02:55,360 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:02:55,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:02:55,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1961352373, now seen corresponding path program 2 times [2022-07-13 11:02:55,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:02:55,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064560306] [2022-07-13 11:02:55,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:02:55,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:02:55,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:02:55,362 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-13 11:02:55,363 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-13 11:02:55,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:02:55,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:02:55,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-13 11:02:55,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:02:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:02:55,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:02:56,098 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:02:56,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:02:56,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064560306] [2022-07-13 11:02:56,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064560306] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:02:56,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:02:56,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-07-13 11:02:56,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737701174] [2022-07-13 11:02:56,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:02:56,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 11:02:56,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:02:56,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 11:02:56,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-07-13 11:02:56,100 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 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-13 11:02:57,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:02:57,816 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2022-07-13 11:02:57,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-13 11:02:57,817 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 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 26 [2022-07-13 11:02:57,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:02:57,818 INFO L225 Difference]: With dead ends: 118 [2022-07-13 11:02:57,818 INFO L226 Difference]: Without dead ends: 94 [2022-07-13 11:02:57,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=484, Invalid=1586, Unknown=0, NotChecked=0, Total=2070 [2022-07-13 11:02:57,819 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 225 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:02:57,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 30 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 11:02:57,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-13 11:02:57,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 78. [2022-07-13 11:02:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 77 states have internal predecessors, (95), 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-13 11:02:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2022-07-13 11:02:57,830 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 26 [2022-07-13 11:02:57,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:02:57,830 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2022-07-13 11:02:57,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 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-13 11:02:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2022-07-13 11:02:57,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 11:02:57,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:02:57,832 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:02:57,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-13 11:02:58,042 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-13 11:02:58,043 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:02:58,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:02:58,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1198950171, now seen corresponding path program 3 times [2022-07-13 11:02:58,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:02:58,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073817577] [2022-07-13 11:02:58,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:02:58,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:02:58,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:02:58,048 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-13 11:02:58,049 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-13 11:02:58,262 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 11:02:58,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:02:58,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-13 11:02:58,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:02:58,325 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 10 treesize of output 8 [2022-07-13 11:02:58,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 11:02:58,542 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 11:02:58,543 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-13 11:02:58,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:02:58,700 INFO L356 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-07-13 11:02:58,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 42 [2022-07-13 11:02:58,902 INFO L356 Elim1Store]: treesize reduction 77, result has 14.4 percent of original size [2022-07-13 11:02:58,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 100 treesize of output 71 [2022-07-13 11:02:59,139 INFO L356 Elim1Store]: treesize reduction 49, result has 21.0 percent of original size [2022-07-13 11:02:59,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 60 [2022-07-13 11:02:59,299 INFO L356 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-07-13 11:02:59,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 53 [2022-07-13 11:02:59,324 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:02:59,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:03:20,133 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| (_ BitVec 32))) (bvsle (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|)) (_ bv0 32)))) (.cse8 ((_ extract 31 0) (_ bv0 64))) (.cse4 (bvadd (_ bv4 32) |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 ((_ extract 63 32) (_ bv0 64)))) (let ((.cse2 (store (store (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| .cse8) .cse4 .cse7))) (let ((.cse6 (bvadd (concat .cse7 .cse8) ((_ sign_extend 32) (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse2) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))))) (let ((.cse5 ((_ extract 63 32) .cse6)) (.cse3 ((_ extract 31 0) .cse6))) (bvadd ((_ sign_extend 32) (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| .cse3) .cse4 .cse5)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32)))) (concat .cse5 .cse3)))))))) (concat ((_ extract 63 32) .cse0) ((_ extract 31 0) .cse0))) ((_ sign_extend 32) (bvmul c_~N~0 (_ bv3 32))))) is different from false [2022-07-13 11:03:20,286 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 11:03:20,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151629042 treesize of output 151053042