./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-regression/test24_false-unreach-call.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/test24_false-unreach-call.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 45294379b83c6b60e0b0199955cdf7244f057430 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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,019 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:33:16,021 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:33:16,034 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:33:16,034 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:33:16,035 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:33:16,037 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:33:16,039 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:33:16,040 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:33:16,041 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:33:16,042 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:33:16,042 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:33:16,043 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:33:16,044 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:33:16,045 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:33:16,046 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:33:16,047 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:33:16,049 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:33:16,051 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:33:16,053 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:33:16,054 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:33:16,055 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:33:16,058 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:33:16,058 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:33:16,058 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:33:16,059 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:33:16,060 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:33:16,061 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:33:16,062 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:33:16,063 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:33:16,063 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:33:16,064 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:33:16,064 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:33:16,064 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:33:16,065 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:33:16,066 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:33:16,066 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,102 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:33:16,102 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:33:16,103 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:33:16,104 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:33:16,104 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:33:16,105 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:33:16,105 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:33:16,105 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:33:16,105 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:33:16,105 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:33:16,105 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:33:16,106 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:33:16,106 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:33:16,106 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:33:16,106 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:33:16,106 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:33:16,107 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:33:16,108 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:33:16,108 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:33:16,108 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:33:16,109 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:33:16,109 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:33:16,109 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:33:16,109 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:33:16,109 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:33:16,110 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:33:16,110 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:33:16,110 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:33:16,110 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 -> 45294379b83c6b60e0b0199955cdf7244f057430 [2019-01-12 09:33:16,177 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:33:16,193 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:33:16,200 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:33:16,201 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:33:16,202 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:33:16,202 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/test24_false-unreach-call.c [2019-01-12 09:33:16,264 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9dcf20ef/c2c33ff4145c4a87bad75a92e9bee059/FLAGa5070b633 [2019-01-12 09:33:16,721 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:33:16,722 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/test24_false-unreach-call.c [2019-01-12 09:33:16,729 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9dcf20ef/c2c33ff4145c4a87bad75a92e9bee059/FLAGa5070b633 [2019-01-12 09:33:17,072 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9dcf20ef/c2c33ff4145c4a87bad75a92e9bee059 [2019-01-12 09:33:17,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:33:17,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:33:17,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:33:17,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:33:17,082 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:33:17,084 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,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b8e77f 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,087 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,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:33:17,113 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:33:17,299 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:33:17,313 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:33:17,354 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:33:17,380 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:33:17,381 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,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:33:17,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:33:17,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:33:17,382 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:33:17,393 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,408 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,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:33:17,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:33:17,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:33:17,441 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:33:17,454 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,454 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,457 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,457 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,464 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,478 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,481 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,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:33:17,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:33:17,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:33:17,491 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:33:17,492 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,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:33:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:33:17,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:33:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:33:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:33:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:33:18,068 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:33:18,068 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-12 09:33:18,069 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,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:33:18,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:33:18,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:33:18,076 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:33:18,077 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,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3faa84 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,080 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,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3faa84 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,081 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,084 INFO L112 eAbstractionObserver]: Analyzing ICFG test24_false-unreach-call.c [2019-01-12 09:33:18,096 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:33:18,107 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:33:18,121 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:33:18,149 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:33:18,150 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:33:18,150 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:33:18,150 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:33:18,151 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:33:18,151 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:33:18,151 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:33:18,151 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:33:18,151 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:33:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-01-12 09:33:18,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:33:18,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:18,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:18,173 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:18,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:18,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1829445793, now seen corresponding path program 1 times [2019-01-12 09:33:18,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:18,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:18,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:18,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:18,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:18,305 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,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:33:18,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:33:18,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:33:18,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:33:18,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:33:18,328 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-01-12 09:33:18,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:18,345 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2019-01-12 09:33:18,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:33:18,347 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-12 09:33:18,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:18,357 INFO L225 Difference]: With dead ends: 30 [2019-01-12 09:33:18,357 INFO L226 Difference]: Without dead ends: 13 [2019-01-12 09:33:18,361 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,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-12 09:33:18,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-12 09:33:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-12 09:33:18,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-12 09:33:18,394 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-01-12 09:33:18,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:18,394 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-12 09:33:18,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:33:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-12 09:33:18,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 09:33:18,395 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:18,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:18,395 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:18,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:18,396 INFO L82 PathProgramCache]: Analyzing trace with hash 672236885, now seen corresponding path program 1 times [2019-01-12 09:33:18,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:18,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:18,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:18,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:18,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:18,499 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,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:33:18,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:33:18,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:33:18,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:33:18,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:33:18,503 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-01-12 09:33:18,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:18,539 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-01-12 09:33:18,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:33:18,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-12 09:33:18,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:18,541 INFO L225 Difference]: With dead ends: 24 [2019-01-12 09:33:18,541 INFO L226 Difference]: Without dead ends: 15 [2019-01-12 09:33:18,542 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,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-12 09:33:18,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-12 09:33:18,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 09:33:18,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-01-12 09:33:18,546 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2019-01-12 09:33:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:18,547 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-01-12 09:33:18,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:33:18,547 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-01-12 09:33:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 09:33:18,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:18,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:18,548 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:18,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:18,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1835948819, now seen corresponding path program 1 times [2019-01-12 09:33:18,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:18,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:18,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:18,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:18,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:18,671 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,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:18,671 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,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:18,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:18,773 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,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:18,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-12 09:33:18,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:33:18,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:33:18,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:33:18,798 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-01-12 09:33:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:18,853 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-01-12 09:33:18,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:33:18,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-12 09:33:18,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:18,854 INFO L225 Difference]: With dead ends: 26 [2019-01-12 09:33:18,854 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 09:33:18,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:33:18,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 09:33:18,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-12 09:33:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-12 09:33:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-01-12 09:33:18,864 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2019-01-12 09:33:18,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:18,866 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-01-12 09:33:18,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:33:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-01-12 09:33:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:33:18,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:18,867 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:18,867 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:18,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:18,868 INFO L82 PathProgramCache]: Analyzing trace with hash -823346863, now seen corresponding path program 2 times [2019-01-12 09:33:18,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:18,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:18,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:18,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:18,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:19,000 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,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:19,001 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,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 09:33:19,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 09:33:19,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:19,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:19,180 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,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:19,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-12 09:33:19,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:33:19,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:33:19,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:33:19,213 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 6 states. [2019-01-12 09:33:19,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:19,277 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-01-12 09:33:19,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:33:19,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-12 09:33:19,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:19,281 INFO L225 Difference]: With dead ends: 28 [2019-01-12 09:33:19,281 INFO L226 Difference]: Without dead ends: 19 [2019-01-12 09:33:19,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:33:19,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-12 09:33:19,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-12 09:33:19,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-12 09:33:19,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-01-12 09:33:19,287 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2019-01-12 09:33:19,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:19,288 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-01-12 09:33:19,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:33:19,288 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-01-12 09:33:19,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:33:19,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:19,290 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:19,290 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:19,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:19,291 INFO L82 PathProgramCache]: Analyzing trace with hash -900956145, now seen corresponding path program 3 times [2019-01-12 09:33:19,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:19,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:19,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:19,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:19,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:19,482 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:19,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:19,482 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:19,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 09:33:19,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 09:33:19,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:19,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:19,559 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:19,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:19,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-12 09:33:19,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:33:19,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:33:19,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:33:19,584 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2019-01-12 09:33:19,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:19,639 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-01-12 09:33:19,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:33:19,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-01-12 09:33:19,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:19,641 INFO L225 Difference]: With dead ends: 30 [2019-01-12 09:33:19,641 INFO L226 Difference]: Without dead ends: 21 [2019-01-12 09:33:19,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:33:19,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-12 09:33:19,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-12 09:33:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-12 09:33:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-12 09:33:19,645 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2019-01-12 09:33:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:19,646 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-12 09:33:19,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:33:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-12 09:33:19,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 09:33:19,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:19,648 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:19,648 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:19,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:19,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1825935181, now seen corresponding path program 4 times [2019-01-12 09:33:19,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:19,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:19,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:19,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:19,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:19,863 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:19,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:19,864 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:19,876 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 09:33:19,909 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 09:33:19,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:19,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:19,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:19,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-12 09:33:19,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 09:33:19,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 09:33:19,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:33:19,966 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 8 states. [2019-01-12 09:33:20,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:20,014 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-01-12 09:33:20,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:33:20,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-01-12 09:33:20,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:20,019 INFO L225 Difference]: With dead ends: 32 [2019-01-12 09:33:20,019 INFO L226 Difference]: Without dead ends: 23 [2019-01-12 09:33:20,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:33:20,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-12 09:33:20,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-12 09:33:20,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-12 09:33:20,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-01-12 09:33:20,024 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2019-01-12 09:33:20,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:20,024 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-01-12 09:33:20,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 09:33:20,025 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-01-12 09:33:20,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 09:33:20,025 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:20,025 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:20,027 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:20,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:20,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1856518389, now seen corresponding path program 5 times [2019-01-12 09:33:20,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:20,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:20,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:20,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:20,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:20,191 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:20,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:20,192 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:20,204 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 09:33:20,277 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-12 09:33:20,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:20,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:20,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:20,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-12 09:33:20,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 09:33:20,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 09:33:20,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:33:20,415 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 9 states. [2019-01-12 09:33:20,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:20,621 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-01-12 09:33:20,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 09:33:20,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-01-12 09:33:20,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:20,624 INFO L225 Difference]: With dead ends: 34 [2019-01-12 09:33:20,624 INFO L226 Difference]: Without dead ends: 25 [2019-01-12 09:33:20,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:33:20,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-12 09:33:20,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-01-12 09:33:20,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-12 09:33:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-01-12 09:33:20,630 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 21 [2019-01-12 09:33:20,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:20,630 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-01-12 09:33:20,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 09:33:20,630 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-12 09:33:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 09:33:20,631 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:20,631 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:20,631 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:20,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:20,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1641347255, now seen corresponding path program 6 times [2019-01-12 09:33:20,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:20,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:20,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:20,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:20,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:20,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:20,934 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:20,953 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 09:33:21,102 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-12 09:33:21,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:21,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:21,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:21,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-12 09:33:21,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 09:33:21,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 09:33:21,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:33:21,183 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 10 states. [2019-01-12 09:33:21,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:21,282 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-01-12 09:33:21,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 09:33:21,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-01-12 09:33:21,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:21,285 INFO L225 Difference]: With dead ends: 36 [2019-01-12 09:33:21,286 INFO L226 Difference]: Without dead ends: 27 [2019-01-12 09:33:21,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:33:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-12 09:33:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-12 09:33:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 09:33:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-12 09:33:21,291 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 23 [2019-01-12 09:33:21,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:21,291 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-12 09:33:21,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 09:33:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-12 09:33:21,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 09:33:21,292 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:21,292 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:21,293 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:21,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:21,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1020317689, now seen corresponding path program 7 times [2019-01-12 09:33:21,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:21,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:21,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:21,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:21,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:21,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:21,539 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:21,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:21,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:21,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:21,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-12 09:33:21,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 09:33:21,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 09:33:21,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:33:21,745 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 11 states. [2019-01-12 09:33:21,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:21,896 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-01-12 09:33:21,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 09:33:21,897 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-01-12 09:33:21,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:21,898 INFO L225 Difference]: With dead ends: 38 [2019-01-12 09:33:21,898 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 09:33:21,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 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:21,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 09:33:21,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-01-12 09:33:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:33:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-01-12 09:33:21,903 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 25 [2019-01-12 09:33:21,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:21,904 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-01-12 09:33:21,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 09:33:21,904 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-01-12 09:33:21,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 09:33:21,905 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:21,905 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:21,905 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:21,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:21,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1211358907, now seen corresponding path program 8 times [2019-01-12 09:33:21,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:21,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:21,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:21,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:21,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:22,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:22,125 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:22,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 09:33:22,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 09:33:22,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:22,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:22,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:22,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-12 09:33:22,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 09:33:22,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 09:33:22,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-12 09:33:22,247 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 12 states. [2019-01-12 09:33:22,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:22,355 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-01-12 09:33:22,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 09:33:22,357 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-01-12 09:33:22,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:22,358 INFO L225 Difference]: With dead ends: 40 [2019-01-12 09:33:22,358 INFO L226 Difference]: Without dead ends: 31 [2019-01-12 09:33:22,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-12 09:33:22,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-12 09:33:22,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-01-12 09:33:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-12 09:33:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-01-12 09:33:22,365 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2019-01-12 09:33:22,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:22,365 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-01-12 09:33:22,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 09:33:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-01-12 09:33:22,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 09:33:22,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:22,366 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:22,367 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:22,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:22,370 INFO L82 PathProgramCache]: Analyzing trace with hash -118375677, now seen corresponding path program 9 times [2019-01-12 09:33:22,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:22,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:22,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:22,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:22,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:22,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:22,748 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:22,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 09:33:22,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-12 09:33:22,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:22,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:22,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:22,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-12 09:33:22,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 09:33:22,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 09:33:22,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-12 09:33:22,969 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 13 states. [2019-01-12 09:33:23,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:23,342 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-01-12 09:33:23,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 09:33:23,343 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2019-01-12 09:33:23,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:23,345 INFO L225 Difference]: With dead ends: 42 [2019-01-12 09:33:23,345 INFO L226 Difference]: Without dead ends: 33 [2019-01-12 09:33:23,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-12 09:33:23,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-12 09:33:23,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-01-12 09:33:23,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 09:33:23,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-12 09:33:23,351 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2019-01-12 09:33:23,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:23,351 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-12 09:33:23,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 09:33:23,351 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-12 09:33:23,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 09:33:23,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:23,352 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:23,352 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:23,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:23,353 INFO L82 PathProgramCache]: Analyzing trace with hash -2028479167, now seen corresponding path program 10 times [2019-01-12 09:33:23,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:23,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:23,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:23,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:23,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:23,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:23,569 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:23,579 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 09:33:23,604 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 09:33:23,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:23,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:23,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:23,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-01-12 09:33:23,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 09:33:23,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 09:33:23,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-12 09:33:23,668 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 14 states. [2019-01-12 09:33:23,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:23,792 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-01-12 09:33:23,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 09:33:23,793 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-01-12 09:33:23,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:23,794 INFO L225 Difference]: With dead ends: 44 [2019-01-12 09:33:23,794 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 09:33:23,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-12 09:33:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 09:33:23,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-01-12 09:33:23,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-12 09:33:23,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-01-12 09:33:23,805 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 31 [2019-01-12 09:33:23,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:23,806 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-01-12 09:33:23,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 09:33:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-01-12 09:33:23,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 09:33:23,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:23,807 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:23,807 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:23,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:23,807 INFO L82 PathProgramCache]: Analyzing trace with hash 608069631, now seen corresponding path program 11 times [2019-01-12 09:33:23,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:23,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:23,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:23,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:23,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:24,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:24,109 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:24,121 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 09:33:24,366 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-01-12 09:33:24,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:24,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:24,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:24,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-01-12 09:33:24,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 09:33:24,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 09:33:24,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-01-12 09:33:24,422 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 15 states. [2019-01-12 09:33:24,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:24,496 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-01-12 09:33:24,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 09:33:24,497 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2019-01-12 09:33:24,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:24,498 INFO L225 Difference]: With dead ends: 46 [2019-01-12 09:33:24,498 INFO L226 Difference]: Without dead ends: 37 [2019-01-12 09:33:24,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-01-12 09:33:24,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-12 09:33:24,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-01-12 09:33:24,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-12 09:33:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-01-12 09:33:24,504 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 33 [2019-01-12 09:33:24,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:24,504 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-01-12 09:33:24,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 09:33:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-01-12 09:33:24,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 09:33:24,505 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:24,505 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:24,506 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:24,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:24,506 INFO L82 PathProgramCache]: Analyzing trace with hash 300759869, now seen corresponding path program 12 times [2019-01-12 09:33:24,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:24,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:24,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:24,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:24,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:24,793 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:24,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:24,794 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:24,803 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 09:33:25,895 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-12 09:33:25,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:25,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:25,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:25,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-01-12 09:33:25,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 09:33:25,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 09:33:25,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-12 09:33:25,951 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 16 states. [2019-01-12 09:33:26,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:26,042 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-01-12 09:33:26,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 09:33:26,044 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2019-01-12 09:33:26,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:26,046 INFO L225 Difference]: With dead ends: 48 [2019-01-12 09:33:26,046 INFO L226 Difference]: Without dead ends: 39 [2019-01-12 09:33:26,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-12 09:33:26,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-12 09:33:26,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-01-12 09:33:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-12 09:33:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-12 09:33:26,056 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 35 [2019-01-12 09:33:26,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:26,057 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-12 09:33:26,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 09:33:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-12 09:33:26,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 09:33:26,063 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:26,064 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:26,064 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:26,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:26,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1328822011, now seen corresponding path program 13 times [2019-01-12 09:33:26,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:26,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:26,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:26,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:26,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:26,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:26,970 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:26,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:27,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:27,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:27,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-01-12 09:33:27,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 09:33:27,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 09:33:27,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-01-12 09:33:27,058 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 17 states. [2019-01-12 09:33:27,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:27,160 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-01-12 09:33:27,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 09:33:27,161 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2019-01-12 09:33:27,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:27,161 INFO L225 Difference]: With dead ends: 50 [2019-01-12 09:33:27,161 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 09:33:27,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-01-12 09:33:27,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 09:33:27,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-01-12 09:33:27,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-12 09:33:27,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-01-12 09:33:27,166 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 37 [2019-01-12 09:33:27,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:27,166 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-01-12 09:33:27,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 09:33:27,166 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-01-12 09:33:27,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 09:33:27,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:27,167 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:27,167 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:27,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:27,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1454062393, now seen corresponding path program 14 times [2019-01-12 09:33:27,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:27,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:27,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:27,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:27,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:27,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:27,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:27,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 09:33:27,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 09:33:27,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:27,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:27,563 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:27,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:27,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-01-12 09:33:27,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 09:33:27,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 09:33:27,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-12 09:33:27,586 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 18 states. [2019-01-12 09:33:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:27,658 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-01-12 09:33:27,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 09:33:27,659 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2019-01-12 09:33:27,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:27,660 INFO L225 Difference]: With dead ends: 52 [2019-01-12 09:33:27,660 INFO L226 Difference]: Without dead ends: 43 [2019-01-12 09:33:27,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-12 09:33:27,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-12 09:33:27,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-01-12 09:33:27,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-12 09:33:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-01-12 09:33:27,665 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2019-01-12 09:33:27,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:27,666 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-01-12 09:33:27,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 09:33:27,666 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-01-12 09:33:27,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-12 09:33:27,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:27,667 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:27,667 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:27,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:27,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1550985207, now seen corresponding path program 15 times [2019-01-12 09:33:27,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:27,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:27,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:27,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:27,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:27,855 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:27,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:27,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:27,865 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 09:33:29,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-12 09:33:29,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:29,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:29,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:29,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-01-12 09:33:29,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 09:33:29,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 09:33:29,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-01-12 09:33:29,307 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 19 states. [2019-01-12 09:33:29,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:29,393 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-01-12 09:33:29,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 09:33:29,395 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2019-01-12 09:33:29,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:29,396 INFO L225 Difference]: With dead ends: 54 [2019-01-12 09:33:29,396 INFO L226 Difference]: Without dead ends: 45 [2019-01-12 09:33:29,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-01-12 09:33:29,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-12 09:33:29,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-01-12 09:33:29,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-12 09:33:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-01-12 09:33:29,402 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 41 [2019-01-12 09:33:29,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:29,402 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-01-12 09:33:29,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 09:33:29,402 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-12 09:33:29,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-12 09:33:29,403 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:29,403 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:29,403 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:29,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:29,404 INFO L82 PathProgramCache]: Analyzing trace with hash 204528949, now seen corresponding path program 16 times [2019-01-12 09:33:29,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:29,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:29,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:29,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:29,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:29,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:29,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:29,757 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 09:33:29,790 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 09:33:29,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:29,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:29,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:29,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-01-12 09:33:29,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 09:33:29,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 09:33:29,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-12 09:33:29,846 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 20 states. [2019-01-12 09:33:29,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:29,966 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2019-01-12 09:33:29,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 09:33:29,969 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2019-01-12 09:33:29,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:29,970 INFO L225 Difference]: With dead ends: 56 [2019-01-12 09:33:29,970 INFO L226 Difference]: Without dead ends: 47 [2019-01-12 09:33:29,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-12 09:33:29,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-12 09:33:29,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-01-12 09:33:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-12 09:33:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-01-12 09:33:29,975 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 43 [2019-01-12 09:33:29,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:29,975 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-01-12 09:33:29,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 09:33:29,976 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-01-12 09:33:29,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 09:33:29,976 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:29,977 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:29,977 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:29,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:29,977 INFO L82 PathProgramCache]: Analyzing trace with hash -954778893, now seen corresponding path program 17 times [2019-01-12 09:33:29,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:29,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:29,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:29,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:29,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:30,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:30,783 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:30,793 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 09:33:32,296 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-01-12 09:33:32,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:32,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:32,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:32,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-01-12 09:33:32,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 09:33:32,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 09:33:32,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-01-12 09:33:32,369 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 21 states. [2019-01-12 09:33:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:32,629 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-01-12 09:33:32,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 09:33:32,630 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2019-01-12 09:33:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:32,630 INFO L225 Difference]: With dead ends: 58 [2019-01-12 09:33:32,630 INFO L226 Difference]: Without dead ends: 49 [2019-01-12 09:33:32,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-01-12 09:33:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-12 09:33:32,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-01-12 09:33:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-12 09:33:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-01-12 09:33:32,636 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 45 [2019-01-12 09:33:32,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:32,637 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-01-12 09:33:32,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 09:33:32,637 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-01-12 09:33:32,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-12 09:33:32,638 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:32,638 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:32,638 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:32,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:32,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1641881905, now seen corresponding path program 18 times [2019-01-12 09:33:32,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:32,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:32,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:32,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:32,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:32,911 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:32,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:32,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:32,923 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 09:33:41,922 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-01-12 09:33:41,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:33:41,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:42,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:42,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-01-12 09:33:42,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 09:33:42,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 09:33:42,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-12 09:33:42,003 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 22 states. [2019-01-12 09:33:42,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:42,100 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-01-12 09:33:42,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 09:33:42,101 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2019-01-12 09:33:42,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:42,102 INFO L225 Difference]: With dead ends: 60 [2019-01-12 09:33:42,102 INFO L226 Difference]: Without dead ends: 51 [2019-01-12 09:33:42,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-12 09:33:42,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-12 09:33:42,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-01-12 09:33:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-12 09:33:42,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-01-12 09:33:42,107 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 47 [2019-01-12 09:33:42,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:42,108 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-01-12 09:33:42,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 09:33:42,109 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-01-12 09:33:42,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 09:33:42,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:42,111 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:42,111 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:42,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:42,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1656909807, now seen corresponding path program 19 times [2019-01-12 09:33:42,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:42,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:42,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:42,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:33:42,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:42,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:42,578 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:42,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:42,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:42,662 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:42,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:42,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-01-12 09:33:42,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 09:33:42,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 09:33:42,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-01-12 09:33:42,691 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 23 states. [2019-01-12 09:33:42,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:42,851 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-01-12 09:33:42,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 09:33:42,852 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2019-01-12 09:33:42,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:42,853 INFO L225 Difference]: With dead ends: 61 [2019-01-12 09:33:42,853 INFO L226 Difference]: Without dead ends: 52 [2019-01-12 09:33:42,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-01-12 09:33:42,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-12 09:33:42,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-12 09:33:42,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-12 09:33:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-01-12 09:33:42,857 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 49 [2019-01-12 09:33:42,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:42,857 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-01-12 09:33:42,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 09:33:42,860 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-01-12 09:33:42,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 09:33:42,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:42,861 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:42,861 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:42,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:42,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1081145555, now seen corresponding path program 20 times [2019-01-12 09:33:42,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:42,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:42,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:42,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:42,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:33:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:33:43,029 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:33:43,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:33:43 BoogieIcfgContainer [2019-01-12 09:33:43,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:33:43,077 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:33:43,077 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:33:43,078 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:33:43,078 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:43,083 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 09:33:43,168 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:33:43,169 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:33:43,170 INFO L168 Benchmark]: Toolchain (without parser) took 26093.33 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.7 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -129.1 MB). Peak memory consumption was 176.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:33:43,172 INFO L168 Benchmark]: CDTParser took 0.14 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:43,172 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.24 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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:43,173 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.42 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:33:43,173 INFO L168 Benchmark]: Boogie Preprocessor took 50.19 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 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:43,174 INFO L168 Benchmark]: RCFGBuilder took 580.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -174.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:33:43,174 INFO L168 Benchmark]: TraceAbstraction took 25005.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 186.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:33:43,175 INFO L168 Benchmark]: Witness Printer took 91.41 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:33:43,182 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.14 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 303.24 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.42 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.19 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 580.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -174.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25005.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 186.0 MB. Max. memory is 11.5 GB. * Witness Printer took 91.41 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 37]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] struct dummy ad1[20], *ad2; [L16] int i, j, *pa; [L17] j=0 [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ [L17] COND FALSE !(j<20) [L21] i = __VERIFIER_nondet_int() [L22] COND TRUE i >= 0 && i < 10 [L23] ad2 = ad1 [L24] ad1[i].a = i [L25] pa = &ad1[i].a [L26] EXPR ad2[i].a [L26] i = ad2[i].a + 10 [L27] EXPR \read(*pa) [L27] COND FALSE !(i < *pa) [L10] EXPR ad1[b].a [L10] return ad1[b].a == b; [L30] COND TRUE !check(ad1, i) [L37] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. UNSAFE Result, 24.9s OverallTime, 22 OverallIterations, 20 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 259 SDtfs, 210 SDslu, 1430 SDs, 0 SdLazy, 618 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 822 GetRequests, 593 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=21, 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.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 19 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 14.2s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 1250 NumberOfCodeBlocks, 1250 NumberOfCodeBlocksAsserted, 143 NumberOfCheckSat, 1159 ConstructedInterpolants, 0 QuantifiedInterpolants, 95961 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2641 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 40 InterpolantComputations, 2 PerfectInterpolantSequences, 0/4940 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...