./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/invert_string-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/invert_string-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4335483d0b28de4d854f33f949d3555a767d1bde ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:58:59,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:58:59,742 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:58:59,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:58:59,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:58:59,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:58:59,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:58:59,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:58:59,780 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:58:59,781 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:58:59,782 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:58:59,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:58:59,783 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:58:59,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:58:59,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:58:59,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:58:59,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:58:59,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:58:59,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:58:59,791 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:58:59,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:58:59,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:58:59,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:58:59,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:58:59,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:58:59,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:58:59,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:58:59,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:58:59,800 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:58:59,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:58:59,801 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:58:59,802 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:58:59,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:58:59,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:58:59,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:58:59,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:58:59,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:58:59,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:58:59,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:58:59,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:58:59,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:58:59,809 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:58:59,823 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:58:59,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:58:59,824 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:58:59,825 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:58:59,825 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:58:59,825 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:58:59,826 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:58:59,826 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:58:59,826 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:58:59,826 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:58:59,827 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:58:59,827 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:58:59,827 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:58:59,827 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:58:59,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:58:59,831 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:58:59,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:58:59,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:58:59,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:58:59,832 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:58:59,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:58:59,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:58:59,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:58:59,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:58:59,833 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:58:59,833 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:58:59,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:58:59,834 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:58:59,834 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4335483d0b28de4d854f33f949d3555a767d1bde [2019-11-27 23:59:00,135 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:59:00,147 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:59:00,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:59:00,152 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:59:00,153 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:59:00,153 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/invert_string-1.c [2019-11-27 23:59:00,215 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13763d25d/5899bb436eed4da29f5824b75cb4f1dd/FLAG93810b81a [2019-11-27 23:59:00,657 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:59:00,658 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/invert_string-1.c [2019-11-27 23:59:00,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13763d25d/5899bb436eed4da29f5824b75cb4f1dd/FLAG93810b81a [2019-11-27 23:59:01,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13763d25d/5899bb436eed4da29f5824b75cb4f1dd [2019-11-27 23:59:01,033 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:59:01,035 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:59:01,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:59:01,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:59:01,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:59:01,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:59:01" (1/1) ... [2019-11-27 23:59:01,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f061439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:01, skipping insertion in model container [2019-11-27 23:59:01,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:59:01" (1/1) ... [2019-11-27 23:59:01,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:59:01,068 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:59:01,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:59:01,261 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:59:01,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:59:01,311 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:59:01,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:01 WrapperNode [2019-11-27 23:59:01,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:59:01,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:59:01,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:59:01,313 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:59:01,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:01" (1/1) ... [2019-11-27 23:59:01,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:01" (1/1) ... [2019-11-27 23:59:01,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:59:01,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:59:01,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:59:01,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:59:01,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:01" (1/1) ... [2019-11-27 23:59:01,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:01" (1/1) ... [2019-11-27 23:59:01,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:01" (1/1) ... [2019-11-27 23:59:01,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:01" (1/1) ... [2019-11-27 23:59:01,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:01" (1/1) ... [2019-11-27 23:59:01,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:01" (1/1) ... [2019-11-27 23:59:01,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:01" (1/1) ... [2019-11-27 23:59:01,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:59:01,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:59:01,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:59:01,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:59:01,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:59:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 23:59:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:59:01,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:59:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 23:59:01,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:59:01,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:59:01,727 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:59:01,727 INFO L297 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-27 23:59:01,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:59:01 BoogieIcfgContainer [2019-11-27 23:59:01,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:59:01,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:59:01,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:59:01,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:59:01,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:59:01" (1/3) ... [2019-11-27 23:59:01,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbfde4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:59:01, skipping insertion in model container [2019-11-27 23:59:01,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:59:01" (2/3) ... [2019-11-27 23:59:01,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbfde4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:59:01, skipping insertion in model container [2019-11-27 23:59:01,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:59:01" (3/3) ... [2019-11-27 23:59:01,739 INFO L109 eAbstractionObserver]: Analyzing ICFG invert_string-1.c [2019-11-27 23:59:01,755 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:59:01,763 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:59:01,778 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:59:01,807 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:59:01,808 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:59:01,808 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:59:01,808 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:59:01,808 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:59:01,808 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:59:01,808 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:59:01,809 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:59:01,823 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-11-27 23:59:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-27 23:59:01,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:01,831 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:01,831 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:01,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:01,838 INFO L82 PathProgramCache]: Analyzing trace with hash -2016449835, now seen corresponding path program 1 times [2019-11-27 23:59:01,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:59:01,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251572005] [2019-11-27 23:59:01,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:59:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:59:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:59:02,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251572005] [2019-11-27 23:59:02,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:59:02,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:59:02,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864954910] [2019-11-27 23:59:02,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:59:02,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:59:02,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:59:02,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:59:02,044 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2019-11-27 23:59:02,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:59:02,138 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-11-27 23:59:02,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:59:02,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-27 23:59:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:59:02,148 INFO L225 Difference]: With dead ends: 33 [2019-11-27 23:59:02,148 INFO L226 Difference]: Without dead ends: 15 [2019-11-27 23:59:02,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:59:02,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-27 23:59:02,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-27 23:59:02,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-27 23:59:02,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-27 23:59:02,179 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2019-11-27 23:59:02,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:59:02,179 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-27 23:59:02,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:59:02,180 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-11-27 23:59:02,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-27 23:59:02,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:02,180 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:02,181 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:02,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:02,181 INFO L82 PathProgramCache]: Analyzing trace with hash 867342291, now seen corresponding path program 1 times [2019-11-27 23:59:02,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:59:02,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333000279] [2019-11-27 23:59:02,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:59:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:59:02,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:59:02,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333000279] [2019-11-27 23:59:02,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:59:02,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:59:02,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153008303] [2019-11-27 23:59:02,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:59:02,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:59:02,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:59:02,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:59:02,250 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 3 states. [2019-11-27 23:59:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:59:02,283 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-11-27 23:59:02,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:59:02,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-27 23:59:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:59:02,285 INFO L225 Difference]: With dead ends: 28 [2019-11-27 23:59:02,285 INFO L226 Difference]: Without dead ends: 17 [2019-11-27 23:59:02,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:59:02,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-27 23:59:02,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-27 23:59:02,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-27 23:59:02,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-11-27 23:59:02,291 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2019-11-27 23:59:02,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:59:02,291 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-11-27 23:59:02,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:59:02,291 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-11-27 23:59:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-27 23:59:02,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:02,292 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:02,292 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:02,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:02,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2031054225, now seen corresponding path program 1 times [2019-11-27 23:59:02,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:59:02,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4771357] [2019-11-27 23:59:02,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:59:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:59:02,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:59:02,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4771357] [2019-11-27 23:59:02,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118909611] [2019-11-27 23:59:02,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:59:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:59:02,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-27 23:59:02,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:59:02,996 INFO L377 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 [2019-11-27 23:59:03,001 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:59:03,015 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:59:03,016 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:59:03,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-11-27 23:59:03,138 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2019-11-27 23:59:03,139 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:59:03,149 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:59:03,149 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:59:03,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-27 23:59:03,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:59:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:59:03,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:59:03,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-27 23:59:03,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569686544] [2019-11-27 23:59:03,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-27 23:59:03,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:59:03,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-27 23:59:03,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-27 23:59:03,252 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 16 states. [2019-11-27 23:59:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:59:04,000 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-11-27 23:59:04,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-27 23:59:04,001 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2019-11-27 23:59:04,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:59:04,002 INFO L225 Difference]: With dead ends: 38 [2019-11-27 23:59:04,002 INFO L226 Difference]: Without dead ends: 36 [2019-11-27 23:59:04,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=194, Invalid=508, Unknown=0, NotChecked=0, Total=702 [2019-11-27 23:59:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-27 23:59:04,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 25. [2019-11-27 23:59:04,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-27 23:59:04,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-11-27 23:59:04,014 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 13 [2019-11-27 23:59:04,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:59:04,015 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-27 23:59:04,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-27 23:59:04,015 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-11-27 23:59:04,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 23:59:04,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:04,017 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:04,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:59:04,222 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:04,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:04,223 INFO L82 PathProgramCache]: Analyzing trace with hash -628241457, now seen corresponding path program 2 times [2019-11-27 23:59:04,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:59:04,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852636281] [2019-11-27 23:59:04,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:59:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:59:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:59:04,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852636281] [2019-11-27 23:59:04,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772002563] [2019-11-27 23:59:04,325 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:59:04,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 23:59:04,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:59:04,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 23:59:04,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:59:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:59:04,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:59:04,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-11-27 23:59:04,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402229642] [2019-11-27 23:59:04,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:59:04,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:59:04,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:59:04,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:59:04,389 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 6 states. [2019-11-27 23:59:04,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:59:04,499 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-11-27 23:59:04,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 23:59:04,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-27 23:59:04,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:59:04,500 INFO L225 Difference]: With dead ends: 43 [2019-11-27 23:59:04,500 INFO L226 Difference]: Without dead ends: 36 [2019-11-27 23:59:04,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:59:04,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-27 23:59:04,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-11-27 23:59:04,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-27 23:59:04,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-27 23:59:04,508 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 15 [2019-11-27 23:59:04,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:59:04,509 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-27 23:59:04,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:59:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-11-27 23:59:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 23:59:04,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:04,510 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:04,714 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:59:04,714 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:04,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:04,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1786824679, now seen corresponding path program 1 times [2019-11-27 23:59:04,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:59:04,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677347280] [2019-11-27 23:59:04,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:59:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:59:04,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:59:04,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677347280] [2019-11-27 23:59:04,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534313918] [2019-11-27 23:59:04,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:59:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:59:04,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 23:59:04,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:59:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:59:04,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:59:04,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-11-27 23:59:04,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548222011] [2019-11-27 23:59:04,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 23:59:04,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:59:04,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 23:59:04,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-11-27 23:59:04,893 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 11 states. [2019-11-27 23:59:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:59:05,057 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-11-27 23:59:05,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 23:59:05,057 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-11-27 23:59:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:59:05,058 INFO L225 Difference]: With dead ends: 50 [2019-11-27 23:59:05,059 INFO L226 Difference]: Without dead ends: 34 [2019-11-27 23:59:05,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-11-27 23:59:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-27 23:59:05,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2019-11-27 23:59:05,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-27 23:59:05,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-11-27 23:59:05,064 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2019-11-27 23:59:05,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:59:05,064 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-27 23:59:05,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 23:59:05,064 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-11-27 23:59:05,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 23:59:05,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:05,065 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:05,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:59:05,269 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:05,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:05,270 INFO L82 PathProgramCache]: Analyzing trace with hash -799235507, now seen corresponding path program 3 times [2019-11-27 23:59:05,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:59:05,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383944463] [2019-11-27 23:59:05,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:59:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:59:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:59:05,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383944463] [2019-11-27 23:59:05,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91680895] [2019-11-27 23:59:05,863 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:59:05,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-27 23:59:05,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:59:05,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-27 23:59:05,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:59:05,934 INFO L377 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 [2019-11-27 23:59:05,935 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:59:05,943 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:59:05,943 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:59:05,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-11-27 23:59:06,130 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2019-11-27 23:59:06,131 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:59:06,140 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:59:06,141 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:59:06,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-27 23:59:06,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:59:06,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:59:06,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:59:06,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-27 23:59:06,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686663050] [2019-11-27 23:59:06,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-27 23:59:06,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:59:06,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-27 23:59:06,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-11-27 23:59:06,235 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 22 states. [2019-11-27 23:59:07,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:59:07,398 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-11-27 23:59:07,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-27 23:59:07,398 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 17 [2019-11-27 23:59:07,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:59:07,399 INFO L225 Difference]: With dead ends: 50 [2019-11-27 23:59:07,399 INFO L226 Difference]: Without dead ends: 48 [2019-11-27 23:59:07,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=336, Invalid=1224, Unknown=0, NotChecked=0, Total=1560 [2019-11-27 23:59:07,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-27 23:59:07,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2019-11-27 23:59:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-27 23:59:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-27 23:59:07,409 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 17 [2019-11-27 23:59:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:59:07,409 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-27 23:59:07,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-27 23:59:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-11-27 23:59:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 23:59:07,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:07,411 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:07,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:59:07,614 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:07,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:07,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1927655819, now seen corresponding path program 4 times [2019-11-27 23:59:07,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:59:07,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691760488] [2019-11-27 23:59:07,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:59:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:59:07,685 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:59:07,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691760488] [2019-11-27 23:59:07,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971074624] [2019-11-27 23:59:07,686 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:59:07,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-27 23:59:07,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:59:07,725 WARN L253 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-27 23:59:07,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:59:07,753 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-27 23:59:07,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2019-11-27 23:59:07,755 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:59:07,762 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:59:07,762 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:59:07,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-27 23:59:07,851 INFO L343 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2019-11-27 23:59:07,852 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 27 [2019-11-27 23:59:07,853 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:59:07,868 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:59:07,868 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:59:07,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:35 [2019-11-27 23:59:07,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:59:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-27 23:59:07,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:59:07,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2019-11-27 23:59:07,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247249785] [2019-11-27 23:59:07,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-27 23:59:07,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:59:07,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-27 23:59:07,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-27 23:59:07,992 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 15 states. [2019-11-27 23:59:08,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:59:08,836 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2019-11-27 23:59:08,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-27 23:59:08,836 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2019-11-27 23:59:08,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:59:08,838 INFO L225 Difference]: With dead ends: 77 [2019-11-27 23:59:08,838 INFO L226 Difference]: Without dead ends: 67 [2019-11-27 23:59:08,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=874, Unknown=0, NotChecked=0, Total=1056 [2019-11-27 23:59:08,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-27 23:59:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 42. [2019-11-27 23:59:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-27 23:59:08,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-11-27 23:59:08,852 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 19 [2019-11-27 23:59:08,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:59:08,852 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-11-27 23:59:08,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-27 23:59:08,853 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-11-27 23:59:08,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 23:59:08,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:59:08,854 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:59:09,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:59:09,058 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:59:09,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:59:09,058 INFO L82 PathProgramCache]: Analyzing trace with hash 980237987, now seen corresponding path program 2 times [2019-11-27 23:59:09,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:59:09,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944006785] [2019-11-27 23:59:09,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:59:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:59:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:59:09,134 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:59:09,134 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:59:09,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:59:09 BoogieIcfgContainer [2019-11-27 23:59:09,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:59:09,190 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:59:09,190 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:59:09,191 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:59:09,191 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:59:01" (3/4) ... [2019-11-27 23:59:09,193 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 23:59:09,264 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:59:09,264 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:59:09,266 INFO L168 Benchmark]: Toolchain (without parser) took 8231.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 270.5 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -146.8 MB). Peak memory consumption was 123.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:59:09,266 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:59:09,266 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.68 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:59:09,267 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -189.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:59:09,268 INFO L168 Benchmark]: Boogie Preprocessor took 23.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:59:09,268 INFO L168 Benchmark]: RCFGBuilder took 300.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:59:09,269 INFO L168 Benchmark]: TraceAbstraction took 7459.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 127.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.8 MB). Peak memory consumption was 120.1 MB. Max. memory is 11.5 GB. [2019-11-27 23:59:09,270 INFO L168 Benchmark]: Witness Printer took 73.79 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:59:09,273 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 276.68 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -189.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 300.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7459.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 127.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.8 MB). Peak memory consumption was 120.1 MB. Max. memory is 11.5 GB. * Witness Printer took 73.79 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int MAX = __VERIFIER_nondet_uint(); [L16] char str1[MAX], str2[MAX]; [L17] int cont, i, j; [L18] cont = 0 [L20] i=0 [L20] COND TRUE i= 0 [L28] EXPR str1[0] [L28] str2[j] = str1[0] [L29] j++ [L27] i-- [L27] COND TRUE i >= 0 [L28] EXPR str1[0] [L28] str2[j] = str1[0] [L29] j++ [L27] i-- [L27] COND FALSE !(i >= 0) [L32] j = MAX-1 [L33] i=0 [L33] COND TRUE i