java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-tiling/nr3_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 01:08:08,209 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:08:08,210 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:08:08,220 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:08:08,221 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:08:08,221 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:08:08,222 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:08:08,223 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:08:08,224 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:08:08,224 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:08:08,225 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:08:08,225 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:08:08,225 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:08:08,226 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:08:08,226 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:08:08,228 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:08:08,229 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:08:08,230 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:08:08,230 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:08:08,231 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:08:08,232 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:08:08,232 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:08:08,232 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:08:08,233 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:08:08,233 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:08:08,234 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:08:08,234 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:08:08,234 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:08:08,235 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:08:08,235 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:08:08,235 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:08:08,235 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 01:08:08,240 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:08:08,240 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:08:08,241 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:08:08,241 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:08:08,241 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:08:08,241 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:08:08,241 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:08:08,241 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:08:08,241 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:08:08,241 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:08:08,242 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:08:08,242 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:08:08,242 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 01:08:08,242 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:08:08,242 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 01:08:08,242 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:08:08,242 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 01:08:08,242 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 01:08:08,242 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:08:08,242 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:08:08,242 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:08:08,243 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:08:08,243 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:08:08,243 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:08:08,243 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:08:08,243 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:08:08,243 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:08:08,243 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:08:08,243 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:08:08,243 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:08:08,243 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:08:08,243 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:08:08,244 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:08:08,244 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:08:08,262 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:08:08,268 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:08:08,271 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:08:08,271 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:08:08,271 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:08:08,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr3_true-unreach-call.i [2018-01-30 01:08:08,337 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:08:08,338 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 01:08:08,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:08:08,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:08:08,343 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:08:08,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:08:08" (1/1) ... [2018-01-30 01:08:08,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f811e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:08:08, skipping insertion in model container [2018-01-30 01:08:08,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:08:08" (1/1) ... [2018-01-30 01:08:08,354 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:08:08,363 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:08:08,434 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:08:08,443 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:08:08,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:08:08 WrapperNode [2018-01-30 01:08:08,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:08:08,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:08:08,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:08:08,446 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:08:08,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:08:08" (1/1) ... [2018-01-30 01:08:08,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:08:08" (1/1) ... [2018-01-30 01:08:08,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:08:08" (1/1) ... [2018-01-30 01:08:08,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:08:08" (1/1) ... [2018-01-30 01:08:08,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:08:08" (1/1) ... [2018-01-30 01:08:08,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:08:08" (1/1) ... [2018-01-30 01:08:08,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:08:08" (1/1) ... [2018-01-30 01:08:08,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:08:08,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:08:08,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:08:08,463 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:08:08,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:08:08" (1/1) ... No working directory specified, using /home/daniel/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 [2018-01-30 01:08:08,501 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:08:08,501 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:08:08,501 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 01:08:08,502 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:08:08,502 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 01:08:08,502 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-01-30 01:08:08,502 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 01:08:08,502 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:08:08,502 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:08:08,504 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:08:08,504 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:08:08,789 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:08:08,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:08:08 BoogieIcfgContainer [2018-01-30 01:08:08,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:08:08,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:08:08,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:08:08,794 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:08:08,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:08:08" (1/3) ... [2018-01-30 01:08:08,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533c999f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:08:08, skipping insertion in model container [2018-01-30 01:08:08,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:08:08" (2/3) ... [2018-01-30 01:08:08,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533c999f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:08:08, skipping insertion in model container [2018-01-30 01:08:08,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:08:08" (3/3) ... [2018-01-30 01:08:08,798 INFO L107 eAbstractionObserver]: Analyzing ICFG nr3_true-unreach-call.i [2018-01-30 01:08:08,804 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:08:08,809 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 01:08:08,835 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:08:08,835 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:08:08,835 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:08:08,835 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:08:08,835 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:08:08,835 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:08:08,835 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:08:08,835 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:08:08,836 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:08:08,844 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-30 01:08:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 01:08:08,848 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:08:08,849 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:08:08,849 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:08:08,851 INFO L82 PathProgramCache]: Analyzing trace with hash -146207416, now seen corresponding path program 1 times [2018-01-30 01:08:08,852 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:08:08,853 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:08:08,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:08:08,881 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:08:08,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:08:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:08:08,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:08:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:08:08,935 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:08:08,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 01:08:08,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 01:08:08,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 01:08:08,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 01:08:08,945 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-01-30 01:08:08,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:08:08,958 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2018-01-30 01:08:08,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 01:08:08,959 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-30 01:08:08,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:08:08,964 INFO L225 Difference]: With dead ends: 81 [2018-01-30 01:08:08,964 INFO L226 Difference]: Without dead ends: 43 [2018-01-30 01:08:08,966 INFO L553 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 [2018-01-30 01:08:08,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-30 01:08:08,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-30 01:08:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-30 01:08:08,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-30 01:08:08,987 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 24 [2018-01-30 01:08:08,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:08:08,987 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-30 01:08:08,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 01:08:08,987 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-30 01:08:08,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 01:08:08,988 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:08:08,988 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:08:08,988 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:08:08,988 INFO L82 PathProgramCache]: Analyzing trace with hash -16250492, now seen corresponding path program 1 times [2018-01-30 01:08:08,988 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:08:08,989 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:08:08,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:08:08,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:08:08,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:08:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:08:09,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:08:09,521 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 34 DAG size of output 14 [2018-01-30 01:08:09,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:08:09,536 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:08:09,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:08:09,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:08:09,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:08:09,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:08:09,537 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-01-30 01:08:09,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:08:09,661 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-01-30 01:08:09,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:08:09,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-30 01:08:09,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:08:09,663 INFO L225 Difference]: With dead ends: 74 [2018-01-30 01:08:09,663 INFO L226 Difference]: Without dead ends: 61 [2018-01-30 01:08:09,664 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:08:09,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-30 01:08:09,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2018-01-30 01:08:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-30 01:08:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-30 01:08:09,670 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 25 [2018-01-30 01:08:09,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:08:09,670 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-30 01:08:09,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:08:09,671 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-30 01:08:09,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 01:08:09,671 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:08:09,671 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:08:09,671 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:08:09,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1651825929, now seen corresponding path program 1 times [2018-01-30 01:08:09,672 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:08:09,672 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:08:09,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:08:09,673 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:08:09,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:08:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:08:09,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:08:09,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:08:09,713 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:08:09,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:08:09,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:08:09,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:08:09,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:08:09,713 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 3 states. [2018-01-30 01:08:09,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:08:09,747 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2018-01-30 01:08:09,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:08:09,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-01-30 01:08:09,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:08:09,749 INFO L225 Difference]: With dead ends: 79 [2018-01-30 01:08:09,749 INFO L226 Difference]: Without dead ends: 52 [2018-01-30 01:08:09,749 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:08:09,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-30 01:08:09,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2018-01-30 01:08:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-30 01:08:09,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-01-30 01:08:09,754 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 33 [2018-01-30 01:08:09,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:08:09,754 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-01-30 01:08:09,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:08:09,754 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-01-30 01:08:09,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-30 01:08:09,755 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:08:09,755 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:08:09,755 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:08:09,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1500859485, now seen corresponding path program 1 times [2018-01-30 01:08:09,755 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:08:09,755 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:08:09,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:08:09,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:08:09,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:08:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:08:09,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:08:09,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:08:09,858 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:08:09,858 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 01:08:09,864 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:08:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:08:09,886 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:08:09,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:08:09,919 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:08:09,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 01:08:09,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:08:09,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:08:09,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:08:09,920 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2018-01-30 01:08:10,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:08:10,022 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2018-01-30 01:08:10,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:08:10,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-01-30 01:08:10,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:08:10,023 INFO L225 Difference]: With dead ends: 89 [2018-01-30 01:08:10,023 INFO L226 Difference]: Without dead ends: 60 [2018-01-30 01:08:10,024 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:08:10,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-30 01:08:10,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2018-01-30 01:08:10,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-30 01:08:10,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-01-30 01:08:10,029 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 40 [2018-01-30 01:08:10,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:08:10,029 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-01-30 01:08:10,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:08:10,029 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-01-30 01:08:10,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-30 01:08:10,030 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:08:10,030 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:08:10,030 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:08:10,030 INFO L82 PathProgramCache]: Analyzing trace with hash 986494601, now seen corresponding path program 2 times [2018-01-30 01:08:10,030 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:08:10,030 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:08:10,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:08:10,031 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:08:10,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:08:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:08:10,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:08:10,107 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 01:08:10,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:08:10,108 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 01:08:10,116 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:08:10,129 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:08:10,135 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:08:10,139 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:08:10,140 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:08:10,184 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:08:10,201 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:08:10,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2018-01-30 01:08:10,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 01:08:10,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 01:08:10,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 01:08:10,202 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 8 states. [2018-01-30 01:08:10,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:08:10,482 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2018-01-30 01:08:10,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 01:08:10,482 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-01-30 01:08:10,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:08:10,483 INFO L225 Difference]: With dead ends: 99 [2018-01-30 01:08:10,483 INFO L226 Difference]: Without dead ends: 62 [2018-01-30 01:08:10,484 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-01-30 01:08:10,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-30 01:08:10,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-30 01:08:10,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-30 01:08:10,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-30 01:08:10,489 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 47 [2018-01-30 01:08:10,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:08:10,489 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-30 01:08:10,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 01:08:10,490 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-30 01:08:10,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 01:08:10,490 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:08:10,491 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:08:10,491 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:08:10,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1200787069, now seen corresponding path program 1 times [2018-01-30 01:08:10,491 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:08:10,491 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:08:10,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:08:10,492 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:08:10,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:08:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:08:10,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:08:10,876 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:08:10,876 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:08:10,876 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 01:08:10,881 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:08:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:08:10,891 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:08:10,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 01:08:10,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:08:10,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:08:10,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-01-30 01:08:11,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:11,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:11,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-01-30 01:08:11,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:08:11,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:08:11,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:32 [2018-01-30 01:08:11,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:11,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:11,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:11,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 56 [2018-01-30 01:08:11,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-01-30 01:08:11,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-30 01:08:11,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:73 [2018-01-30 01:08:11,361 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:08:11,377 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:08:11,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 23 [2018-01-30 01:08:11,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-30 01:08:11,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-30 01:08:11,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2018-01-30 01:08:11,379 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 23 states. [2018-01-30 01:08:12,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:08:12,621 INFO L93 Difference]: Finished difference Result 212 states and 242 transitions. [2018-01-30 01:08:12,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 01:08:12,622 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2018-01-30 01:08:12,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:08:12,623 INFO L225 Difference]: With dead ends: 212 [2018-01-30 01:08:12,623 INFO L226 Difference]: Without dead ends: 168 [2018-01-30 01:08:12,623 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=308, Invalid=1252, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 01:08:12,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-30 01:08:12,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 119. [2018-01-30 01:08:12,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-30 01:08:12,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2018-01-30 01:08:12,633 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 54 [2018-01-30 01:08:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:08:12,636 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2018-01-30 01:08:12,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-30 01:08:12,636 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2018-01-30 01:08:12,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-30 01:08:12,636 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:08:12,637 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:08:12,637 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:08:12,637 INFO L82 PathProgramCache]: Analyzing trace with hash -997855397, now seen corresponding path program 1 times [2018-01-30 01:08:12,637 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:08:12,637 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:08:12,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:08:12,638 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:08:12,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:08:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:08:12,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:08:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:08:12,947 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:08:12,947 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 01:08:12,952 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:08:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:08:12,963 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:08:13,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 01:08:13,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:08:13,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:08:13,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2018-01-30 01:08:13,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:13,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:13,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 29 [2018-01-30 01:08:13,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:08:13,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:08:13,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-01-30 01:08:13,945 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:08:13,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:08:13,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 33 [2018-01-30 01:08:13,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 01:08:13,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 01:08:13,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 01:08:13,963 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand 33 states. [2018-01-30 01:08:15,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:08:15,476 INFO L93 Difference]: Finished difference Result 280 states and 320 transitions. [2018-01-30 01:08:15,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-30 01:08:15,477 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-01-30 01:08:15,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:08:15,479 INFO L225 Difference]: With dead ends: 280 [2018-01-30 01:08:15,479 INFO L226 Difference]: Without dead ends: 190 [2018-01-30 01:08:15,480 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=545, Invalid=3237, Unknown=0, NotChecked=0, Total=3782 [2018-01-30 01:08:15,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-30 01:08:15,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 131. [2018-01-30 01:08:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-30 01:08:15,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2018-01-30 01:08:15,496 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 64 [2018-01-30 01:08:15,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:08:15,496 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2018-01-30 01:08:15,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 01:08:15,496 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2018-01-30 01:08:15,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-30 01:08:15,497 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:08:15,497 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:08:15,497 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:08:15,497 INFO L82 PathProgramCache]: Analyzing trace with hash -820751687, now seen corresponding path program 2 times [2018-01-30 01:08:15,497 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:08:15,497 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:08:15,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:08:15,498 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:08:15,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:08:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:08:15,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:08:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 01:08:15,831 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:08:15,831 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 01:08:15,837 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:08:15,847 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:08:15,852 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:08:15,853 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:08:15,855 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:08:16,013 INFO L477 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 10 treesize of output 9 [2018-01-30 01:08:16,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:08:16,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:08:16,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-01-30 01:08:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-30 01:08:16,213 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:08:16,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 34 [2018-01-30 01:08:16,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 01:08:16,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 01:08:16,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1018, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 01:08:16,215 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand 34 states. [2018-01-30 01:08:16,939 WARN L143 SmtUtils]: Spent 126ms on a formula simplification that was a NOOP. DAG size: 17 [2018-01-30 01:08:17,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:08:17,907 INFO L93 Difference]: Finished difference Result 292 states and 330 transitions. [2018-01-30 01:08:17,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-01-30 01:08:17,907 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 74 [2018-01-30 01:08:17,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:08:17,908 INFO L225 Difference]: With dead ends: 292 [2018-01-30 01:08:17,908 INFO L226 Difference]: Without dead ends: 203 [2018-01-30 01:08:17,910 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=755, Invalid=5097, Unknown=0, NotChecked=0, Total=5852 [2018-01-30 01:08:17,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-30 01:08:17,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 157. [2018-01-30 01:08:17,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-30 01:08:17,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2018-01-30 01:08:17,925 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 74 [2018-01-30 01:08:17,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:08:17,929 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2018-01-30 01:08:17,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 01:08:17,929 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2018-01-30 01:08:17,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-30 01:08:17,930 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:08:17,930 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:08:17,930 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:08:17,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1656973161, now seen corresponding path program 3 times [2018-01-30 01:08:17,930 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:08:17,930 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:08:17,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:08:17,931 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:08:17,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:08:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:08:17,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:08:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-01-30 01:08:18,363 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:08:18,363 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 01:08:18,368 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:08:18,373 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:08:18,380 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:08:18,382 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:08:18,384 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:08:18,389 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:08:18,391 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:08:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-01-30 01:08:18,641 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:08:18,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-01-30 01:08:18,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-30 01:08:18,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-30 01:08:18,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2018-01-30 01:08:18,642 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand 27 states. [2018-01-30 01:08:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:08:19,394 INFO L93 Difference]: Finished difference Result 283 states and 307 transitions. [2018-01-30 01:08:19,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 01:08:19,394 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2018-01-30 01:08:19,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:08:19,395 INFO L225 Difference]: With dead ends: 283 [2018-01-30 01:08:19,396 INFO L226 Difference]: Without dead ends: 238 [2018-01-30 01:08:19,396 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=366, Invalid=1116, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 01:08:19,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-30 01:08:19,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 174. [2018-01-30 01:08:19,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-30 01:08:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 189 transitions. [2018-01-30 01:08:19,409 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 189 transitions. Word has length 84 [2018-01-30 01:08:19,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:08:19,409 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 189 transitions. [2018-01-30 01:08:19,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-30 01:08:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 189 transitions. [2018-01-30 01:08:19,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-30 01:08:19,410 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:08:19,410 INFO L350 BasicCegarLoop]: trace histogram [8, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:08:19,410 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:08:19,410 INFO L82 PathProgramCache]: Analyzing trace with hash 867792932, now seen corresponding path program 2 times [2018-01-30 01:08:19,410 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:08:19,410 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:08:19,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:08:19,410 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:08:19,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:08:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:08:19,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:08:19,639 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 6 DAG size of output 5 [2018-01-30 01:08:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 8 proven. 124 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-30 01:08:20,055 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:08:20,056 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:08:20,060 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:08:20,065 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:08:20,071 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:08:20,077 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:08:20,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:08:20,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 01:08:20,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:08:20,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:08:20,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-01-30 01:08:20,330 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:20,331 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:20,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-01-30 01:08:20,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:08:20,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:08:20,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:32 [2018-01-30 01:08:20,364 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:20,366 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:20,366 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:20,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 80 [2018-01-30 01:08:20,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-01-30 01:08:20,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-30 01:08:20,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:108 [2018-01-30 01:08:20,701 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:20,702 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:20,704 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:20,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 76 [2018-01-30 01:08:20,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-30 01:08:20,763 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:20,764 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:20,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 70 [2018-01-30 01:08:20,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 01:08:20,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:20,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:20,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:20,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:20,827 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:20,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 129 [2018-01-30 01:08:20,842 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-01-30 01:08:20,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2018-01-30 01:08:20,994 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:127, output treesize:332 [2018-01-30 01:08:21,255 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:21,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:21,292 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:21,313 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:21,313 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:21,314 INFO L303 Elim1Store]: Index analysis took 113 ms [2018-01-30 01:08:21,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 96 [2018-01-30 01:08:21,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:08:21,362 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:21,365 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:21,366 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:21,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:21,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 90 [2018-01-30 01:08:21,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:08:21,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-30 01:08:21,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:87, output treesize:85 [2018-01-30 01:08:21,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:21,622 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:21,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:21,626 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:21,629 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:21,630 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:21,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 139 [2018-01-30 01:08:21,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2018-01-30 01:08:21,773 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:21,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:21,775 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:21,777 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:08:21,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 125 [2018-01-30 01:08:21,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-30 01:08:21,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 23 dim-0 vars, and 7 xjuncts. [2018-01-30 01:08:21,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:109, output treesize:317 [2018-01-30 01:09:14,878 WARN L146 SmtUtils]: Spent 52474ms on a formula simplification. DAG size of input: 155 DAG size of output 136 Received shutdown request... [2018-01-30 01:09:31,616 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-30 01:09:31,617 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 01:09:31,619 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 01:09:31,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:09:31 BoogieIcfgContainer [2018-01-30 01:09:31,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 01:09:31,620 INFO L168 Benchmark]: Toolchain (without parser) took 83282.07 ms. Allocated memory was 151.5 MB in the beginning and 330.3 MB in the end (delta: 178.8 MB). Free memory was 116.5 MB in the beginning and 174.0 MB in the end (delta: -57.4 MB). Peak memory consumption was 121.4 MB. Max. memory is 5.3 GB. [2018-01-30 01:09:31,620 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 151.5 MB. Free memory is still 121.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:09:31,621 INFO L168 Benchmark]: CACSL2BoogieTranslator took 106.75 ms. Allocated memory is still 151.5 MB. Free memory was 116.3 MB in the beginning and 108.0 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 5.3 GB. [2018-01-30 01:09:31,621 INFO L168 Benchmark]: Boogie Preprocessor took 17.28 ms. Allocated memory is still 151.5 MB. Free memory was 108.0 MB in the beginning and 106.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. [2018-01-30 01:09:31,621 INFO L168 Benchmark]: RCFGBuilder took 329.00 ms. Allocated memory is still 151.5 MB. Free memory was 106.4 MB in the beginning and 92.3 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. [2018-01-30 01:09:31,621 INFO L168 Benchmark]: TraceAbstraction took 82826.72 ms. Allocated memory was 151.5 MB in the beginning and 330.3 MB in the end (delta: 178.8 MB). Free memory was 92.1 MB in the beginning and 174.0 MB in the end (delta: -81.8 MB). Peak memory consumption was 97.0 MB. Max. memory is 5.3 GB. [2018-01-30 01:09:31,622 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 151.5 MB. Free memory is still 121.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 106.75 ms. Allocated memory is still 151.5 MB. Free memory was 116.3 MB in the beginning and 108.0 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 17.28 ms. Allocated memory is still 151.5 MB. Free memory was 108.0 MB in the beginning and 106.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 329.00 ms. Allocated memory is still 151.5 MB. Free memory was 106.4 MB in the beginning and 92.3 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 82826.72 ms. Allocated memory was 151.5 MB in the beginning and 330.3 MB in the end (delta: 178.8 MB). Free memory was 92.1 MB in the beginning and 174.0 MB in the end (delta: -81.8 MB). Peak memory consumption was 97.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 138. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 1 error locations. TIMEOUT Result, 82.7s OverallTime, 10 OverallIterations, 8 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 390 SDtfs, 1013 SDslu, 2570 SDs, 0 SdLazy, 2887 SolverSat, 303 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 564 GetRequests, 319 SyntacticMatches, 12 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3199 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred 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.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 244 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 808 NumberOfCodeBlocks, 801 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 793 ConstructedInterpolants, 41 QuantifiedInterpolants, 516463 SizeOfPredicates, 49 NumberOfNonLiveVariables, 576 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 172/392 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nr3_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_01-09-31-625.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nr3_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_01-09-31-625.csv Completed graceful shutdown