./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/960521-1-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3a877d22 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/960521-1-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c10f64ae1701d633846cd3dbd537781b9e2aef0b0b5befdebbc22e76d228933b --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 13:59:53,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 13:59:53,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 13:59:53,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 13:59:53,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 13:59:53,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 13:59:53,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 13:59:53,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 13:59:53,576 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 13:59:53,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 13:59:53,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 13:59:53,582 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 13:59:53,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 13:59:53,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 13:59:53,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 13:59:53,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 13:59:53,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 13:59:53,592 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 13:59:53,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 13:59:53,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 13:59:53,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 13:59:53,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 13:59:53,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 13:59:53,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 13:59:53,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 13:59:53,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 13:59:53,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 13:59:53,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 13:59:53,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 13:59:53,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 13:59:53,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 13:59:53,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 13:59:53,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 13:59:53,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 13:59:53,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 13:59:53,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 13:59:53,612 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 13:59:53,612 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 13:59:53,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 13:59:53,613 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 13:59:53,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 13:59:53,614 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-15 13:59:53,641 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 13:59:53,641 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 13:59:53,642 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 13:59:53,642 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 13:59:53,643 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 13:59:53,643 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 13:59:53,643 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 13:59:53,643 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 13:59:53,644 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 13:59:53,644 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 13:59:53,644 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 13:59:53,644 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 13:59:53,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 13:59:53,645 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 13:59:53,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 13:59:53,645 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-15 13:59:53,645 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-15 13:59:53,645 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-15 13:59:53,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 13:59:53,646 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 13:59:53,646 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 13:59:53,646 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 13:59:53,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 13:59:53,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 13:59:53,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 13:59:53,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 13:59:53,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 13:59:53,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 13:59:53,647 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 13:59:53,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 13:59:53,647 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 13:59:53,648 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c10f64ae1701d633846cd3dbd537781b9e2aef0b0b5befdebbc22e76d228933b [2021-12-15 13:59:53,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 13:59:53,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 13:59:53,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 13:59:53,870 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 13:59:53,870 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 13:59:53,871 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/960521-1-3.i [2021-12-15 13:59:53,915 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e259ebec/7dd715367d1841cd8fcae1412edcdee1/FLAG73cc5ecbc [2021-12-15 13:59:54,321 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 13:59:54,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/960521-1-3.i [2021-12-15 13:59:54,337 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e259ebec/7dd715367d1841cd8fcae1412edcdee1/FLAG73cc5ecbc [2021-12-15 13:59:54,355 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e259ebec/7dd715367d1841cd8fcae1412edcdee1 [2021-12-15 13:59:54,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 13:59:54,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 13:59:54,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 13:59:54,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 13:59:54,363 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 13:59:54,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 01:59:54" (1/1) ... [2021-12-15 13:59:54,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b108ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:59:54, skipping insertion in model container [2021-12-15 13:59:54,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 01:59:54" (1/1) ... [2021-12-15 13:59:54,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 13:59:54,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 13:59:54,628 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 13:59:54,633 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 13:59:54,669 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 13:59:54,685 INFO L208 MainTranslator]: Completed translation [2021-12-15 13:59:54,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:59:54 WrapperNode [2021-12-15 13:59:54,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 13:59:54,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 13:59:54,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 13:59:54,687 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 13:59:54,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:59:54" (1/1) ... [2021-12-15 13:59:54,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:59:54" (1/1) ... [2021-12-15 13:59:54,729 INFO L137 Inliner]: procedures = 121, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2021-12-15 13:59:54,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 13:59:54,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 13:59:54,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 13:59:54,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 13:59:54,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:59:54" (1/1) ... [2021-12-15 13:59:54,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:59:54" (1/1) ... [2021-12-15 13:59:54,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:59:54" (1/1) ... [2021-12-15 13:59:54,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:59:54" (1/1) ... [2021-12-15 13:59:54,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:59:54" (1/1) ... [2021-12-15 13:59:54,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:59:54" (1/1) ... [2021-12-15 13:59:54,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:59:54" (1/1) ... [2021-12-15 13:59:54,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 13:59:54,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 13:59:54,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 13:59:54,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 13:59:54,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:59:54" (1/1) ... [2021-12-15 13:59:54,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 13:59:54,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:59:54,800 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) [2021-12-15 13:59:54,802 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 [2021-12-15 13:59:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 13:59:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 13:59:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 13:59:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 13:59:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 13:59:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 13:59:54,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 13:59:54,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 13:59:54,926 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 13:59:54,927 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 13:59:55,088 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 13:59:55,092 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 13:59:55,092 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 13:59:55,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:59:55 BoogieIcfgContainer [2021-12-15 13:59:55,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 13:59:55,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 13:59:55,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 13:59:55,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 13:59:55,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 01:59:54" (1/3) ... [2021-12-15 13:59:55,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce1ab08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 01:59:55, skipping insertion in model container [2021-12-15 13:59:55,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:59:54" (2/3) ... [2021-12-15 13:59:55,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce1ab08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 01:59:55, skipping insertion in model container [2021-12-15 13:59:55,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:59:55" (3/3) ... [2021-12-15 13:59:55,104 INFO L111 eAbstractionObserver]: Analyzing ICFG 960521-1-3.i [2021-12-15 13:59:55,108 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 13:59:55,108 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2021-12-15 13:59:55,136 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 13:59:55,140 INFO L339 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 13:59:55,141 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2021-12-15 13:59:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 1.896551724137931) internal successors, (55), 50 states have internal predecessors, (55), 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) [2021-12-15 13:59:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 13:59:55,164 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:59:55,164 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 13:59:55,164 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-15 13:59:55,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:59:55,175 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-15 13:59:55,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:59:55,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589540789] [2021-12-15 13:59:55,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:59:55,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:59:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:59:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:59:55,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:59:55,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589540789] [2021-12-15 13:59:55,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589540789] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:59:55,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:59:55,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 13:59:55,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618336971] [2021-12-15 13:59:55,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:59:55,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 13:59:55,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:59:55,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 13:59:55,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 13:59:55,364 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.896551724137931) internal successors, (55), 50 states have internal predecessors, (55), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-12-15 13:59:55,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:59:55,407 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2021-12-15 13:59:55,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 13:59:55,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2021-12-15 13:59:55,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:59:55,415 INFO L225 Difference]: With dead ends: 50 [2021-12-15 13:59:55,415 INFO L226 Difference]: Without dead ends: 48 [2021-12-15 13:59:55,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 13:59:55,420 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:59:55,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 81 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:59:55,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-12-15 13:59:55,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2021-12-15 13:59:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 47 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) [2021-12-15 13:59:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2021-12-15 13:59:55,450 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 3 [2021-12-15 13:59:55,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:59:55,450 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2021-12-15 13:59:55,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-12-15 13:59:55,450 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2021-12-15 13:59:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 13:59:55,451 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:59:55,451 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 13:59:55,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 13:59:55,451 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-15 13:59:55,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:59:55,453 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-15 13:59:55,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:59:55,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252018567] [2021-12-15 13:59:55,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:59:55,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:59:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:59:55,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:59:55,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:59:55,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252018567] [2021-12-15 13:59:55,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252018567] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:59:55,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:59:55,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 13:59:55,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600049155] [2021-12-15 13:59:55,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:59:55,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 13:59:55,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:59:55,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 13:59:55,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 13:59:55,520 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-12-15 13:59:55,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:59:55,540 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2021-12-15 13:59:55,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 13:59:55,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2021-12-15 13:59:55,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:59:55,542 INFO L225 Difference]: With dead ends: 47 [2021-12-15 13:59:55,542 INFO L226 Difference]: Without dead ends: 47 [2021-12-15 13:59:55,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 13:59:55,547 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:59:55,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:59:55,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-15 13:59:55,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-12-15 13:59:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.75) internal successors, (49), 46 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) [2021-12-15 13:59:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2021-12-15 13:59:55,556 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 3 [2021-12-15 13:59:55,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:59:55,557 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2021-12-15 13:59:55,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-12-15 13:59:55,558 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2021-12-15 13:59:55,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-15 13:59:55,558 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:59:55,559 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-15 13:59:55,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 13:59:55,561 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-15 13:59:55,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:59:55,561 INFO L85 PathProgramCache]: Analyzing trace with hash 889446312, now seen corresponding path program 1 times [2021-12-15 13:59:55,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:59:55,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179876064] [2021-12-15 13:59:55,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:59:55,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:59:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:59:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:59:55,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:59:55,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179876064] [2021-12-15 13:59:55,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179876064] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:59:55,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:59:55,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 13:59:55,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325068923] [2021-12-15 13:59:55,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:59:55,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:59:55,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:59:55,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:59:55,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:59:55,637 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2021-12-15 13:59:55,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:59:55,686 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2021-12-15 13:59:55,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 13:59:55,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2021-12-15 13:59:55,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:59:55,688 INFO L225 Difference]: With dead ends: 44 [2021-12-15 13:59:55,688 INFO L226 Difference]: Without dead ends: 44 [2021-12-15 13:59:55,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:59:55,692 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 28 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:59:55,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 51 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:59:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-15 13:59:55,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-12-15 13:59:55,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 43 states have internal predecessors, (46), 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) [2021-12-15 13:59:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2021-12-15 13:59:55,702 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 6 [2021-12-15 13:59:55,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:59:55,702 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2021-12-15 13:59:55,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2021-12-15 13:59:55,702 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2021-12-15 13:59:55,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-15 13:59:55,702 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:59:55,702 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-15 13:59:55,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 13:59:55,703 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-15 13:59:55,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:59:55,703 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2021-12-15 13:59:55,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:59:55,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739659386] [2021-12-15 13:59:55,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:59:55,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:59:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:59:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:59:55,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:59:55,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739659386] [2021-12-15 13:59:55,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739659386] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:59:55,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:59:55,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 13:59:55,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126671329] [2021-12-15 13:59:55,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:59:55,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 13:59:55,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:59:55,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 13:59:55,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 13:59:55,790 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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) [2021-12-15 13:59:55,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:59:55,857 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2021-12-15 13:59:55,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 13:59:55,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2021-12-15 13:59:55,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:59:55,858 INFO L225 Difference]: With dead ends: 51 [2021-12-15 13:59:55,858 INFO L226 Difference]: Without dead ends: 51 [2021-12-15 13:59:55,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 13:59:55,866 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 56 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:59:55,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 64 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:59:55,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-15 13:59:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2021-12-15 13:59:55,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 44 states have internal predecessors, (48), 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) [2021-12-15 13:59:55,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2021-12-15 13:59:55,873 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 6 [2021-12-15 13:59:55,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:59:55,873 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2021-12-15 13:59:55,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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) [2021-12-15 13:59:55,873 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2021-12-15 13:59:55,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-15 13:59:55,874 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:59:55,874 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:59:55,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 13:59:55,874 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-15 13:59:55,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:59:55,875 INFO L85 PathProgramCache]: Analyzing trace with hash 59362067, now seen corresponding path program 1 times [2021-12-15 13:59:55,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:59:55,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801461159] [2021-12-15 13:59:55,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:59:55,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:59:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:59:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:59:55,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:59:55,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801461159] [2021-12-15 13:59:55,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801461159] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:59:55,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:59:55,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 13:59:55,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951990005] [2021-12-15 13:59:55,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:59:55,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:59:55,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:59:55,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:59:55,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:59:55,921 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2021-12-15 13:59:55,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:59:55,959 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2021-12-15 13:59:55,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:59:55,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2021-12-15 13:59:55,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:59:55,961 INFO L225 Difference]: With dead ends: 50 [2021-12-15 13:59:55,961 INFO L226 Difference]: Without dead ends: 50 [2021-12-15 13:59:55,961 INFO L932 BasicCegarLoop]: 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 [2021-12-15 13:59:55,961 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 53 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:59:55,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 66 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:59:55,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-15 13:59:55,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2021-12-15 13:59:55,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 44 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) [2021-12-15 13:59:55,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2021-12-15 13:59:55,965 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 8 [2021-12-15 13:59:55,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:59:55,966 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2021-12-15 13:59:55,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2021-12-15 13:59:55,966 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2021-12-15 13:59:55,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-15 13:59:55,966 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:59:55,966 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:59:55,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 13:59:55,967 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-15 13:59:55,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:59:55,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1841820687, now seen corresponding path program 1 times [2021-12-15 13:59:55,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:59:55,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775234319] [2021-12-15 13:59:55,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:59:55,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:59:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:59:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:59:56,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:59:56,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775234319] [2021-12-15 13:59:56,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775234319] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:59:56,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977485925] [2021-12-15 13:59:56,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:59:56,070 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:59:56,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:59:56,071 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) [2021-12-15 13:59:56,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 13:59:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:59:56,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-15 13:59:56,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:59:56,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 13:59:56,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2021-12-15 13:59:56,248 INFO L388 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 [2021-12-15 13:59:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:59:56,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:59:56,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:59:56,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977485925] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:59:56,403 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:59:56,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2021-12-15 13:59:56,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859283207] [2021-12-15 13:59:56,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:59:56,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 13:59:56,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:59:56,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 13:59:56,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-12-15 13:59:56,405 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 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) [2021-12-15 13:59:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:59:56,559 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2021-12-15 13:59:56,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 13:59:56,560 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 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) Word has length 9 [2021-12-15 13:59:56,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:59:56,563 INFO L225 Difference]: With dead ends: 92 [2021-12-15 13:59:56,563 INFO L226 Difference]: Without dead ends: 92 [2021-12-15 13:59:56,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2021-12-15 13:59:56,564 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 292 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:59:56,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 137 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:59:56,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-15 13:59:56,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 57. [2021-12-15 13:59:56,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 56 states have internal predecessors, (61), 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) [2021-12-15 13:59:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2021-12-15 13:59:56,577 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 9 [2021-12-15 13:59:56,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:59:56,577 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2021-12-15 13:59:56,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 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) [2021-12-15 13:59:56,577 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2021-12-15 13:59:56,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 13:59:56,578 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:59:56,578 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2021-12-15 13:59:56,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 13:59:56,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-15 13:59:56,784 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-15 13:59:56,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:59:56,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1941957673, now seen corresponding path program 2 times [2021-12-15 13:59:56,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:59:56,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466165394] [2021-12-15 13:59:56,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:59:56,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:59:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:59:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:59:56,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:59:56,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466165394] [2021-12-15 13:59:56,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466165394] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:59:56,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44513740] [2021-12-15 13:59:56,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 13:59:56,918 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:59:56,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:59:56,919 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) [2021-12-15 13:59:56,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 13:59:56,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 13:59:56,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:59:56,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-15 13:59:56,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:59:56,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 13:59:56,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2021-12-15 13:59:56,985 INFO L388 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 [2021-12-15 13:59:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:59:57,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:59:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:59:57,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44513740] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:59:57,309 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:59:57,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2021-12-15 13:59:57,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744451503] [2021-12-15 13:59:57,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:59:57,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-15 13:59:57,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:59:57,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-15 13:59:57,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2021-12-15 13:59:57,310 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 21 states, 20 states have (on average 2.6) internal successors, (52), 21 states have internal predecessors, (52), 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) [2021-12-15 13:59:57,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:59:57,817 INFO L93 Difference]: Finished difference Result 224 states and 230 transitions. [2021-12-15 13:59:57,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 13:59:57,818 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 21 states have internal predecessors, (52), 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 18 [2021-12-15 13:59:57,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:59:57,819 INFO L225 Difference]: With dead ends: 224 [2021-12-15 13:59:57,819 INFO L226 Difference]: Without dead ends: 224 [2021-12-15 13:59:57,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=271, Invalid=599, Unknown=0, NotChecked=0, Total=870 [2021-12-15 13:59:57,820 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 766 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 13:59:57,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [766 Valid, 300 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 13:59:57,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-12-15 13:59:57,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 84. [2021-12-15 13:59:57,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 83 states have internal predecessors, (94), 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) [2021-12-15 13:59:57,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2021-12-15 13:59:57,826 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 18 [2021-12-15 13:59:57,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:59:57,826 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2021-12-15 13:59:57,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 21 states have internal predecessors, (52), 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) [2021-12-15 13:59:57,826 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2021-12-15 13:59:57,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-15 13:59:57,827 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:59:57,827 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1] [2021-12-15 13:59:57,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 13:59:58,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-15 13:59:58,040 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-15 13:59:58,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:59:58,040 INFO L85 PathProgramCache]: Analyzing trace with hash 820795113, now seen corresponding path program 3 times [2021-12-15 13:59:58,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:59:58,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645575764] [2021-12-15 13:59:58,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:59:58,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:59:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:59:58,309 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:59:58,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:59:58,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645575764] [2021-12-15 13:59:58,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645575764] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:59:58,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774738673] [2021-12-15 13:59:58,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 13:59:58,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:59:58,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:59:58,319 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) [2021-12-15 13:59:58,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 13:59:58,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-15 13:59:58,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:59:58,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 13:59:58,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:59:58,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 13:59:58,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2021-12-15 13:59:58,387 INFO L388 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 [2021-12-15 13:59:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-12-15 13:59:58,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:59:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-12-15 13:59:58,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774738673] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:59:58,952 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:59:58,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 22 [2021-12-15 13:59:58,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718193592] [2021-12-15 13:59:58,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:59:58,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-15 13:59:58,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:59:58,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-15 13:59:58,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=347, Unknown=0, NotChecked=0, Total=506 [2021-12-15 13:59:58,953 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 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) [2021-12-15 13:59:59,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:59:59,593 INFO L93 Difference]: Finished difference Result 327 states and 336 transitions. [2021-12-15 13:59:59,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-15 13:59:59,594 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 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 36 [2021-12-15 13:59:59,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:59:59,595 INFO L225 Difference]: With dead ends: 327 [2021-12-15 13:59:59,595 INFO L226 Difference]: Without dead ends: 327 [2021-12-15 13:59:59,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=570, Unknown=0, NotChecked=0, Total=870 [2021-12-15 13:59:59,596 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 1788 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1788 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-15 13:59:59,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1788 Valid, 368 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-15 13:59:59,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-12-15 13:59:59,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 88. [2021-12-15 13:59:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 87 states have internal predecessors, (98), 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) [2021-12-15 13:59:59,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2021-12-15 13:59:59,599 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 36 [2021-12-15 13:59:59,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:59:59,600 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2021-12-15 13:59:59,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 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) [2021-12-15 13:59:59,600 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2021-12-15 13:59:59,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-15 13:59:59,601 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:59:59,601 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:59:59,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-15 13:59:59,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:59:59,801 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-15 13:59:59,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:59:59,802 INFO L85 PathProgramCache]: Analyzing trace with hash 15618195, now seen corresponding path program 1 times [2021-12-15 13:59:59,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:59:59,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453036663] [2021-12-15 13:59:59,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:59:59,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:59:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:59:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-12-15 13:59:59,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:59:59,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453036663] [2021-12-15 13:59:59,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453036663] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:59:59,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:59:59,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 13:59:59,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945962756] [2021-12-15 13:59:59,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:59:59,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:59:59,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:59:59,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:59:59,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:59:59,859 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) 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) [2021-12-15 13:59:59,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:59:59,879 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2021-12-15 13:59:59,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:59:59,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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 44 [2021-12-15 13:59:59,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:59:59,882 INFO L225 Difference]: With dead ends: 86 [2021-12-15 13:59:59,882 INFO L226 Difference]: Without dead ends: 86 [2021-12-15 13:59:59,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 13:59:59,883 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:59:59,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 59 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:59:59,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-15 13:59:59,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-12-15 13:59:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 85 states have internal predecessors, (92), 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) [2021-12-15 13:59:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2021-12-15 13:59:59,889 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 44 [2021-12-15 13:59:59,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:59:59,890 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2021-12-15 13:59:59,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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) [2021-12-15 13:59:59,891 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2021-12-15 13:59:59,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-15 13:59:59,892 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:59:59,893 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:59:59,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 13:59:59,893 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-15 13:59:59,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:59:59,893 INFO L85 PathProgramCache]: Analyzing trace with hash 15618196, now seen corresponding path program 1 times [2021-12-15 13:59:59,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:59:59,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229275464] [2021-12-15 13:59:59,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:59:59,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:59:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:00,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:00,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229275464] [2021-12-15 14:00:00,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229275464] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:00:00,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997074470] [2021-12-15 14:00:00,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:00,047 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:00,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:00:00,060 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) [2021-12-15 14:00:00,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-15 14:00:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:00,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-15 14:00:00,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:00:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:00,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:00:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:00,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997074470] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:00:00,667 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:00:00,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 43 [2021-12-15 14:00:00,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508877866] [2021-12-15 14:00:00,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:00:00,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-15 14:00:00,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:00,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-15 14:00:00,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=1019, Unknown=0, NotChecked=0, Total=1806 [2021-12-15 14:00:00,669 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 43 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 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) [2021-12-15 14:00:01,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:01,142 INFO L93 Difference]: Finished difference Result 536 states and 550 transitions. [2021-12-15 14:00:01,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-15 14:00:01,143 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 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 44 [2021-12-15 14:00:01,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:01,144 INFO L225 Difference]: With dead ends: 536 [2021-12-15 14:00:01,145 INFO L226 Difference]: Without dead ends: 536 [2021-12-15 14:00:01,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1190, Invalid=1890, Unknown=0, NotChecked=0, Total=3080 [2021-12-15 14:00:01,146 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 1606 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:01,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1606 Valid, 415 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:00:01,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2021-12-15 14:00:01,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 152. [2021-12-15 14:00:01,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 141 states have (on average 1.177304964539007) internal successors, (166), 151 states have internal predecessors, (166), 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) [2021-12-15 14:00:01,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2021-12-15 14:00:01,150 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 44 [2021-12-15 14:00:01,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:01,151 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2021-12-15 14:00:01,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 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) [2021-12-15 14:00:01,151 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2021-12-15 14:00:01,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-15 14:00:01,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:01,152 INFO L514 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:01,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-15 14:00:01,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:01,367 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-15 14:00:01,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:01,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1639898028, now seen corresponding path program 2 times [2021-12-15 14:00:01,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:01,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103163306] [2021-12-15 14:00:01,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:01,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:01,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:01,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103163306] [2021-12-15 14:00:01,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103163306] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:00:01,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308511728] [2021-12-15 14:00:01,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 14:00:01,762 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:01,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:00:01,763 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) [2021-12-15 14:00:01,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-15 14:00:01,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-15 14:00:01,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 14:00:01,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 14:00:01,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:00:01,848 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 14:00:01,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-15 14:00:02,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1001 trivial. 0 not checked. [2021-12-15 14:00:02,178 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:00:02,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308511728] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:02,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 14:00:02,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [30] total 32 [2021-12-15 14:00:02,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523156430] [2021-12-15 14:00:02,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:02,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:00:02,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:02,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:00:02,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=578, Unknown=0, NotChecked=0, Total=992 [2021-12-15 14:00:02,179 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) 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) [2021-12-15 14:00:02,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:02,198 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2021-12-15 14:00:02,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:00:02,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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 86 [2021-12-15 14:00:02,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:02,199 INFO L225 Difference]: With dead ends: 128 [2021-12-15 14:00:02,199 INFO L226 Difference]: Without dead ends: 128 [2021-12-15 14:00:02,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=414, Invalid=578, Unknown=0, NotChecked=0, Total=992 [2021-12-15 14:00:02,200 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:02,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:00:02,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-12-15 14:00:02,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2021-12-15 14:00:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 126 states have (on average 1.1111111111111112) internal successors, (140), 127 states have internal predecessors, (140), 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) [2021-12-15 14:00:02,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2021-12-15 14:00:02,202 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 86 [2021-12-15 14:00:02,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:02,202 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2021-12-15 14:00:02,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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) [2021-12-15 14:00:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2021-12-15 14:00:02,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-15 14:00:02,203 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:02,204 INFO L514 BasicCegarLoop]: trace histogram [26, 26, 26, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:02,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-15 14:00:02,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-15 14:00:02,412 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-15 14:00:02,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:02,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1050815861, now seen corresponding path program 1 times [2021-12-15 14:00:02,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:02,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519632900] [2021-12-15 14:00:02,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:02,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:02,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 14:00:02,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:02,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519632900] [2021-12-15 14:00:02,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519632900] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:00:02,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74483048] [2021-12-15 14:00:02,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:02,748 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:02,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:00:02,749 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) [2021-12-15 14:00:02,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-15 14:00:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:02,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-15 14:00:02,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:00:03,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 14:00:03,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:00:04,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 14:00:04,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74483048] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:00:04,386 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:00:04,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 85 [2021-12-15 14:00:04,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339066335] [2021-12-15 14:00:04,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:00:04,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2021-12-15 14:00:04,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:04,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2021-12-15 14:00:04,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3139, Invalid=4001, Unknown=0, NotChecked=0, Total=7140 [2021-12-15 14:00:04,390 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 85 states, 85 states have (on average 2.9411764705882355) internal successors, (250), 85 states have internal predecessors, (250), 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) [2021-12-15 14:00:05,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:05,824 INFO L93 Difference]: Finished difference Result 461 states and 462 transitions. [2021-12-15 14:00:05,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-12-15 14:00:05,834 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 2.9411764705882355) internal successors, (250), 85 states have internal predecessors, (250), 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 89 [2021-12-15 14:00:05,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:05,837 INFO L225 Difference]: With dead ends: 461 [2021-12-15 14:00:05,837 INFO L226 Difference]: Without dead ends: 461 [2021-12-15 14:00:05,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4425 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=4732, Invalid=7700, Unknown=0, NotChecked=0, Total=12432 [2021-12-15 14:00:05,841 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 1563 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1563 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:05,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1563 Valid, 76 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-15 14:00:05,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-12-15 14:00:05,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 254. [2021-12-15 14:00:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 252 states have (on average 1.1111111111111112) internal successors, (280), 253 states have internal predecessors, (280), 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) [2021-12-15 14:00:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 280 transitions. [2021-12-15 14:00:05,845 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 280 transitions. Word has length 89 [2021-12-15 14:00:05,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:05,846 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 280 transitions. [2021-12-15 14:00:05,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 2.9411764705882355) internal successors, (250), 85 states have internal predecessors, (250), 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) [2021-12-15 14:00:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 280 transitions. [2021-12-15 14:00:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-12-15 14:00:05,847 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:05,847 INFO L514 BasicCegarLoop]: trace histogram [54, 54, 54, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:05,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-15 14:00:06,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:06,060 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-15 14:00:06,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:06,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1332910603, now seen corresponding path program 2 times [2021-12-15 14:00:06,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:06,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337462613] [2021-12-15 14:00:06,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:06,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4349 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 14:00:07,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:07,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337462613] [2021-12-15 14:00:07,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337462613] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:00:07,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738659935] [2021-12-15 14:00:07,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 14:00:07,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:07,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:00:07,240 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) [2021-12-15 14:00:07,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-15 14:00:07,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 14:00:07,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 14:00:07,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-15 14:00:07,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:00:09,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4349 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 14:00:09,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:00:12,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4349 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 14:00:12,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738659935] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:00:12,245 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:00:12,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 169 [2021-12-15 14:00:12,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287806180] [2021-12-15 14:00:12,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:00:12,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 169 states [2021-12-15 14:00:12,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:12,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2021-12-15 14:00:12,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12547, Invalid=15845, Unknown=0, NotChecked=0, Total=28392 [2021-12-15 14:00:12,255 INFO L87 Difference]: Start difference. First operand 254 states and 280 transitions. Second operand has 169 states, 169 states have (on average 2.970414201183432) internal successors, (502), 169 states have internal predecessors, (502), 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) [2021-12-15 14:00:18,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:18,485 INFO L93 Difference]: Finished difference Result 937 states and 938 transitions. [2021-12-15 14:00:18,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2021-12-15 14:00:18,486 INFO L78 Accepts]: Start accepts. Automaton has has 169 states, 169 states have (on average 2.970414201183432) internal successors, (502), 169 states have internal predecessors, (502), 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 173 [2021-12-15 14:00:18,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:18,488 INFO L225 Difference]: With dead ends: 937 [2021-12-15 14:00:18,488 INFO L226 Difference]: Without dead ends: 937 [2021-12-15 14:00:18,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18257 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=18872, Invalid=31080, Unknown=0, NotChecked=0, Total=49952 [2021-12-15 14:00:18,491 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 2977 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2977 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 734 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:18,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2977 Valid, 136 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [734 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-15 14:00:18,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2021-12-15 14:00:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 506. [2021-12-15 14:00:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 504 states have (on average 1.1111111111111112) internal successors, (560), 505 states have internal predecessors, (560), 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) [2021-12-15 14:00:18,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 560 transitions. [2021-12-15 14:00:18,498 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 560 transitions. Word has length 173 [2021-12-15 14:00:18,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:18,499 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 560 transitions. [2021-12-15 14:00:18,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 169 states, 169 states have (on average 2.970414201183432) internal successors, (502), 169 states have internal predecessors, (502), 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) [2021-12-15 14:00:18,499 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 560 transitions. [2021-12-15 14:00:18,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2021-12-15 14:00:18,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:18,502 INFO L514 BasicCegarLoop]: trace histogram [110, 110, 110, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:18,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-15 14:00:18,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:18,720 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-15 14:00:18,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:18,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1249634571, now seen corresponding path program 3 times [2021-12-15 14:00:18,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:18,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288306224] [2021-12-15 14:00:18,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:18,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 18097 backedges. 0 proven. 18095 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 14:00:22,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:22,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288306224] [2021-12-15 14:00:22,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288306224] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:00:22,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751324473] [2021-12-15 14:00:22,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 14:00:22,902 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:22,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:00:22,903 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) [2021-12-15 14:00:22,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-15 14:00:23,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-15 14:00:23,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 14:00:23,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-15 14:00:23,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:00:23,052 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 14:00:23,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-15 14:00:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 18097 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18095 trivial. 0 not checked. [2021-12-15 14:00:24,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:00:24,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751324473] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:24,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 14:00:24,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [114] total 118 [2021-12-15 14:00:24,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923728269] [2021-12-15 14:00:24,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:24,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:00:24,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:24,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:00:24,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6345, Invalid=7461, Unknown=0, NotChecked=0, Total=13806 [2021-12-15 14:00:24,481 INFO L87 Difference]: Start difference. First operand 506 states and 560 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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) [2021-12-15 14:00:24,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:24,514 INFO L93 Difference]: Finished difference Result 505 states and 506 transitions. [2021-12-15 14:00:24,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 14:00:24,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 341 [2021-12-15 14:00:24,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:24,516 INFO L225 Difference]: With dead ends: 505 [2021-12-15 14:00:24,516 INFO L226 Difference]: Without dead ends: 505 [2021-12-15 14:00:24,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6345, Invalid=7461, Unknown=0, NotChecked=0, Total=13806 [2021-12-15 14:00:24,517 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:24,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 6 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:00:24,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-12-15 14:00:24,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2021-12-15 14:00:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 1.003968253968254) internal successors, (506), 504 states have internal predecessors, (506), 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) [2021-12-15 14:00:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 506 transitions. [2021-12-15 14:00:24,523 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 506 transitions. Word has length 341 [2021-12-15 14:00:24,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:24,523 INFO L470 AbstractCegarLoop]: Abstraction has 505 states and 506 transitions. [2021-12-15 14:00:24,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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) [2021-12-15 14:00:24,524 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 506 transitions. [2021-12-15 14:00:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2021-12-15 14:00:24,528 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:24,528 INFO L514 BasicCegarLoop]: trace histogram [110, 110, 110, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:24,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-15 14:00:24,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-15 14:00:24,742 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-15 14:00:24,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:24,743 INFO L85 PathProgramCache]: Analyzing trace with hash -385350866, now seen corresponding path program 1 times [2021-12-15 14:00:24,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:24,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306503020] [2021-12-15 14:00:24,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:24,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:28,854 INFO L134 CoverageAnalysis]: Checked inductivity of 22605 backedges. 0 proven. 18095 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2021-12-15 14:00:28,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:28,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306503020] [2021-12-15 14:00:28,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306503020] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:00:28,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723384821] [2021-12-15 14:00:28,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:28,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:28,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:00:28,856 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) [2021-12-15 14:00:28,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-15 14:00:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:29,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 1893 conjuncts, 113 conjunts are in the unsatisfiable core [2021-12-15 14:00:29,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:00:34,541 INFO L134 CoverageAnalysis]: Checked inductivity of 22605 backedges. 0 proven. 18095 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2021-12-15 14:00:34,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:00:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 22605 backedges. 0 proven. 18095 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2021-12-15 14:00:36,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723384821] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:00:36,646 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:00:36,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114, 114] total 243 [2021-12-15 14:00:36,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227739438] [2021-12-15 14:00:36,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:00:36,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 243 states [2021-12-15 14:00:36,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:36,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 243 interpolants. [2021-12-15 14:00:36,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23154, Invalid=35652, Unknown=0, NotChecked=0, Total=58806 [2021-12-15 14:00:36,655 INFO L87 Difference]: Start difference. First operand 505 states and 506 transitions. Second operand has 243 states, 243 states have (on average 3.0) internal successors, (729), 243 states have internal predecessors, (729), 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) [2021-12-15 14:00:44,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:44,516 INFO L93 Difference]: Finished difference Result 823 states and 824 transitions. [2021-12-15 14:00:44,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2021-12-15 14:00:44,517 INFO L78 Accepts]: Start accepts. Automaton has has 243 states, 243 states have (on average 3.0) internal successors, (729), 243 states have internal predecessors, (729), 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 504 [2021-12-15 14:00:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:44,519 INFO L225 Difference]: With dead ends: 823 [2021-12-15 14:00:44,519 INFO L226 Difference]: Without dead ends: 823 [2021-12-15 14:00:44,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1137 GetRequests, 878 SyntacticMatches, 1 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30957 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=25415, Invalid=41925, Unknown=0, NotChecked=0, Total=67340 [2021-12-15 14:00:44,522 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 2554 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 997 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2554 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 997 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:44,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2554 Valid, 63 Invalid, 2146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [997 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-15 14:00:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2021-12-15 14:00:44,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 727. [2021-12-15 14:00:44,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 1.002754820936639) internal successors, (728), 726 states have internal predecessors, (728), 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) [2021-12-15 14:00:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 728 transitions. [2021-12-15 14:00:44,544 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 728 transitions. Word has length 504 [2021-12-15 14:00:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:44,545 INFO L470 AbstractCegarLoop]: Abstraction has 727 states and 728 transitions. [2021-12-15 14:00:44,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 243 states, 243 states have (on average 3.0) internal successors, (729), 243 states have internal predecessors, (729), 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) [2021-12-15 14:00:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 728 transitions. [2021-12-15 14:00:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2021-12-15 14:00:44,557 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:44,557 INFO L514 BasicCegarLoop]: trace histogram [128, 128, 128, 111, 111, 111, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:44,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-15 14:00:44,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-15 14:00:44,779 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-15 14:00:44,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:44,780 INFO L85 PathProgramCache]: Analyzing trace with hash 972365294, now seen corresponding path program 2 times [2021-12-15 14:00:44,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:44,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222256273] [2021-12-15 14:00:44,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:44,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:48,780 INFO L134 CoverageAnalysis]: Checked inductivity of 42938 backedges. 0 proven. 18426 refuted. 0 times theorem prover too weak. 24512 trivial. 0 not checked. [2021-12-15 14:00:48,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:48,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222256273] [2021-12-15 14:00:48,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222256273] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:00:48,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807573972] [2021-12-15 14:00:48,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 14:00:48,781 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:48,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:00:48,782 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) [2021-12-15 14:00:48,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-15 14:00:49,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 14:00:49,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 14:00:49,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 2707 conjuncts, 113 conjunts are in the unsatisfiable core [2021-12-15 14:00:49,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:00:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 42938 backedges. 0 proven. 18426 refuted. 0 times theorem prover too weak. 24512 trivial. 0 not checked. [2021-12-15 14:00:50,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:00:52,000 INFO L134 CoverageAnalysis]: Checked inductivity of 42938 backedges. 0 proven. 18426 refuted. 0 times theorem prover too weak. 24512 trivial. 0 not checked. [2021-12-15 14:00:52,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807573972] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:00:52,000 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:00:52,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114, 114] total 130 [2021-12-15 14:00:52,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677000754] [2021-12-15 14:00:52,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:00:52,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2021-12-15 14:00:52,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:52,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2021-12-15 14:00:52,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2021-12-15 14:00:52,006 INFO L87 Difference]: Start difference. First operand 727 states and 728 transitions. Second operand has 130 states, 130 states have (on average 3.046153846153846) internal successors, (396), 130 states have internal predecessors, (396), 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) [2021-12-15 14:00:54,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:54,794 INFO L93 Difference]: Finished difference Result 775 states and 776 transitions. [2021-12-15 14:00:54,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2021-12-15 14:00:54,795 INFO L78 Accepts]: Start accepts. Automaton has has 130 states, 130 states have (on average 3.046153846153846) internal successors, (396), 130 states have internal predecessors, (396), 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 726 [2021-12-15 14:00:54,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:54,797 INFO L225 Difference]: With dead ends: 775 [2021-12-15 14:00:54,797 INFO L226 Difference]: Without dead ends: 775 [2021-12-15 14:00:54,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1564 GetRequests, 1435 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2021-12-15 14:00:54,798 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 1192 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:54,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1192 Valid, 39 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-15 14:00:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2021-12-15 14:00:54,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2021-12-15 14:00:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 774 states have (on average 1.0025839793281655) internal successors, (776), 774 states have internal predecessors, (776), 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) [2021-12-15 14:00:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 776 transitions. [2021-12-15 14:00:54,806 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 776 transitions. Word has length 726 [2021-12-15 14:00:54,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:54,807 INFO L470 AbstractCegarLoop]: Abstraction has 775 states and 776 transitions. [2021-12-15 14:00:54,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 130 states have (on average 3.046153846153846) internal successors, (396), 130 states have internal predecessors, (396), 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) [2021-12-15 14:00:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 776 transitions. [2021-12-15 14:00:54,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2021-12-15 14:00:54,810 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:54,810 INFO L514 BasicCegarLoop]: trace histogram [128, 128, 128, 127, 127, 127, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:54,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-15 14:00:55,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-15 14:00:55,031 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-15 14:00:55,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:55,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1306820846, now seen corresponding path program 3 times [2021-12-15 14:00:55,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:55,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114080737] [2021-12-15 14:00:55,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:55,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 14:00:55,343 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 14:00:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 14:00:55,761 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 14:00:55,762 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-15 14:00:55,762 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7REQUIRES_VIOLATION (20 of 21 remaining) [2021-12-15 14:00:55,765 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (19 of 21 remaining) [2021-12-15 14:00:55,765 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (18 of 21 remaining) [2021-12-15 14:00:55,765 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (17 of 21 remaining) [2021-12-15 14:00:55,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (16 of 21 remaining) [2021-12-15 14:00:55,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (15 of 21 remaining) [2021-12-15 14:00:55,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (14 of 21 remaining) [2021-12-15 14:00:55,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (13 of 21 remaining) [2021-12-15 14:00:55,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (12 of 21 remaining) [2021-12-15 14:00:55,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (11 of 21 remaining) [2021-12-15 14:00:55,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (10 of 21 remaining) [2021-12-15 14:00:55,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (9 of 21 remaining) [2021-12-15 14:00:55,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (8 of 21 remaining) [2021-12-15 14:00:55,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (7 of 21 remaining) [2021-12-15 14:00:55,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (6 of 21 remaining) [2021-12-15 14:00:55,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2021-12-15 14:00:55,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2021-12-15 14:00:55,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2021-12-15 14:00:55,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2021-12-15 14:00:55,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (1 of 21 remaining) [2021-12-15 14:00:55,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2021-12-15 14:00:55,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-15 14:00:55,772 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:55,776 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 14:00:55,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 02:00:55 BoogieIcfgContainer [2021-12-15 14:00:55,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 14:00:55,930 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 14:00:55,930 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 14:00:55,930 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 14:00:55,930 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:59:55" (3/4) ... [2021-12-15 14:00:55,931 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-15 14:00:56,050 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-15 14:00:56,051 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 14:00:56,051 INFO L158 Benchmark]: Toolchain (without parser) took 61692.53ms. Allocated memory was 109.1MB in the beginning and 906.0MB in the end (delta: 796.9MB). Free memory was 79.1MB in the beginning and 370.8MB in the end (delta: -291.7MB). Peak memory consumption was 503.7MB. Max. memory is 16.1GB. [2021-12-15 14:00:56,052 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 66.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 14:00:56,052 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.78ms. Allocated memory is still 109.1MB. Free memory was 79.1MB in the beginning and 76.5MB in the end (delta: 2.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-15 14:00:56,052 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.30ms. Allocated memory is still 109.1MB. Free memory was 76.5MB in the beginning and 74.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 14:00:56,052 INFO L158 Benchmark]: Boogie Preprocessor took 47.24ms. Allocated memory is still 109.1MB. Free memory was 74.7MB in the beginning and 73.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 14:00:56,052 INFO L158 Benchmark]: RCFGBuilder took 320.40ms. Allocated memory is still 109.1MB. Free memory was 73.2MB in the beginning and 61.5MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-15 14:00:56,053 INFO L158 Benchmark]: TraceAbstraction took 60829.34ms. Allocated memory was 109.1MB in the beginning and 906.0MB in the end (delta: 796.9MB). Free memory was 61.0MB in the beginning and 406.4MB in the end (delta: -345.4MB). Peak memory consumption was 452.6MB. Max. memory is 16.1GB. [2021-12-15 14:00:56,053 INFO L158 Benchmark]: Witness Printer took 120.92ms. Allocated memory is still 906.0MB. Free memory was 406.4MB in the beginning and 370.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2021-12-15 14:00:56,057 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.15ms. Allocated memory is still 109.1MB. Free memory is still 66.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.78ms. Allocated memory is still 109.1MB. Free memory was 79.1MB in the beginning and 76.5MB in the end (delta: 2.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.30ms. Allocated memory is still 109.1MB. Free memory was 76.5MB in the beginning and 74.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.24ms. Allocated memory is still 109.1MB. Free memory was 74.7MB in the beginning and 73.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 320.40ms. Allocated memory is still 109.1MB. Free memory was 73.2MB in the beginning and 61.5MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 60829.34ms. Allocated memory was 109.1MB in the beginning and 906.0MB in the end (delta: 796.9MB). Free memory was 61.0MB in the beginning and 406.4MB in the end (delta: -345.4MB). Peak memory consumption was 452.6MB. Max. memory is 16.1GB. * Witness Printer took 120.92ms. Allocated memory is still 906.0MB. Free memory was 406.4MB in the beginning and 370.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 540]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L523] int *a, *b; [L524] int n; VAL [a={0:0}, b={0:0}, n=0] [L535] n = 128 [L536] a = malloc (n * sizeof(*a)) [L537] b = malloc (n * sizeof(*b)) [L538] EXPR b++ VAL [a={-3:0}, b={-2:4}, b++={-2:0}, n=128] [L538] *b++ = 0 VAL [a={-3:0}, b={-2:4}, b++={-2:0}, n=128] [L539] CALL foo () [L527] int i; [L528] i = 0 VAL [a={-3:0}, b={-2:4}, i=0, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=0, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=0, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=1, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=1, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=1, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=2, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=2, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=2, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=3, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=3, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=3, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=4, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=4, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=4, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=5, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=5, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=5, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=6, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=6, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=6, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=7, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=7, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=7, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=8, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=8, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=8, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=9, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=9, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=9, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=10, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=10, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=10, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=11, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=11, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=11, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=12, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=12, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=12, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=13, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=13, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=13, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=14, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=14, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=14, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=15, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=15, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=15, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=16, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=16, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=16, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=17, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=17, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=17, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=18, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=18, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=18, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=19, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=19, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=19, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=20, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=20, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=20, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=21, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=21, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=21, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=22, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=22, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=22, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=23, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=23, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=23, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=24, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=24, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=24, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=25, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=25, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=25, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=26, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=26, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=26, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=27, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=27, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=27, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=28, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=28, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=28, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=29, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=29, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=29, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=30, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=30, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=30, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=31, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=31, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=31, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=32, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=32, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=32, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=33, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=33, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=33, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=34, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=34, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=34, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=35, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=35, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=35, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=36, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=36, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=36, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=37, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=37, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=37, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=38, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=38, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=38, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=39, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=39, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=39, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=40, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=40, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=40, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=41, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=41, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=41, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=42, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=42, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=42, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=43, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=43, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=43, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=44, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=44, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=44, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=45, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=45, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=45, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=46, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=46, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=46, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=47, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=47, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=47, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=48, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=48, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=48, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=49, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=49, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=49, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=50, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=50, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=50, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=51, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=51, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=51, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=52, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=52, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=52, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=53, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=53, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=53, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=54, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=54, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=54, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=55, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=55, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=55, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=56, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=56, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=56, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=57, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=57, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=57, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=58, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=58, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=58, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=59, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=59, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=59, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=60, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=60, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=60, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=61, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=61, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=61, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=62, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=62, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=62, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=63, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=63, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=63, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=64, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=64, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=64, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=65, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=65, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=65, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=66, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=66, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=66, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=67, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=67, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=67, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=68, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=68, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=68, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=69, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=69, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=69, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=70, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=70, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=70, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=71, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=71, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=71, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=72, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=72, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=72, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=73, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=73, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=73, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=74, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=74, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=74, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=75, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=75, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=75, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=76, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=76, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=76, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=77, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=77, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=77, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=78, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=78, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=78, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=79, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=79, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=79, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=80, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=80, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=80, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=81, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=81, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=81, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=82, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=82, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=82, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=83, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=83, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=83, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=84, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=84, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=84, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=85, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=85, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=85, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=86, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=86, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=86, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=87, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=87, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=87, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=88, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=88, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=88, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=89, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=89, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=89, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=90, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=90, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=90, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=91, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=91, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=91, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=92, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=92, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=92, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=93, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=93, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=93, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=94, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=94, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=94, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=95, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=95, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=95, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=96, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=96, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=96, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=97, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=97, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=97, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=98, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=98, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=98, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=99, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=99, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=99, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=100, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=100, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=100, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=101, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=101, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=101, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=102, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=102, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=102, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=103, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=103, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=103, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=104, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=104, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=104, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=105, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=105, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=105, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=106, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=106, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=106, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=107, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=107, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=107, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=108, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=108, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=108, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=109, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=109, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=109, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=110, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=110, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=110, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=111, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=111, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=111, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=112, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=112, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=112, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=113, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=113, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=113, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=114, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=114, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=114, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=115, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=115, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=115, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=116, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=116, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=116, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=117, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=117, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=117, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=118, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=118, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=118, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=119, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=119, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=119, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=120, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=120, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=120, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=121, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=121, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=121, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=122, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=122, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=122, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=123, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=123, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=123, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=124, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=124, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=124, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=125, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=125, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=125, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=126, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=126, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=126, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=127, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=127, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=127, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=128, n=128] [L528] COND FALSE !(i < n) VAL [a={-3:0}, b={-2:4}, i=128, n=128] [L530] i = 0 VAL [a={-3:0}, b={-2:4}, i=0, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=0, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=0, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=1, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=1, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=1, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=2, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=2, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=2, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=3, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=3, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=3, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=4, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=4, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=4, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=5, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=5, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=5, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=6, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=6, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=6, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=7, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=7, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=7, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=8, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=8, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=8, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=9, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=9, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=9, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=10, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=10, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=10, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=11, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=11, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=11, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=12, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=12, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=12, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=13, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=13, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=13, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=14, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=14, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=14, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=15, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=15, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=15, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=16, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=16, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=16, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=17, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=17, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=17, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=18, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=18, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=18, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=19, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=19, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=19, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=20, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=20, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=20, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=21, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=21, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=21, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=22, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=22, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=22, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=23, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=23, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=23, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=24, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=24, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=24, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=25, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=25, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=25, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=26, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=26, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=26, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=27, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=27, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=27, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=28, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=28, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=28, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=29, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=29, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=29, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=30, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=30, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=30, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=31, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=31, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=31, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=32, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=32, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=32, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=33, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=33, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=33, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=34, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=34, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=34, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=35, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=35, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=35, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=36, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=36, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=36, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=37, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=37, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=37, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=38, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=38, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=38, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=39, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=39, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=39, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=40, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=40, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=40, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=41, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=41, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=41, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=42, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=42, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=42, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=43, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=43, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=43, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=44, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=44, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=44, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=45, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=45, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=45, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=46, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=46, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=46, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=47, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=47, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=47, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=48, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=48, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=48, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=49, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=49, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=49, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=50, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=50, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=50, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=51, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=51, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=51, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=52, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=52, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=52, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=53, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=53, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=53, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=54, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=54, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=54, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=55, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=55, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=55, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=56, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=56, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=56, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=57, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=57, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=57, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=58, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=58, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=58, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=59, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=59, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=59, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=60, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=60, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=60, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=61, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=61, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=61, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=62, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=62, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=62, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=63, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=63, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=63, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=64, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=64, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=64, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=65, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=65, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=65, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=66, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=66, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=66, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=67, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=67, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=67, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=68, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=68, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=68, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=69, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=69, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=69, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=70, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=70, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=70, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=71, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=71, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=71, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=72, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=72, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=72, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=73, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=73, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=73, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=74, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=74, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=74, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=75, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=75, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=75, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=76, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=76, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=76, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=77, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=77, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=77, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=78, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=78, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=78, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=79, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=79, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=79, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=80, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=80, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=80, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=81, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=81, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=81, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=82, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=82, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=82, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=83, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=83, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=83, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=84, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=84, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=84, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=85, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=85, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=85, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=86, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=86, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=86, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=87, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=87, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=87, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=88, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=88, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=88, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=89, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=89, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=89, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=90, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=90, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=90, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=91, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=91, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=91, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=92, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=92, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=92, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=93, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=93, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=93, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=94, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=94, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=94, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=95, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=95, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=95, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=96, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=96, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=96, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=97, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=97, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=97, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=98, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=98, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=98, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=99, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=99, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=99, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=100, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=100, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=100, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=101, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=101, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=101, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=102, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=102, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=102, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=103, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=103, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=103, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=104, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=104, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=104, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=105, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=105, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=105, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=106, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=106, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=106, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=107, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=107, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=107, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=108, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=108, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=108, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=109, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=109, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=109, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=110, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=110, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=110, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=111, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=111, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=111, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=112, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=112, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=112, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=113, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=113, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=113, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=114, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=114, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=114, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=115, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=115, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=115, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=116, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=116, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=116, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=117, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=117, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=117, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=118, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=118, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=118, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=119, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=119, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=119, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=120, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=120, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=120, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=121, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=121, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=121, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=122, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=122, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=122, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=123, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=123, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=123, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=124, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=124, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=124, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=125, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=125, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=125, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=126, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=126, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=126, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=127, n=128] [L530] COND FALSE !(i < 128 - 1) VAL [a={-3:0}, b={-2:4}, i=127, n=128] [L539] RET foo () [L540] b[-2] - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 529]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 529]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 60.6s, OverallIterations: 17, TraceHistogramMax: 128, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12920 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12920 mSDsluCounter, 1956 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1575 mSDsCounter, 3048 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5722 IncrementalHoareTripleChecker+Invalid, 8770 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3048 mSolverCounterUnsat, 381 mSDtfsCounter, 5722 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4260 GetRequests, 3259 SyntacticMatches, 2 SemanticMatches, 999 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55980 ImplicationChecksByTransitivity, 30.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=775occurred in iteration=16, InterpolantAutomatonStates: 533, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 1543 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 34.7s InterpolantComputationTime, 4896 NumberOfCodeBlocks, 4464 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 5687 ConstructedInterpolants, 0 QuantifiedInterpolants, 25312 SizeOfPredicates, 29 NumberOfNonLiveVariables, 6329 ConjunctsInSsa, 399 ConjunctsInUnsatCore, 34 InterpolantComputations, 8 PerfectInterpolantSequences, 106659/252270 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-15 14:00:56,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)