./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-regression/test23_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/test23_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 b974f281a213c0803f91ef44d205e442fb2a5f8f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-14 15:49:04,991 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:49:04,993 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:49:05,004 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:49:05,005 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:49:05,006 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:49:05,007 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:49:05,009 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:49:05,011 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:49:05,012 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:49:05,012 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:49:05,013 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:49:05,014 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:49:05,015 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:49:05,016 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:49:05,017 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:49:05,017 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:49:05,019 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:49:05,022 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:49:05,023 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:49:05,024 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:49:05,026 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:49:05,029 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:49:05,029 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:49:05,030 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:49:05,031 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:49:05,032 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:49:05,033 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:49:05,034 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:49:05,035 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:49:05,036 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:49:05,037 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:49:05,037 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:49:05,037 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:49:05,038 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:49:05,039 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:49:05,039 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 15:49:05,068 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:49:05,068 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:49:05,070 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:49:05,070 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:49:05,070 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:49:05,072 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:49:05,072 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:49:05,072 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 15:49:05,072 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:49:05,072 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:49:05,073 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:49:05,073 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:49:05,073 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:49:05,073 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:49:05,073 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:49:05,073 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:49:05,074 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:49:05,076 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:49:05,076 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:49:05,076 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:49:05,076 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:49:05,077 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:49:05,078 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:49:05,078 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:49:05,078 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 15:49:05,078 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:49:05,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 15:49:05,079 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 -> b974f281a213c0803f91ef44d205e442fb2a5f8f [2019-01-14 15:49:05,136 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:49:05,152 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:49:05,159 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:49:05,163 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:49:05,163 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:49:05,164 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/test23_false-unreach-call.c [2019-01-14 15:49:05,235 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2c38612d/f42434cdd5f047c5a34522e97386c007/FLAG2c214f952 [2019-01-14 15:49:05,694 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:49:05,694 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/test23_false-unreach-call.c [2019-01-14 15:49:05,701 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2c38612d/f42434cdd5f047c5a34522e97386c007/FLAG2c214f952 [2019-01-14 15:49:06,069 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2c38612d/f42434cdd5f047c5a34522e97386c007 [2019-01-14 15:49:06,073 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:49:06,075 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:49:06,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:49:06,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:49:06,082 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:49:06,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:49:06" (1/1) ... [2019-01-14 15:49:06,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@152ee249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:06, skipping insertion in model container [2019-01-14 15:49:06,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:49:06" (1/1) ... [2019-01-14 15:49:06,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:49:06,115 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:49:06,384 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:49:06,414 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:49:06,440 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:49:06,475 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:49:06,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:06 WrapperNode [2019-01-14 15:49:06,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:49:06,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:49:06,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:49:06,479 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:49:06,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:06" (1/1) ... [2019-01-14 15:49:06,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:06" (1/1) ... [2019-01-14 15:49:06,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:49:06,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:49:06,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:49:06,541 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:49:06,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:06" (1/1) ... [2019-01-14 15:49:06,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:06" (1/1) ... [2019-01-14 15:49:06,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:06" (1/1) ... [2019-01-14 15:49:06,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:06" (1/1) ... [2019-01-14 15:49:06,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:06" (1/1) ... [2019-01-14 15:49:06,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:06" (1/1) ... [2019-01-14 15:49:06,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:06" (1/1) ... [2019-01-14 15:49:06,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:49:06,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:49:06,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:49:06,653 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:49:06,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:06" (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-14 15:49:06,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 15:49:06,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 15:49:06,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 15:49:06,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:49:06,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:49:06,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 15:49:07,193 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:49:07,193 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-14 15:49:07,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:49:07 BoogieIcfgContainer [2019-01-14 15:49:07,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:49:07,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:49:07,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:49:07,200 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:49:07,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:49:06" (1/3) ... [2019-01-14 15:49:07,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5790429b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:49:07, skipping insertion in model container [2019-01-14 15:49:07,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:06" (2/3) ... [2019-01-14 15:49:07,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5790429b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:49:07, skipping insertion in model container [2019-01-14 15:49:07,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:49:07" (3/3) ... [2019-01-14 15:49:07,205 INFO L112 eAbstractionObserver]: Analyzing ICFG test23_false-unreach-call.c [2019-01-14 15:49:07,215 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:49:07,224 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 15:49:07,241 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 15:49:07,273 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:49:07,274 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:49:07,274 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:49:07,274 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:49:07,275 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:49:07,275 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:49:07,275 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:49:07,276 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:49:07,276 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:49:07,290 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-01-14 15:49:07,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 15:49:07,298 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:49:07,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:49:07,302 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:49:07,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:49:07,309 INFO L82 PathProgramCache]: Analyzing trace with hash 2100293056, now seen corresponding path program 1 times [2019-01-14 15:49:07,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:49:07,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:49:07,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:07,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:49:07,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:07,505 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-14 15:49:07,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:49:07,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 15:49:07,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 15:49:07,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 15:49:07,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 15:49:07,538 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-01-14 15:49:07,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:49:07,551 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-01-14 15:49:07,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 15:49:07,553 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-01-14 15:49:07,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:49:07,564 INFO L225 Difference]: With dead ends: 30 [2019-01-14 15:49:07,564 INFO L226 Difference]: Without dead ends: 17 [2019-01-14 15:49:07,568 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-14 15:49:07,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-14 15:49:07,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-14 15:49:07,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 15:49:07,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-01-14 15:49:07,604 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2019-01-14 15:49:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:49:07,604 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-14 15:49:07,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 15:49:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-01-14 15:49:07,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 15:49:07,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:49:07,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:49:07,606 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:49:07,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:49:07,606 INFO L82 PathProgramCache]: Analyzing trace with hash 478567452, now seen corresponding path program 1 times [2019-01-14 15:49:07,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:49:07,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:49:07,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:07,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:49:07,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:08,308 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2019-01-14 15:49:08,864 WARN L181 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 9 [2019-01-14 15:49:09,150 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 9 [2019-01-14 15:49:09,858 WARN L181 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 15 [2019-01-14 15:49:10,541 WARN L181 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 20 [2019-01-14 15:49:10,653 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-14 15:49:10,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:49:10,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 15:49:10,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 15:49:10,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 15:49:10,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-01-14 15:49:10,657 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 12 states. [2019-01-14 15:49:11,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:49:11,614 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-01-14 15:49:11,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 15:49:11,615 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-01-14 15:49:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:49:11,618 INFO L225 Difference]: With dead ends: 59 [2019-01-14 15:49:11,618 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 15:49:11,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2019-01-14 15:49:11,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 15:49:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 25. [2019-01-14 15:49:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 15:49:11,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-01-14 15:49:11,629 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2019-01-14 15:49:11,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:49:11,629 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-01-14 15:49:11,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 15:49:11,631 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-01-14 15:49:11,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 15:49:11,631 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:49:11,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:49:11,632 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:49:11,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:49:11,632 INFO L82 PathProgramCache]: Analyzing trace with hash -108238562, now seen corresponding path program 1 times [2019-01-14 15:49:11,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:49:11,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:49:11,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:11,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:49:11,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:11,777 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-14 15:49:11,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:49:11,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 15:49:11,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 15:49:11,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 15:49:11,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-14 15:49:11,779 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 9 states. [2019-01-14 15:49:12,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:49:12,179 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-01-14 15:49:12,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 15:49:12,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-01-14 15:49:12,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:49:12,182 INFO L225 Difference]: With dead ends: 54 [2019-01-14 15:49:12,182 INFO L226 Difference]: Without dead ends: 44 [2019-01-14 15:49:12,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-01-14 15:49:12,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-14 15:49:12,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 25. [2019-01-14 15:49:12,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 15:49:12,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-01-14 15:49:12,193 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2019-01-14 15:49:12,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:49:12,193 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-01-14 15:49:12,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 15:49:12,194 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-01-14 15:49:12,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 15:49:12,195 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:49:12,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:49:12,195 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:49:12,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:49:12,195 INFO L82 PathProgramCache]: Analyzing trace with hash -501265572, now seen corresponding path program 1 times [2019-01-14 15:49:12,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:49:12,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:49:12,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:12,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:49:12,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:12,630 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 10 [2019-01-14 15:49:13,200 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 9 [2019-01-14 15:49:13,672 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 39 [2019-01-14 15:49:13,871 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-14 15:49:13,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:49:13,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 15:49:13,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 15:49:13,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 15:49:13,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-01-14 15:49:13,873 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 12 states. [2019-01-14 15:49:14,499 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-01-14 15:49:14,908 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-01-14 15:49:15,113 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-01-14 15:49:15,245 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-01-14 15:49:15,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:49:15,303 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-01-14 15:49:15,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 15:49:15,305 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-01-14 15:49:15,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:49:15,305 INFO L225 Difference]: With dead ends: 51 [2019-01-14 15:49:15,306 INFO L226 Difference]: Without dead ends: 46 [2019-01-14 15:49:15,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2019-01-14 15:49:15,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-14 15:49:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 22. [2019-01-14 15:49:15,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 15:49:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-01-14 15:49:15,320 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2019-01-14 15:49:15,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:49:15,321 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-01-14 15:49:15,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 15:49:15,321 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-01-14 15:49:15,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 15:49:15,321 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:49:15,322 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:49:15,325 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:49:15,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:49:15,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1851619425, now seen corresponding path program 1 times [2019-01-14 15:49:15,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:49:15,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:49:15,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:15,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:49:15,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:16,042 WARN L181 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 9 [2019-01-14 15:49:16,788 WARN L181 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 65 [2019-01-14 15:49:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:17,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:49:17,106 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-14 15:49:17,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:49:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:17,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:49:17,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 15:49:17,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 15:49:17,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:49:17,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:49:17,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:49:17,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2019-01-14 15:49:17,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-01-14 15:49:17,952 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:49:17,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2019-01-14 15:49:17,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:49:17,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:49:18,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:49:18,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:5 [2019-01-14 15:49:18,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:18,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:49:18,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2019-01-14 15:49:18,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-14 15:49:18,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 15:49:18,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-01-14 15:49:18,077 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 20 states. [2019-01-14 15:49:19,001 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 45 [2019-01-14 15:49:20,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:49:20,538 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2019-01-14 15:49:20,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-14 15:49:20,540 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2019-01-14 15:49:20,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:49:20,541 INFO L225 Difference]: With dead ends: 59 [2019-01-14 15:49:20,541 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 15:49:20,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2019-01-14 15:49:20,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 15:49:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 29. [2019-01-14 15:49:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 15:49:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-01-14 15:49:20,561 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 18 [2019-01-14 15:49:20,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:49:20,561 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-01-14 15:49:20,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-14 15:49:20,562 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-01-14 15:49:20,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 15:49:20,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:49:20,562 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:49:20,563 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:49:20,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:49:20,563 INFO L82 PathProgramCache]: Analyzing trace with hash 829921185, now seen corresponding path program 1 times [2019-01-14 15:49:20,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:49:20,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:49:20,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:20,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:49:20,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:20,954 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2019-01-14 15:49:21,357 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 10 [2019-01-14 15:49:22,165 WARN L181 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 63 [2019-01-14 15:49:22,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:22,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:49:22,398 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-14 15:49:22,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:49:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:22,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:49:22,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 15:49:22,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 15:49:22,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:49:22,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:49:22,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:49:22,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2019-01-14 15:49:22,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-01-14 15:49:22,700 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:49:22,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2019-01-14 15:49:22,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:49:22,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:49:22,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:49:22,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:5 [2019-01-14 15:49:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:22,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:49:22,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2019-01-14 15:49:22,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-14 15:49:22,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 15:49:22,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-01-14 15:49:22,755 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 20 states. [2019-01-14 15:49:23,828 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 45 [2019-01-14 15:49:24,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:49:24,136 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2019-01-14 15:49:24,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 15:49:24,137 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2019-01-14 15:49:24,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:49:24,139 INFO L225 Difference]: With dead ends: 63 [2019-01-14 15:49:24,139 INFO L226 Difference]: Without dead ends: 58 [2019-01-14 15:49:24,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2019-01-14 15:49:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-14 15:49:24,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 26. [2019-01-14 15:49:24,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 15:49:24,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-01-14 15:49:24,150 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2019-01-14 15:49:24,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:49:24,150 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-14 15:49:24,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-14 15:49:24,152 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-01-14 15:49:24,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 15:49:24,153 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:49:24,153 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:49:24,154 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:49:24,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:49:24,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1013708501, now seen corresponding path program 2 times [2019-01-14 15:49:24,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:49:24,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:49:24,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:24,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:49:24,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:24,575 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 7 [2019-01-14 15:49:24,787 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 3 [2019-01-14 15:49:25,043 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 9 [2019-01-14 15:49:25,387 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 9 [2019-01-14 15:49:25,769 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 57 [2019-01-14 15:49:25,949 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 48 [2019-01-14 15:49:26,634 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 24 [2019-01-14 15:49:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:26,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:49:26,819 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-14 15:49:26,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 15:49:26,865 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 15:49:26,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:49:26,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:49:27,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 15:49:27,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 15:49:27,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:49:27,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:49:27,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:49:27,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-14 15:49:27,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-01-14 15:49:27,549 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:49:27,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2019-01-14 15:49:27,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:49:27,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:49:27,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:49:27,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:12 [2019-01-14 15:49:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:27,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:49:27,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2019-01-14 15:49:27,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-14 15:49:27,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-14 15:49:27,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2019-01-14 15:49:27,867 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 29 states. [2019-01-14 15:49:28,464 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 41 [2019-01-14 15:49:28,605 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 37 [2019-01-14 15:49:28,804 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 44 [2019-01-14 15:49:28,957 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 40 [2019-01-14 15:49:31,338 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 31 [2019-01-14 15:49:31,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:49:31,977 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2019-01-14 15:49:31,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-14 15:49:31,978 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 22 [2019-01-14 15:49:31,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:49:31,979 INFO L225 Difference]: With dead ends: 79 [2019-01-14 15:49:31,979 INFO L226 Difference]: Without dead ends: 74 [2019-01-14 15:49:31,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=954, Invalid=3078, Unknown=0, NotChecked=0, Total=4032 [2019-01-14 15:49:31,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-14 15:49:31,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 37. [2019-01-14 15:49:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 15:49:31,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-01-14 15:49:31,998 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 22 [2019-01-14 15:49:31,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:49:31,998 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-01-14 15:49:31,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-14 15:49:31,998 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-01-14 15:49:31,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 15:49:31,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:49:31,999 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:49:32,000 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:49:32,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:49:32,000 INFO L82 PathProgramCache]: Analyzing trace with hash 571246699, now seen corresponding path program 2 times [2019-01-14 15:49:32,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:49:32,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:49:32,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:32,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:49:32,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:32,545 WARN L181 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 16 [2019-01-14 15:49:32,896 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 7 [2019-01-14 15:49:33,261 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 13 [2019-01-14 15:49:33,933 WARN L181 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 41 [2019-01-14 15:49:34,176 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 42 [2019-01-14 15:49:34,422 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 35 [2019-01-14 15:49:34,836 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 26 [2019-01-14 15:49:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:34,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:49:34,962 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-14 15:49:34,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 15:49:35,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 15:49:35,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:49:35,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:49:35,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 15:49:35,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 15:49:35,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:49:35,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:49:35,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:49:35,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-14 15:49:35,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-01-14 15:49:35,499 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:49:35,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2019-01-14 15:49:35,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:49:35,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:49:35,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:49:35,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:12 [2019-01-14 15:49:35,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:35,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:49:35,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 27 [2019-01-14 15:49:35,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-14 15:49:35,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-14 15:49:35,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2019-01-14 15:49:35,571 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 28 states. [2019-01-14 15:49:36,554 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-01-14 15:49:36,743 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2019-01-14 15:49:37,548 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 29 [2019-01-14 15:49:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:49:38,236 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2019-01-14 15:49:38,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-14 15:49:38,237 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 22 [2019-01-14 15:49:38,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:49:38,238 INFO L225 Difference]: With dead ends: 87 [2019-01-14 15:49:38,239 INFO L226 Difference]: Without dead ends: 82 [2019-01-14 15:49:38,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=481, Invalid=1871, Unknown=0, NotChecked=0, Total=2352 [2019-01-14 15:49:38,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-14 15:49:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 34. [2019-01-14 15:49:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 15:49:38,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-01-14 15:49:38,257 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 22 [2019-01-14 15:49:38,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:49:38,257 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-01-14 15:49:38,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-14 15:49:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-01-14 15:49:38,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 15:49:38,260 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:49:38,260 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:49:38,260 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:49:38,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:49:38,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1043903553, now seen corresponding path program 3 times [2019-01-14 15:49:38,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:49:38,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:49:38,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:38,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:49:38,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:39,901 WARN L181 SmtUtils]: Spent 885.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 79 [2019-01-14 15:49:40,152 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 58 [2019-01-14 15:49:40,426 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 46 [2019-01-14 15:49:40,587 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 43 [2019-01-14 15:49:40,750 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 44 [2019-01-14 15:49:40,956 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 39 [2019-01-14 15:49:41,179 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 40 [2019-01-14 15:49:41,356 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 43 [2019-01-14 15:49:41,560 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 46 [2019-01-14 15:49:41,752 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 41 [2019-01-14 15:49:42,008 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 36 [2019-01-14 15:49:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:42,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:49:42,429 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-14 15:49:42,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 15:49:42,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-14 15:49:42,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:49:42,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:49:42,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 15:49:42,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 15:49:42,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:49:42,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:49:42,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:49:42,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-14 15:49:43,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-01-14 15:49:43,486 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:49:43,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2019-01-14 15:49:43,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:49:43,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:49:43,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:49:43,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:5 [2019-01-14 15:49:43,554 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:43,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:49:43,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 40 [2019-01-14 15:49:43,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-14 15:49:43,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-14 15:49:43,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1513, Unknown=0, NotChecked=0, Total=1640 [2019-01-14 15:49:43,587 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 41 states. [2019-01-14 15:49:44,981 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 68 [2019-01-14 15:49:45,316 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 63 [2019-01-14 15:49:45,742 WARN L181 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 70 [2019-01-14 15:49:46,095 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 65 [2019-01-14 15:49:46,300 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 39 [2019-01-14 15:49:46,671 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 42 [2019-01-14 15:49:46,860 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 37 [2019-01-14 15:49:47,041 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 38 [2019-01-14 15:49:47,418 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 41 [2019-01-14 15:49:47,650 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 36 [2019-01-14 15:49:47,887 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 39 [2019-01-14 15:49:48,345 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 42 [2019-01-14 15:49:48,571 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 37 [2019-01-14 15:49:48,764 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 39 [2019-01-14 15:49:49,153 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 43 [2019-01-14 15:49:49,902 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 43 [2019-01-14 15:49:50,672 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 42 [2019-01-14 15:49:51,969 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-01-14 15:49:52,306 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-01-14 15:49:52,736 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2019-01-14 15:49:53,156 WARN L181 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-01-14 15:49:53,525 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-01-14 15:49:54,260 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-01-14 15:49:54,642 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-01-14 15:49:54,858 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2019-01-14 15:49:55,104 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-01-14 15:49:56,885 WARN L181 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-14 15:49:57,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:49:57,451 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2019-01-14 15:49:57,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-14 15:49:57,452 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 30 [2019-01-14 15:49:57,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:49:57,453 INFO L225 Difference]: With dead ends: 121 [2019-01-14 15:49:57,454 INFO L226 Difference]: Without dead ends: 98 [2019-01-14 15:49:57,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3161 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=1970, Invalid=10240, Unknown=0, NotChecked=0, Total=12210 [2019-01-14 15:49:57,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-14 15:49:57,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 45. [2019-01-14 15:49:57,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 15:49:57,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-01-14 15:49:57,484 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 30 [2019-01-14 15:49:57,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:49:57,485 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-01-14 15:49:57,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-14 15:49:57,485 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-01-14 15:49:57,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 15:49:57,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:49:57,486 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:49:57,486 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:49:57,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:49:57,487 INFO L82 PathProgramCache]: Analyzing trace with hash 745310975, now seen corresponding path program 3 times [2019-01-14 15:49:57,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:49:57,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:49:57,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:57,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:49:57,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:49:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:49:57,832 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 19 [2019-01-14 15:49:58,674 WARN L181 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 96 [2019-01-14 15:49:58,950 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 36 [2019-01-14 15:49:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:49:59,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:49:59,896 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-14 15:49:59,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 15:50:00,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-14 15:50:00,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:50:00,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:50:00,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 15:50:00,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 15:50:00,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:50:00,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:00,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:50:00,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-14 15:50:00,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-01-14 15:50:00,920 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:50:00,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2019-01-14 15:50:00,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:50:00,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:00,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:00,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:12 [2019-01-14 15:50:00,973 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:00,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:50:00,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 38 [2019-01-14 15:50:00,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-14 15:50:00,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-14 15:50:00,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1298, Unknown=0, NotChecked=0, Total=1482 [2019-01-14 15:50:00,994 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 39 states. [2019-01-14 15:50:02,296 WARN L181 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 114 [2019-01-14 15:50:02,820 WARN L181 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 117 [2019-01-14 15:50:05,398 WARN L181 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-01-14 15:50:05,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:50:05,654 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2019-01-14 15:50:05,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-14 15:50:05,655 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 30 [2019-01-14 15:50:05,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:50:05,655 INFO L225 Difference]: With dead ends: 111 [2019-01-14 15:50:05,656 INFO L226 Difference]: Without dead ends: 106 [2019-01-14 15:50:05,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=838, Invalid=3718, Unknown=0, NotChecked=0, Total=4556 [2019-01-14 15:50:05,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-14 15:50:05,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 42. [2019-01-14 15:50:05,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 15:50:05,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-01-14 15:50:05,682 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 30 [2019-01-14 15:50:05,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:50:05,682 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-01-14 15:50:05,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-14 15:50:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-01-14 15:50:05,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-14 15:50:05,683 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:50:05,683 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:50:05,684 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:50:05,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:50:05,686 INFO L82 PathProgramCache]: Analyzing trace with hash 958970451, now seen corresponding path program 4 times [2019-01-14 15:50:05,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:50:05,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:50:05,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:05,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:50:05,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:50:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:50:05,747 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 15:50:05,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:50:05 BoogieIcfgContainer [2019-01-14 15:50:05,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:50:05,810 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:50:05,810 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:50:05,810 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:50:05,811 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:49:07" (3/4) ... [2019-01-14 15:50:05,815 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 15:50:05,888 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:50:05,891 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:50:05,892 INFO L168 Benchmark]: Toolchain (without parser) took 59818.07 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 513.3 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -291.8 MB). Peak memory consumption was 221.5 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:05,893 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:50:05,893 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.86 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:05,893 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.84 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:05,899 INFO L168 Benchmark]: Boogie Preprocessor took 110.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:05,899 INFO L168 Benchmark]: RCFGBuilder took 543.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:05,900 INFO L168 Benchmark]: TraceAbstraction took 58612.54 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 372.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -131.8 MB). Peak memory consumption was 241.0 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:05,900 INFO L168 Benchmark]: Witness Printer took 81.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:50:05,906 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 401.86 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 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 61.84 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 110.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 543.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 58612.54 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 372.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -131.8 MB). Peak memory consumption was 241.0 MB. Max. memory is 11.5 GB. * Witness Printer took 81.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 50]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] struct dummy d1, d2; VAL [d1={2:0}, d2={1:0}] [L14] d1.a = __VERIFIER_nondet_int() [L15] d1.b = __VERIFIER_nondet_int() [L17] d2.a = __VERIFIER_nondet_int() [L18] d2.b = __VERIFIER_nondet_int() [L23] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [d1={2:0}, d2={1:0}] [L23] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L34] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L23] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [d1={2:0}, d2={1:0}] [L23] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L34] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L35] int i = __VERIFIER_nondet_int(); [L36] COND TRUE pd1 != 0 && pd1 == pd2 && i >= 0 && i < 10 [L37] pd2->array[i] = i [L38] int *pa = &pd1->array[i]; [L39] EXPR pd2->array[i] [L39] i = pd2->array[i] - 10 [L40] EXPR \read(*pa) VAL [d1={2:0}, d2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={2:0}, d2={1:0}] [L40] EXPR \read(*pa) VAL [d1={2:0}, d2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={2:0}, d2={1:0}] [L40] EXPR \read(*pa) VAL [d1={2:0}, d2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={2:0}, d2={1:0}] [L40] EXPR \read(*pa) VAL [d1={2:0}, d2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={2:0}, d2={1:0}] [L40] EXPR \read(*pa) VAL [d1={2:0}, d2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={2:0}, d2={1:0}] [L40] EXPR \read(*pa) VAL [d1={2:0}, d2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={2:0}, d2={1:0}] [L40] EXPR \read(*pa) VAL [d1={2:0}, d2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={2:0}, d2={1:0}] [L40] EXPR \read(*pa) VAL [d1={2:0}, d2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={2:0}, d2={1:0}] [L40] EXPR \read(*pa) VAL [d1={2:0}, d2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={2:0}, d2={1:0}] [L40] EXPR \read(*pa) VAL [d1={2:0}, d2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={2:0}, d2={1:0}] [L40] EXPR \read(*pa) VAL [d1={2:0}, d2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={2:0}, d2={1:0}] [L40] EXPR \read(*pa) VAL [d1={2:0}, d2={1:0}] [L40] COND FALSE !(i <= *pa) [L28] EXPR s1->array[i] [L28] return s1->array[i] == i; [L43] COND TRUE !check(pd2, i) [L50] __VERIFIER_error() VAL [d1={2:0}, d2={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. UNSAFE Result, 58.5s OverallTime, 11 OverallIterations, 12 TraceHistogramMax, 32.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 187 SDtfs, 1200 SDslu, 1465 SDs, 0 SdLazy, 2702 SolverSat, 548 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 490 GetRequests, 72 SyntacticMatches, 14 SemanticMatches, 404 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5965 ImplicationChecksByTransitivity, 49.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=9, 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, 10 MinimizatonAttempts, 331 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 24.6s InterpolantComputationTime, 381 NumberOfCodeBlocks, 381 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 327 ConstructedInterpolants, 50 QuantifiedInterpolants, 183422 SizeOfPredicates, 66 NumberOfNonLiveVariables, 1136 ConjunctsInSsa, 226 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 0/280 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...