./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.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/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.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 5daa60820c0033439eb2fc136c4a16d466a909bc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 11:21:48,876 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 11:21:48,878 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 11:21:48,894 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 11:21:48,894 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 11:21:48,898 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 11:21:48,899 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 11:21:48,901 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 11:21:48,903 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 11:21:48,903 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 11:21:48,905 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 11:21:48,905 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 11:21:48,906 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 11:21:48,907 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 11:21:48,908 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 11:21:48,909 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 11:21:48,910 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 11:21:48,913 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 11:21:48,915 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 11:21:48,917 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 11:21:48,921 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 11:21:48,922 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 11:21:48,926 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 11:21:48,927 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 11:21:48,927 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 11:21:48,928 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 11:21:48,929 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 11:21:48,933 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 11:21:48,933 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 11:21:48,934 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 11:21:48,935 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 11:21:48,935 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 11:21:48,936 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 11:21:48,936 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 11:21:48,937 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 11:21:48,938 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 11:21:48,938 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 11:21:48,953 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 11:21:48,953 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 11:21:48,954 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 11:21:48,955 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 11:21:48,955 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 11:21:48,955 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 11:21:48,955 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 11:21:48,955 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 11:21:48,956 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 11:21:48,956 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 11:21:48,956 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 11:21:48,956 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 11:21:48,956 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 11:21:48,956 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 11:21:48,957 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 11:21:48,958 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 11:21:48,958 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 11:21:48,958 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 11:21:48,959 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 11:21:48,959 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 11:21:48,959 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 11:21:48,959 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:21:48,959 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 11:21:48,959 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 11:21:48,960 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 11:21:48,961 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 11:21:48,961 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 11:21:48,961 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 11:21:48,961 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 -> 5daa60820c0033439eb2fc136c4a16d466a909bc [2019-01-12 11:21:49,012 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 11:21:49,025 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 11:21:49,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 11:21:49,030 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 11:21:49,031 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 11:21:49,032 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2019-01-12 11:21:49,089 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fae133f69/244153a1a37b4f0d8bdc946215b787b6/FLAGc9aa2aacf [2019-01-12 11:21:49,473 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 11:21:49,474 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2019-01-12 11:21:49,481 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fae133f69/244153a1a37b4f0d8bdc946215b787b6/FLAGc9aa2aacf [2019-01-12 11:21:49,868 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fae133f69/244153a1a37b4f0d8bdc946215b787b6 [2019-01-12 11:21:49,875 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 11:21:49,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 11:21:49,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 11:21:49,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 11:21:49,882 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 11:21:49,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:21:49" (1/1) ... [2019-01-12 11:21:49,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1a718d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:21:49, skipping insertion in model container [2019-01-12 11:21:49,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:21:49" (1/1) ... [2019-01-12 11:21:49,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 11:21:49,928 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 11:21:50,145 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:21:50,151 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 11:21:50,185 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:21:50,204 INFO L195 MainTranslator]: Completed translation [2019-01-12 11:21:50,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:21:50 WrapperNode [2019-01-12 11:21:50,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 11:21:50,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 11:21:50,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 11:21:50,206 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 11:21:50,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:21:50" (1/1) ... [2019-01-12 11:21:50,225 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:21:50" (1/1) ... [2019-01-12 11:21:50,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 11:21:50,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 11:21:50,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 11:21:50,259 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 11:21:50,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:21:50" (1/1) ... [2019-01-12 11:21:50,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:21:50" (1/1) ... [2019-01-12 11:21:50,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:21:50" (1/1) ... [2019-01-12 11:21:50,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:21:50" (1/1) ... [2019-01-12 11:21:50,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:21:50" (1/1) ... [2019-01-12 11:21:50,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:21:50" (1/1) ... [2019-01-12 11:21:50,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:21:50" (1/1) ... [2019-01-12 11:21:50,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 11:21:50,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 11:21:50,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 11:21:50,380 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 11:21:50,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:21:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:21:50,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 11:21:50,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 11:21:51,150 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 11:21:51,151 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 11:21:51,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:21:51 BoogieIcfgContainer [2019-01-12 11:21:51,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 11:21:51,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 11:21:51,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 11:21:51,156 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 11:21:51,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:21:49" (1/3) ... [2019-01-12 11:21:51,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52078794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:21:51, skipping insertion in model container [2019-01-12 11:21:51,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:21:50" (2/3) ... [2019-01-12 11:21:51,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52078794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:21:51, skipping insertion in model container [2019-01-12 11:21:51,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:21:51" (3/3) ... [2019-01-12 11:21:51,160 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2019-01-12 11:21:51,169 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 11:21:51,177 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-01-12 11:21:51,194 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-01-12 11:21:51,225 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 11:21:51,225 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 11:21:51,226 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 11:21:51,226 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 11:21:51,226 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 11:21:51,226 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 11:21:51,226 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 11:21:51,226 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 11:21:51,227 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 11:21:51,242 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-01-12 11:21:51,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 11:21:51,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:21:51,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:21:51,251 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:21:51,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:21:51,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1241029004, now seen corresponding path program 1 times [2019-01-12 11:21:51,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:21:51,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:21:51,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:51,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:21:51,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:21:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:21:51,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:21:51,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 11:21:51,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 11:21:51,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 11:21:51,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:21:51,421 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2019-01-12 11:21:51,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:21:51,467 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2019-01-12 11:21:51,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 11:21:51,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-12 11:21:51,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:21:51,480 INFO L225 Difference]: With dead ends: 83 [2019-01-12 11:21:51,480 INFO L226 Difference]: Without dead ends: 72 [2019-01-12 11:21:51,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:21:51,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-12 11:21:51,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2019-01-12 11:21:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-12 11:21:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-01-12 11:21:51,518 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 9 [2019-01-12 11:21:51,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:21:51,519 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-01-12 11:21:51,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 11:21:51,519 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-01-12 11:21:51,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 11:21:51,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:21:51,520 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:21:51,521 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:21:51,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:21:51,521 INFO L82 PathProgramCache]: Analyzing trace with hash -182802478, now seen corresponding path program 1 times [2019-01-12 11:21:51,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:21:51,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:21:51,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:51,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:21:51,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:21:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:21:51,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:21:51,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 11:21:51,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:21:51,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:21:51,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:21:51,655 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 5 states. [2019-01-12 11:21:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:21:52,013 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2019-01-12 11:21:52,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 11:21:52,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-12 11:21:52,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:21:52,016 INFO L225 Difference]: With dead ends: 73 [2019-01-12 11:21:52,016 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 11:21:52,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:21:52,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 11:21:52,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2019-01-12 11:21:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 11:21:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-01-12 11:21:52,027 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 10 [2019-01-12 11:21:52,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:21:52,027 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-01-12 11:21:52,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:21:52,028 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-01-12 11:21:52,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 11:21:52,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:21:52,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:21:52,030 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:21:52,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:21:52,030 INFO L82 PathProgramCache]: Analyzing trace with hash -179156060, now seen corresponding path program 1 times [2019-01-12 11:21:52,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:21:52,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:21:52,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:52,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:21:52,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:21:52,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:21:52,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:21:52,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 11:21:52,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 11:21:52,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 11:21:52,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 11:21:52,108 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 4 states. [2019-01-12 11:21:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:21:52,261 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2019-01-12 11:21:52,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 11:21:52,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-12 11:21:52,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:21:52,263 INFO L225 Difference]: With dead ends: 143 [2019-01-12 11:21:52,263 INFO L226 Difference]: Without dead ends: 93 [2019-01-12 11:21:52,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:21:52,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-12 11:21:52,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2019-01-12 11:21:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-12 11:21:52,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-01-12 11:21:52,276 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 10 [2019-01-12 11:21:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:21:52,276 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-01-12 11:21:52,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 11:21:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-01-12 11:21:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 11:21:52,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:21:52,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:21:52,278 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:21:52,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:21:52,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1258866483, now seen corresponding path program 1 times [2019-01-12 11:21:52,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:21:52,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:21:52,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:52,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:21:52,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:21:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:21:52,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:21:52,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:21:52,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:21:52,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:21:52,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:21:52,439 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2019-01-12 11:21:52,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:21:52,695 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2019-01-12 11:21:52,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:21:52,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-01-12 11:21:52,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:21:52,698 INFO L225 Difference]: With dead ends: 94 [2019-01-12 11:21:52,698 INFO L226 Difference]: Without dead ends: 92 [2019-01-12 11:21:52,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:21:52,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-12 11:21:52,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 50. [2019-01-12 11:21:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-12 11:21:52,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-01-12 11:21:52,707 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 11 [2019-01-12 11:21:52,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:21:52,707 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-01-12 11:21:52,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:21:52,708 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-01-12 11:21:52,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 11:21:52,708 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:21:52,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:21:52,709 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:21:52,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:21:52,710 INFO L82 PathProgramCache]: Analyzing trace with hash 420636790, now seen corresponding path program 1 times [2019-01-12 11:21:52,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:21:52,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:21:52,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:52,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:21:52,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:21:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:21:52,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:21:52,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 11:21:52,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:21:52,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:21:52,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:21:52,966 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-01-12 11:21:53,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:21:53,278 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2019-01-12 11:21:53,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:21:53,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-01-12 11:21:53,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:21:53,280 INFO L225 Difference]: With dead ends: 87 [2019-01-12 11:21:53,280 INFO L226 Difference]: Without dead ends: 85 [2019-01-12 11:21:53,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:21:53,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-12 11:21:53,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 48. [2019-01-12 11:21:53,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-12 11:21:53,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-01-12 11:21:53,288 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 12 [2019-01-12 11:21:53,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:21:53,289 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-01-12 11:21:53,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:21:53,289 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-01-12 11:21:53,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 11:21:53,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:21:53,290 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:21:53,290 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:21:53,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:21:53,291 INFO L82 PathProgramCache]: Analyzing trace with hash -370151221, now seen corresponding path program 1 times [2019-01-12 11:21:53,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:21:53,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:21:53,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:53,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:21:53,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:21:53,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:21:53,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:21:53,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:21:53,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:21:53,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:21:53,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:21:53,434 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 8 states. [2019-01-12 11:21:53,766 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 11:21:54,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:21:54,010 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-01-12 11:21:54,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 11:21:54,010 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-01-12 11:21:54,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:21:54,011 INFO L225 Difference]: With dead ends: 89 [2019-01-12 11:21:54,011 INFO L226 Difference]: Without dead ends: 87 [2019-01-12 11:21:54,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-12 11:21:54,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-12 11:21:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 46. [2019-01-12 11:21:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-12 11:21:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-01-12 11:21:54,020 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 12 [2019-01-12 11:21:54,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:21:54,020 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-01-12 11:21:54,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:21:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-01-12 11:21:54,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 11:21:54,021 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:21:54,021 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:21:54,022 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:21:54,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:21:54,022 INFO L82 PathProgramCache]: Analyzing trace with hash 154842714, now seen corresponding path program 1 times [2019-01-12 11:21:54,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:21:54,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:21:54,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:54,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:21:54,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:21:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:21:54,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:21:54,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 11:21:54,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:21:54,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:21:54,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:21:54,083 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2019-01-12 11:21:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:21:54,290 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-01-12 11:21:54,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 11:21:54,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-12 11:21:54,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:21:54,292 INFO L225 Difference]: With dead ends: 75 [2019-01-12 11:21:54,292 INFO L226 Difference]: Without dead ends: 73 [2019-01-12 11:21:54,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:21:54,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-12 11:21:54,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2019-01-12 11:21:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-12 11:21:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-01-12 11:21:54,307 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 13 [2019-01-12 11:21:54,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:21:54,309 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-01-12 11:21:54,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:21:54,309 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-01-12 11:21:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 11:21:54,310 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:21:54,310 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:21:54,310 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:21:54,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:21:54,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1410218132, now seen corresponding path program 1 times [2019-01-12 11:21:54,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:21:54,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:21:54,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:54,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:21:54,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:21:54,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:21:54,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:21:54,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:21:54,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:21:54,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:21:54,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:21:54,539 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2019-01-12 11:21:54,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:21:54,764 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2019-01-12 11:21:54,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:21:54,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-01-12 11:21:54,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:21:54,766 INFO L225 Difference]: With dead ends: 85 [2019-01-12 11:21:54,766 INFO L226 Difference]: Without dead ends: 83 [2019-01-12 11:21:54,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:21:54,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-12 11:21:54,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 42. [2019-01-12 11:21:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-12 11:21:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-01-12 11:21:54,774 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2019-01-12 11:21:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:21:54,775 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-01-12 11:21:54,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:21:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-01-12 11:21:54,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 11:21:54,775 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:21:54,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:21:54,776 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:21:54,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:21:54,777 INFO L82 PathProgramCache]: Analyzing trace with hash 505160957, now seen corresponding path program 1 times [2019-01-12 11:21:54,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:21:54,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:21:54,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:54,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:21:54,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:21:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:21:54,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:21:54,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:21:54,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:21:54,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:21:54,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:21:54,851 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 6 states. [2019-01-12 11:21:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:21:55,061 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-01-12 11:21:55,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:21:55,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-12 11:21:55,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:21:55,063 INFO L225 Difference]: With dead ends: 67 [2019-01-12 11:21:55,063 INFO L226 Difference]: Without dead ends: 65 [2019-01-12 11:21:55,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-12 11:21:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-12 11:21:55,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2019-01-12 11:21:55,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-12 11:21:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-01-12 11:21:55,070 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 14 [2019-01-12 11:21:55,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:21:55,070 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-12 11:21:55,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:21:55,070 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-01-12 11:21:55,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 11:21:55,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:21:55,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:21:55,072 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:21:55,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:21:55,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1519875391, now seen corresponding path program 1 times [2019-01-12 11:21:55,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:21:55,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:21:55,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:55,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:21:55,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:21:55,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:21:55,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:21:55,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 11:21:55,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:21:55,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:21:55,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:21:55,160 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2019-01-12 11:21:55,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:21:55,274 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2019-01-12 11:21:55,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 11:21:55,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-01-12 11:21:55,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:21:55,276 INFO L225 Difference]: With dead ends: 67 [2019-01-12 11:21:55,276 INFO L226 Difference]: Without dead ends: 65 [2019-01-12 11:21:55,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:21:55,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-12 11:21:55,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2019-01-12 11:21:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-12 11:21:55,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-01-12 11:21:55,283 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2019-01-12 11:21:55,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:21:55,283 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-01-12 11:21:55,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:21:55,284 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-01-12 11:21:55,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 11:21:55,284 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:21:55,284 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:21:55,285 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:21:55,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:21:55,285 INFO L82 PathProgramCache]: Analyzing trace with hash 128507268, now seen corresponding path program 1 times [2019-01-12 11:21:55,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:21:55,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:21:55,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:55,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:21:55,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:21:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:21:55,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:21:55,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 11:21:55,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:21:55,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:21:55,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:21:55,371 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 7 states. [2019-01-12 11:21:55,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:21:55,606 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2019-01-12 11:21:55,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:21:55,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-01-12 11:21:55,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:21:55,608 INFO L225 Difference]: With dead ends: 65 [2019-01-12 11:21:55,609 INFO L226 Difference]: Without dead ends: 63 [2019-01-12 11:21:55,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-12 11:21:55,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-12 11:21:55,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 36. [2019-01-12 11:21:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-12 11:21:55,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-01-12 11:21:55,618 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2019-01-12 11:21:55,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:21:55,618 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-01-12 11:21:55,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:21:55,619 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-01-12 11:21:55,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 11:21:55,619 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:21:55,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:21:55,620 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:21:55,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:21:55,621 INFO L82 PathProgramCache]: Analyzing trace with hash -311237848, now seen corresponding path program 1 times [2019-01-12 11:21:55,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:21:55,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:21:55,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:55,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:21:55,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:21:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:21:55,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:21:55,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:21:55,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:21:55,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:21:55,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:21:55,713 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2019-01-12 11:21:55,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:21:55,883 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2019-01-12 11:21:55,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:21:55,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-12 11:21:55,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:21:55,897 INFO L225 Difference]: With dead ends: 86 [2019-01-12 11:21:55,897 INFO L226 Difference]: Without dead ends: 84 [2019-01-12 11:21:55,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:21:55,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-12 11:21:55,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 34. [2019-01-12 11:21:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-12 11:21:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-01-12 11:21:55,907 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 17 [2019-01-12 11:21:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:21:55,908 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-01-12 11:21:55,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:21:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-01-12 11:21:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 11:21:55,908 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:21:55,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:21:55,909 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:21:55,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:21:55,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1058434549, now seen corresponding path program 1 times [2019-01-12 11:21:55,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:21:55,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:21:55,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:55,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:21:55,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:21:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:21:56,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:21:56,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:21:56,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:21:56,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:21:56,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:21:56,263 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 8 states. [2019-01-12 11:21:56,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:21:56,954 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2019-01-12 11:21:56,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 11:21:56,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-01-12 11:21:56,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:21:56,957 INFO L225 Difference]: With dead ends: 68 [2019-01-12 11:21:56,957 INFO L226 Difference]: Without dead ends: 66 [2019-01-12 11:21:56,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-01-12 11:21:56,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-12 11:21:56,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 32. [2019-01-12 11:21:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 11:21:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-01-12 11:21:56,964 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2019-01-12 11:21:56,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:21:56,964 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-01-12 11:21:56,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:21:56,965 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-01-12 11:21:56,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 11:21:56,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:21:56,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:21:56,966 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:21:56,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:21:56,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1548271503, now seen corresponding path program 1 times [2019-01-12 11:21:56,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:21:56,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:21:56,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:56,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:21:56,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:21:57,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:21:57,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:21:57,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:21:57,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:21:57,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:21:57,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:21:57,124 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 8 states. [2019-01-12 11:21:57,931 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 11:21:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:21:58,411 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2019-01-12 11:21:58,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 11:21:58,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-01-12 11:21:58,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:21:58,414 INFO L225 Difference]: With dead ends: 103 [2019-01-12 11:21:58,414 INFO L226 Difference]: Without dead ends: 101 [2019-01-12 11:21:58,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-12 11:21:58,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-12 11:21:58,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 30. [2019-01-12 11:21:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-12 11:21:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-01-12 11:21:58,425 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2019-01-12 11:21:58,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:21:58,425 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-01-12 11:21:58,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:21:58,426 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-01-12 11:21:58,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 11:21:58,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:21:58,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:21:58,427 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:21:58,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:21:58,427 INFO L82 PathProgramCache]: Analyzing trace with hash 751780498, now seen corresponding path program 1 times [2019-01-12 11:21:58,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:21:58,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:21:58,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:58,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:21:58,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:21:58,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:21:58,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:21:58,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:21:58,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:21:58,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:21:58,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:21:58,618 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 8 states. [2019-01-12 11:21:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:21:59,009 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2019-01-12 11:21:59,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 11:21:59,010 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-01-12 11:21:59,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:21:59,011 INFO L225 Difference]: With dead ends: 66 [2019-01-12 11:21:59,011 INFO L226 Difference]: Without dead ends: 64 [2019-01-12 11:21:59,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-01-12 11:21:59,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-12 11:21:59,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 28. [2019-01-12 11:21:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 11:21:59,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-01-12 11:21:59,019 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2019-01-12 11:21:59,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:21:59,019 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-01-12 11:21:59,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:21:59,019 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-01-12 11:21:59,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 11:21:59,020 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:21:59,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:21:59,020 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:21:59,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:21:59,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1830363126, now seen corresponding path program 1 times [2019-01-12 11:21:59,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:21:59,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:21:59,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:59,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:21:59,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:21:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:21:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:21:59,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:21:59,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 11:21:59,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:21:59,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:21:59,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:21:59,099 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2019-01-12 11:21:59,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:21:59,490 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2019-01-12 11:21:59,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:21:59,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-12 11:21:59,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:21:59,491 INFO L225 Difference]: With dead ends: 82 [2019-01-12 11:21:59,491 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 11:21:59,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-12 11:21:59,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 11:21:59,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 11:21:59,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 11:21:59,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 11:21:59,493 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-01-12 11:21:59,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:21:59,493 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 11:21:59,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:21:59,493 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 11:21:59,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 11:21:59,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 11:21:59,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:21:59,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:21:59,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:21:59,682 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 86 [2019-01-12 11:21:59,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:21:59,804 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 14 [2019-01-12 11:21:59,983 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 72 [2019-01-12 11:22:01,477 WARN L181 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 86 DAG size of output: 21 [2019-01-12 11:22:01,687 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 35 [2019-01-12 11:22:01,690 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 120) no Hoare annotation was computed. [2019-01-12 11:22:01,691 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 260) no Hoare annotation was computed. [2019-01-12 11:22:01,691 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 281) no Hoare annotation was computed. [2019-01-12 11:22:01,691 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 200) no Hoare annotation was computed. [2019-01-12 11:22:01,691 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 124) no Hoare annotation was computed. [2019-01-12 11:22:01,692 INFO L444 ceAbstractionStarter]: At program point L259(lines 26 301) the Hoare annotation is: (let ((.cse0 (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0))) (or (and (and (and (<= 0 ULTIMATE.start_main_~main__j~0) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__len~0)) .cse0) (<= 0 ULTIMATE.start_main_~main__i~0)) (let ((.cse2 (<= (+ ULTIMATE.start_main_~main__j~0 4) ULTIMATE.start_main_~main__bufsize~0))) (let ((.cse1 (and (let ((.cse3 (<= 1 ULTIMATE.start_main_~main__i~0))) (or (and .cse3 .cse2) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse3))) (<= 1 ULTIMATE.start_main_~main__j~0)))) (or (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~14 0)) .cse1 .cse0) (and .cse1 .cse0 .cse2)))))) [2019-01-12 11:22:01,692 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 11:22:01,692 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 11:22:01,692 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 280) no Hoare annotation was computed. [2019-01-12 11:22:01,692 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 11:22:01,692 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 266) no Hoare annotation was computed. [2019-01-12 11:22:01,692 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 11:22:01,692 INFO L448 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-01-12 11:22:01,693 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2019-01-12 11:22:01,693 INFO L448 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-01-12 11:22:01,693 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 270) no Hoare annotation was computed. [2019-01-12 11:22:01,693 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-01-12 11:22:01,693 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-01-12 11:22:01,693 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2019-01-12 11:22:01,693 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 272) no Hoare annotation was computed. [2019-01-12 11:22:01,693 INFO L448 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-01-12 11:22:01,694 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-01-12 11:22:01,694 INFO L448 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2019-01-12 11:22:01,694 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 276) no Hoare annotation was computed. [2019-01-12 11:22:01,694 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 136) no Hoare annotation was computed. [2019-01-12 11:22:01,694 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2019-01-12 11:22:01,694 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 118) no Hoare annotation was computed. [2019-01-12 11:22:01,694 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 295) no Hoare annotation was computed. [2019-01-12 11:22:01,694 INFO L448 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-01-12 11:22:01,695 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2019-01-12 11:22:01,695 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 122) no Hoare annotation was computed. [2019-01-12 11:22:01,695 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 307) no Hoare annotation was computed. [2019-01-12 11:22:01,695 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 262) no Hoare annotation was computed. [2019-01-12 11:22:01,695 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 11:22:01,696 INFO L448 ceAbstractionStarter]: For program point L40(lines 40 283) no Hoare annotation was computed. [2019-01-12 11:22:01,696 INFO L444 ceAbstractionStarter]: At program point L288(lines 33 289) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__j~0 5) ULTIMATE.start_main_~main__bufsize~0) (<= 0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__len~0) (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0) (<= 0 ULTIMATE.start_main_~main__j~0)) [2019-01-12 11:22:01,696 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 11:22:01,696 INFO L448 ceAbstractionStarter]: For program point L222(lines 222 264) no Hoare annotation was computed. [2019-01-12 11:22:01,696 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 11:22:01,696 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2019-01-12 11:22:01,697 INFO L451 ceAbstractionStarter]: At program point L305(lines 8 308) the Hoare annotation is: true [2019-01-12 11:22:01,697 INFO L448 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-01-12 11:22:01,697 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 268) no Hoare annotation was computed. [2019-01-12 11:22:01,697 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 289) no Hoare annotation was computed. [2019-01-12 11:22:01,697 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 11:22:01,697 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-01-12 11:22:01,697 INFO L448 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-01-12 11:22:01,698 INFO L448 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2019-01-12 11:22:01,698 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 240) no Hoare annotation was computed. [2019-01-12 11:22:01,698 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-01-12 11:22:01,698 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2019-01-12 11:22:01,698 INFO L448 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2019-01-12 11:22:01,698 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2019-01-12 11:22:01,698 INFO L448 ceAbstractionStarter]: For program point L158(lines 158 274) no Hoare annotation was computed. [2019-01-12 11:22:01,699 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2019-01-12 11:22:01,699 INFO L444 ceAbstractionStarter]: At program point L299(lines 20 307) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0)) [2019-01-12 11:22:01,699 INFO L448 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-01-12 11:22:01,699 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2019-01-12 11:22:01,699 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 278) no Hoare annotation was computed. [2019-01-12 11:22:01,699 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2019-01-12 11:22:01,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:22:01 BoogieIcfgContainer [2019-01-12 11:22:01,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 11:22:01,721 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 11:22:01,721 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 11:22:01,721 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 11:22:01,721 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:21:51" (3/4) ... [2019-01-12 11:22:01,725 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 11:22:01,743 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 11:22:01,744 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 11:22:01,840 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 11:22:01,840 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 11:22:01,841 INFO L168 Benchmark]: Toolchain (without parser) took 11966.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 285.7 MB). Free memory was 946.0 MB in the beginning and 1.3 GB in the end (delta: -336.4 MB). Peak memory consumption was 351.4 MB. Max. memory is 11.5 GB. [2019-01-12 11:22:01,842 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-12 11:22:01,843 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.81 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 11:22:01,843 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.30 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 11:22:01,843 INFO L168 Benchmark]: Boogie Preprocessor took 120.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-12 11:22:01,844 INFO L168 Benchmark]: RCFGBuilder took 772.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-01-12 11:22:01,844 INFO L168 Benchmark]: TraceAbstraction took 10566.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 794.6 MB in the end (delta: 301.9 MB). Peak memory consumption was 368.5 MB. Max. memory is 11.5 GB. [2019-01-12 11:22:01,845 INFO L168 Benchmark]: Witness Printer took 119.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 86.5 MB). Free memory was 794.6 MB in the beginning and 1.3 GB in the end (delta: -487.8 MB). Peak memory consumption was 832.3 kB. Max. memory is 11.5 GB. [2019-01-12 11:22:01,848 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 327.81 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 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 52.30 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 120.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 772.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10566.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 794.6 MB in the end (delta: 301.9 MB). Peak memory consumption was 368.5 MB. Max. memory is 11.5 GB. * Witness Printer took 119.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 86.5 MB). Free memory was 794.6 MB in the beginning and 1.3 GB in the end (delta: -487.8 MB). Peak memory consumption was 832.3 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 200]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 160]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 240]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 107]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((main__j + 5 <= main__bufsize && 0 <= main__i) && main__i + 1 <= main__len) && main__limit + 4 <= main__bufsize) && 0 <= main__j - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= main__i && main__limit + 4 <= main__bufsize - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((0 <= main__j && main__i + 1 <= main__len) && main__limit + 4 <= main__bufsize) && 0 <= main__i) || ((!(__VERIFIER_assert__cond == 0) && ((1 <= main__i && main__j + 4 <= main__bufsize) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__i)) && 1 <= main__j) && main__limit + 4 <= main__bufsize) || (((((1 <= main__i && main__j + 4 <= main__bufsize) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__i)) && 1 <= main__j) && main__limit + 4 <= main__bufsize) && main__j + 4 <= main__bufsize) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 16 error locations. SAFE Result, 10.4s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 703 SDtfs, 1740 SDslu, 714 SDs, 0 SdLazy, 1623 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, 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, 16 MinimizatonAttempts, 536 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 22 NumberOfFragments, 121 HoareAnnotationTreeSize, 4 FomulaSimplifications, 3751018988 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1111887 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 12103 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...