./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-regression/test25_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/ldv-regression/test25_false-unreach-call_true-termination.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 ef8f82b31b77c43c96cf1b9cfaef9c4e99ae1632 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0ed9222-m [2019-01-12 09:33:16,194 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:33:16,196 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:33:16,211 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:33:16,211 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:33:16,212 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:33:16,214 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:33:16,216 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:33:16,218 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:33:16,219 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:33:16,221 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:33:16,224 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:33:16,225 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:33:16,226 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:33:16,229 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:33:16,230 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:33:16,231 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:33:16,236 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:33:16,241 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:33:16,244 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:33:16,245 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:33:16,250 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:33:16,254 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:33:16,254 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:33:16,255 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:33:16,256 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:33:16,257 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:33:16,259 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:33:16,259 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:33:16,260 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:33:16,261 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:33:16,261 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:33:16,262 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:33:16,263 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:33:16,264 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:33:16,266 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:33:16,266 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:33:16,290 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:33:16,290 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:33:16,292 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:33:16,292 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:33:16,293 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:33:16,293 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:33:16,293 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:33:16,294 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:33:16,294 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:33:16,294 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:33:16,294 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:33:16,294 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:33:16,294 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:33:16,295 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:33:16,295 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:33:16,295 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:33:16,295 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:33:16,295 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:33:16,295 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:33:16,297 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:33:16,297 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:33:16,297 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:33:16,297 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:33:16,297 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:33:16,298 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:33:16,298 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:33:16,298 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:33:16,298 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:33:16,298 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> ef8f82b31b77c43c96cf1b9cfaef9c4e99ae1632 [2019-01-12 09:33:16,358 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:33:16,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:33:16,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:33:16,382 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:33:16,382 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:33:16,384 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/test25_false-unreach-call_true-termination.c [2019-01-12 09:33:16,452 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d890db6e2/e99ad53461dc4daeb991111ae327979d/FLAG45a9be542 [2019-01-12 09:33:16,882 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:33:16,883 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/test25_false-unreach-call_true-termination.c [2019-01-12 09:33:16,888 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d890db6e2/e99ad53461dc4daeb991111ae327979d/FLAG45a9be542 [2019-01-12 09:33:17,279 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d890db6e2/e99ad53461dc4daeb991111ae327979d [2019-01-12 09:33:17,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:33:17,284 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:33:17,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:33:17,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:33:17,289 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:33:17,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:33:17" (1/1) ... [2019-01-12 09:33:17,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60a29e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:17, skipping insertion in model container [2019-01-12 09:33:17,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:33:17" (1/1) ... [2019-01-12 09:33:17,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:33:17,323 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:33:17,525 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:33:17,541 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:33:17,566 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:33:17,584 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:33:17,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:17 WrapperNode [2019-01-12 09:33:17,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:33:17,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:33:17,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:33:17,586 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:33:17,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:17" (1/1) ... [2019-01-12 09:33:17,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:17" (1/1) ... [2019-01-12 09:33:17,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:33:17,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:33:17,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:33:17,624 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:33:17,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:17" (1/1) ... [2019-01-12 09:33:17,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:17" (1/1) ... [2019-01-12 09:33:17,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:17" (1/1) ... [2019-01-12 09:33:17,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:17" (1/1) ... [2019-01-12 09:33:17,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:17" (1/1) ... [2019-01-12 09:33:17,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:17" (1/1) ... [2019-01-12 09:33:17,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:17" (1/1) ... [2019-01-12 09:33:17,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:33:17,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:33:17,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:33:17,723 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:33:17,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:17" (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-01-12 09:33:17,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:33:17,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-12 09:33:17,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:33:17,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:33:17,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:33:17,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-12 09:33:17,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:33:17,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:33:18,194 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:33:18,194 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-12 09:33:18,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:33:18 BoogieIcfgContainer [2019-01-12 09:33:18,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:33:18,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:33:18,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:33:18,200 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:33:18,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:33:17" (1/3) ... [2019-01-12 09:33:18,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3678dedc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:33:18, skipping insertion in model container [2019-01-12 09:33:18,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:17" (2/3) ... [2019-01-12 09:33:18,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3678dedc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:33:18, skipping insertion in model container [2019-01-12 09:33:18,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:33:18" (3/3) ... [2019-01-12 09:33:18,206 INFO L112 eAbstractionObserver]: Analyzing ICFG test25_false-unreach-call_true-termination.c [2019-01-12 09:33:18,214 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:33:18,220 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:33:18,235 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:33:18,266 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:33:18,267 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:33:18,267 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:33:18,267 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:33:18,267 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:33:18,268 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:33:18,268 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:33:18,268 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:33:18,268 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:33:18,291 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-01-12 09:33:18,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:33:18,298 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:18,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:18,301 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:18,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:18,307 INFO L82 PathProgramCache]: Analyzing trace with hash -631347226, now seen corresponding path program 1 times [2019-01-12 09:33:18,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:18,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:18,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:18,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:18,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:18,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:33:18,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:33:18,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:33:18,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:33:18,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:33:18,461 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-01-12 09:33:18,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:18,476 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2019-01-12 09:33:18,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:33:18,477 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-12 09:33:18,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:18,487 INFO L225 Difference]: With dead ends: 30 [2019-01-12 09:33:18,487 INFO L226 Difference]: Without dead ends: 13 [2019-01-12 09:33:18,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:33:18,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-12 09:33:18,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-12 09:33:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-12 09:33:18,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-12 09:33:18,519 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-01-12 09:33:18,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:18,520 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-12 09:33:18,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:33:18,520 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-12 09:33:18,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 09:33:18,521 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:18,521 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:18,521 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:18,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:18,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1697064536, now seen corresponding path program 1 times [2019-01-12 09:33:18,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:18,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:18,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:18,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:18,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:18,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:18,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:33:18,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:33:18,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:33:18,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:33:18,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:33:18,628 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-01-12 09:33:18,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:18,728 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-01-12 09:33:18,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:33:18,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-12 09:33:18,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:18,729 INFO L225 Difference]: With dead ends: 24 [2019-01-12 09:33:18,729 INFO L226 Difference]: Without dead ends: 15 [2019-01-12 09:33:18,730 INFO L631 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-01-12 09:33:18,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-12 09:33:18,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-12 09:33:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 09:33:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-01-12 09:33:18,737 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2019-01-12 09:33:18,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:18,737 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-01-12 09:33:18,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:33:18,737 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-01-12 09:33:18,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 09:33:18,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:18,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:18,739 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:18,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:18,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1434190826, now seen corresponding path program 1 times [2019-01-12 09:33:18,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:18,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:18,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:18,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:18,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:18,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:18,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:18,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:18,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:18,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:19,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:19,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-12 09:33:19,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:33:19,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:33:19,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:33:19,061 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-01-12 09:33:19,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:19,163 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-01-12 09:33:19,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:33:19,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-12 09:33:19,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:19,165 INFO L225 Difference]: With dead ends: 26 [2019-01-12 09:33:19,165 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 09:33:19,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:33:19,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 09:33:19,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-12 09:33:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-12 09:33:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-01-12 09:33:19,170 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2019-01-12 09:33:19,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:19,170 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-01-12 09:33:19,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:33:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-01-12 09:33:19,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:33:19,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:19,171 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:19,171 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:19,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:19,172 INFO L82 PathProgramCache]: Analyzing trace with hash 201480788, now seen corresponding path program 2 times [2019-01-12 09:33:19,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:19,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:19,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:19,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:19,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:19,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:19,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:19,314 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:19,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 09:33:19,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-12 09:33:19,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:19,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:19,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-12 09:33:19,689 INFO L478 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 13 treesize of output 9 [2019-01-12 09:33:19,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:19,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:19,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:19,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-01-12 09:33:19,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 09:33:19,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 09:33:19,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-01-12 09:33:19,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 09:33:19,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 09:33:19,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:33:19,755 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 8 states. [2019-01-12 09:33:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:19,960 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-01-12 09:33:19,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 09:33:19,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-12 09:33:19,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:19,962 INFO L225 Difference]: With dead ends: 30 [2019-01-12 09:33:19,962 INFO L226 Difference]: Without dead ends: 21 [2019-01-12 09:33:19,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:33:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-12 09:33:19,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-12 09:33:19,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-12 09:33:19,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-12 09:33:19,967 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 15 [2019-01-12 09:33:19,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:19,967 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-12 09:33:19,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 09:33:19,968 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-12 09:33:19,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 09:33:19,968 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:19,969 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:19,969 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:19,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:19,969 INFO L82 PathProgramCache]: Analyzing trace with hash 291228695, now seen corresponding path program 1 times [2019-01-12 09:33:19,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:19,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:19,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:19,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:19,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 09:33:20,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:20,159 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:20,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:20,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:20,337 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 09:33:20,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:20,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-12 09:33:20,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:33:20,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:33:20,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:33:20,370 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 7 states. [2019-01-12 09:33:20,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:20,588 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-01-12 09:33:20,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:33:20,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-01-12 09:33:20,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:20,592 INFO L225 Difference]: With dead ends: 34 [2019-01-12 09:33:20,592 INFO L226 Difference]: Without dead ends: 23 [2019-01-12 09:33:20,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:33:20,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-12 09:33:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-12 09:33:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-12 09:33:20,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-01-12 09:33:20,597 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2019-01-12 09:33:20,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:20,598 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-01-12 09:33:20,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:33:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-01-12 09:33:20,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 09:33:20,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:20,600 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:20,600 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:20,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:20,601 INFO L82 PathProgramCache]: Analyzing trace with hash 903742421, now seen corresponding path program 2 times [2019-01-12 09:33:20,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:20,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:20,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:20,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:20,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:20,902 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 09:33:20,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:20,903 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:20,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 09:33:20,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 09:33:20,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:20,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:21,095 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 09:33:21,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:21,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-12 09:33:21,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 09:33:21,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 09:33:21,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:33:21,135 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 8 states. [2019-01-12 09:33:21,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:21,301 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-01-12 09:33:21,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:33:21,303 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-01-12 09:33:21,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:21,304 INFO L225 Difference]: With dead ends: 36 [2019-01-12 09:33:21,305 INFO L226 Difference]: Without dead ends: 25 [2019-01-12 09:33:21,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:33:21,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-12 09:33:21,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-01-12 09:33:21,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-12 09:33:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-01-12 09:33:21,310 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 21 [2019-01-12 09:33:21,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:21,312 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-01-12 09:33:21,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 09:33:21,312 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-12 09:33:21,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 09:33:21,314 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:21,314 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:21,314 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:21,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:21,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1118913555, now seen corresponding path program 3 times [2019-01-12 09:33:21,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:21,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:21,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:21,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:21,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 09:33:21,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:21,797 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:21,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 09:33:21,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-12 09:33:21,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:21,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:22,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-12 09:33:22,007 INFO L478 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 13 treesize of output 9 [2019-01-12 09:33:22,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:22,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:22,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:22,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-01-12 09:33:22,032 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-12 09:33:22,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:22,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-01-12 09:33:22,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 09:33:22,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 09:33:22,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-12 09:33:22,061 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2019-01-12 09:33:22,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:22,326 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-01-12 09:33:22,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 09:33:22,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-01-12 09:33:22,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:22,328 INFO L225 Difference]: With dead ends: 40 [2019-01-12 09:33:22,328 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 09:33:22,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-01-12 09:33:22,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 09:33:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-01-12 09:33:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:33:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-01-12 09:33:22,335 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 23 [2019-01-12 09:33:22,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:22,335 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-01-12 09:33:22,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 09:33:22,335 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-01-12 09:33:22,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 09:33:22,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:22,336 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:22,337 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:22,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:22,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1442110442, now seen corresponding path program 4 times [2019-01-12 09:33:22,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:22,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:22,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:22,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:22,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 09:33:22,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:22,489 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:22,505 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 09:33:22,531 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 09:33:22,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:22,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:22,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-12 09:33:22,663 INFO L478 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 13 treesize of output 9 [2019-01-12 09:33:22,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:22,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:22,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:22,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-01-12 09:33:22,683 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-12 09:33:22,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:22,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-01-12 09:33:22,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 09:33:22,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 09:33:22,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-12 09:33:22,705 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 14 states. [2019-01-12 09:33:22,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:22,943 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-01-12 09:33:22,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 09:33:22,944 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-01-12 09:33:22,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:22,946 INFO L225 Difference]: With dead ends: 46 [2019-01-12 09:33:22,946 INFO L226 Difference]: Without dead ends: 33 [2019-01-12 09:33:22,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-01-12 09:33:22,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-12 09:33:22,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-01-12 09:33:22,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 09:33:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-12 09:33:22,952 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 27 [2019-01-12 09:33:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:22,953 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-12 09:33:22,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 09:33:22,953 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-12 09:33:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 09:33:22,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:22,954 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:22,954 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:22,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:22,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1005994073, now seen corresponding path program 5 times [2019-01-12 09:33:22,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:22,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:22,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:22,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:22,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-12 09:33:23,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:23,232 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:23,243 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 09:33:25,543 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-01-12 09:33:25,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:25,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-12 09:33:25,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:25,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-12 09:33:25,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 09:33:25,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 09:33:25,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:33:25,614 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 11 states. [2019-01-12 09:33:25,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:25,688 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-01-12 09:33:25,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 09:33:25,689 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2019-01-12 09:33:25,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:25,690 INFO L225 Difference]: With dead ends: 50 [2019-01-12 09:33:25,690 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 09:33:25,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:33:25,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 09:33:25,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-01-12 09:33:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-12 09:33:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-01-12 09:33:25,698 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 31 [2019-01-12 09:33:25,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:25,698 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-01-12 09:33:25,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 09:33:25,698 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-01-12 09:33:25,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 09:33:25,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:25,699 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:25,702 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:25,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:25,702 INFO L82 PathProgramCache]: Analyzing trace with hash -652424425, now seen corresponding path program 6 times [2019-01-12 09:33:25,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:25,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:25,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:25,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:25,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:26,020 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-12 09:33:26,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:26,020 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:26,032 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 09:33:27,893 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-12 09:33:27,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:27,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:28,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-12 09:33:28,046 INFO L478 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 13 treesize of output 9 [2019-01-12 09:33:28,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:28,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:28,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:28,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-01-12 09:33:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 09:33:28,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:28,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-01-12 09:33:28,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 09:33:28,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 09:33:28,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-01-12 09:33:28,106 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 17 states. [2019-01-12 09:33:28,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:28,333 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-01-12 09:33:28,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 09:33:28,334 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2019-01-12 09:33:28,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:28,335 INFO L225 Difference]: With dead ends: 54 [2019-01-12 09:33:28,335 INFO L226 Difference]: Without dead ends: 39 [2019-01-12 09:33:28,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2019-01-12 09:33:28,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-12 09:33:28,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-01-12 09:33:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-12 09:33:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-12 09:33:28,340 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 33 [2019-01-12 09:33:28,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:28,341 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-12 09:33:28,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 09:33:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-12 09:33:28,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 09:33:28,342 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:28,342 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:28,342 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:28,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:28,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1671756646, now seen corresponding path program 7 times [2019-01-12 09:33:28,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:28,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:28,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:28,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:28,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:28,595 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-12 09:33:28,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:28,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:28,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:28,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:28,668 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-12 09:33:28,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:28,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-12 09:33:28,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 09:33:28,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 09:33:28,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-12 09:33:28,691 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 13 states. [2019-01-12 09:33:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:28,784 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-01-12 09:33:28,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 09:33:28,785 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2019-01-12 09:33:28,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:28,786 INFO L225 Difference]: With dead ends: 57 [2019-01-12 09:33:28,786 INFO L226 Difference]: Without dead ends: 40 [2019-01-12 09:33:28,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-12 09:33:28,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-12 09:33:28,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-12 09:33:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-12 09:33:28,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-01-12 09:33:28,794 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 37 [2019-01-12 09:33:28,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:28,794 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-01-12 09:33:28,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 09:33:28,795 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-01-12 09:33:28,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 09:33:28,795 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:28,796 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:28,796 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:28,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:28,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1546516264, now seen corresponding path program 8 times [2019-01-12 09:33:28,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:28,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:28,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:28,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:28,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:29,996 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 9 [2019-01-12 09:33:30,294 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 20 [2019-01-12 09:33:30,602 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 12 [2019-01-12 09:33:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-12 09:33:30,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:30,752 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:30,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 09:33:30,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 09:33:30,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:30,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:31,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-01-12 09:33:31,699 INFO L478 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 21 treesize of output 9 [2019-01-12 09:33:31,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:31,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:31,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:31,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2019-01-12 09:33:31,719 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 09:33:31,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:31,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 27 [2019-01-12 09:33:31,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-12 09:33:31,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-12 09:33:31,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2019-01-12 09:33:31,740 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 27 states. [2019-01-12 09:33:32,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:32,825 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-01-12 09:33:32,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 09:33:32,826 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 39 [2019-01-12 09:33:32,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:32,828 INFO L225 Difference]: With dead ends: 47 [2019-01-12 09:33:32,828 INFO L226 Difference]: Without dead ends: 42 [2019-01-12 09:33:32,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=279, Invalid=1127, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 09:33:32,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-12 09:33:32,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-12 09:33:32,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-12 09:33:32,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-01-12 09:33:32,836 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2019-01-12 09:33:32,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:32,837 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-01-12 09:33:32,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-12 09:33:32,837 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-01-12 09:33:32,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-12 09:33:32,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:32,838 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:32,838 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:32,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:32,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1366350429, now seen corresponding path program 9 times [2019-01-12 09:33:32,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:32,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:32,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:32,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:32,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:33,735 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2019-01-12 09:33:34,026 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 20 [2019-01-12 09:33:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-01-12 09:33:34,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:34,258 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:34,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 09:33:34,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-12 09:33:34,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:34,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:34,818 INFO L478 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 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-12 09:33:34,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2019-01-12 09:33:34,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:34,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:34,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:34,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:12 [2019-01-12 09:33:34,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-12 09:33:34,956 INFO L478 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 13 treesize of output 9 [2019-01-12 09:33:34,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:34,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:35,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:35,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-01-12 09:33:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 09:33:35,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:35,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2019-01-12 09:33:35,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 09:33:35,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 09:33:35,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-01-12 09:33:35,072 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 21 states. [2019-01-12 09:33:35,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:35,511 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2019-01-12 09:33:35,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-12 09:33:35,512 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2019-01-12 09:33:35,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:35,513 INFO L225 Difference]: With dead ends: 57 [2019-01-12 09:33:35,513 INFO L226 Difference]: Without dead ends: 52 [2019-01-12 09:33:35,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=493, Invalid=1229, Unknown=0, NotChecked=0, Total=1722 [2019-01-12 09:33:35,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-12 09:33:35,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-12 09:33:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-12 09:33:35,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-01-12 09:33:35,524 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 41 [2019-01-12 09:33:35,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:35,524 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-01-12 09:33:35,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 09:33:35,524 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-01-12 09:33:35,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 09:33:35,525 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:35,525 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:35,525 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:35,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:35,528 INFO L82 PathProgramCache]: Analyzing trace with hash 562473782, now seen corresponding path program 10 times [2019-01-12 09:33:35,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:35,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:35,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:35,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:35,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:33:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:33:35,927 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:33:35,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:33:35 BoogieIcfgContainer [2019-01-12 09:33:35,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:33:35,983 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:33:35,983 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:33:35,983 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:33:35,984 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:33:18" (3/4) ... [2019-01-12 09:33:35,989 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 09:33:36,078 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:33:36,083 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:33:36,085 INFO L168 Benchmark]: Toolchain (without parser) took 18801.38 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 283.1 MB). Free memory was 952.7 MB in the beginning and 932.0 MB in the end (delta: 20.7 MB). Peak memory consumption was 303.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:33:36,086 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:33:36,086 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.87 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:33:36,086 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.37 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:33:36,093 INFO L168 Benchmark]: Boogie Preprocessor took 96.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -179.5 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:33:36,094 INFO L168 Benchmark]: RCFGBuilder took 475.07 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: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:33:36,094 INFO L168 Benchmark]: TraceAbstraction took 17786.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.0 MB). Free memory was 1.1 GB in the beginning and 940.9 MB in the end (delta: 147.9 MB). Peak memory consumption was 309.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:33:36,094 INFO L168 Benchmark]: Witness Printer took 100.07 ms. Allocated memory is still 1.3 GB. Free memory was 940.9 MB in the beginning and 932.0 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:33:36,104 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 299.87 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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 38.37 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 96.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -179.5 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 475.07 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: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17786.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.0 MB). Free memory was 1.1 GB in the beginning and 940.9 MB in the end (delta: 147.9 MB). Peak memory consumption was 309.9 MB. Max. memory is 11.5 GB. * Witness Printer took 100.07 ms. Allocated memory is still 1.3 GB. Free memory was 940.9 MB in the beginning and 932.0 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 45]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L19] struct cont cont; [L20] struct dummy array[10]; [L21] int i, *pa; [L22] i = __VERIFIER_nondet_int() [L24] int j = 0; [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ [L24] COND FALSE !(j < 10) [L29] COND TRUE i >= 0 && i < 9 [L30] cont.array = &array[i] [L31] EXPR cont.array [L31] pa = &cont.array[0].b [L32] EXPR cont.array [L32] EXPR cont.array[0].b [L32] COND TRUE cont.array[0].b > 0 [L33] EXPR array[i].b [L33] i = array[i].b - 10 [L34] EXPR \read(*pa) [L34] COND TRUE i < *pa [L35] ++i [L34] EXPR \read(*pa) [L34] COND TRUE i < *pa [L35] ++i [L34] EXPR \read(*pa) [L34] COND TRUE i < *pa [L35] ++i [L34] EXPR \read(*pa) [L34] COND TRUE i < *pa [L35] ++i [L34] EXPR \read(*pa) [L34] COND TRUE i < *pa [L35] ++i [L34] EXPR \read(*pa) [L34] COND TRUE i < *pa [L35] ++i [L34] EXPR \read(*pa) [L34] COND TRUE i < *pa [L35] ++i [L34] EXPR \read(*pa) [L34] COND TRUE i < *pa [L35] ++i [L34] EXPR \read(*pa) [L34] COND TRUE i < *pa [L35] ++i [L34] EXPR \read(*pa) [L34] COND TRUE i < *pa [L35] ++i [L34] EXPR \read(*pa) [L34] COND FALSE !(i < *pa) [L14] EXPR pc->array [L14] EXPR pc->array[1].b [L14] return pc->array[1].b == i; [L37] COND TRUE !check(&cont, i) [L45] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. UNSAFE Result, 17.7s OverallTime, 14 OverallIterations, 11 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 145 SDtfs, 114 SDslu, 702 SDs, 0 SdLazy, 962 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 456 GetRequests, 283 SyntacticMatches, 9 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 5.9s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 670 NumberOfCodeBlocks, 635 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 595 ConstructedInterpolants, 9 QuantifiedInterpolants, 59501 SizeOfPredicates, 71 NumberOfNonLiveVariables, 1416 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 397/1182 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...