./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -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 31de2fb67e84e52bb7705ac8720e6b139fef2d91 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 04:25:22,387 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 04:25:22,389 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 04:25:22,403 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 04:25:22,403 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 04:25:22,405 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 04:25:22,406 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 04:25:22,408 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 04:25:22,410 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 04:25:22,411 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 04:25:22,412 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 04:25:22,413 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 04:25:22,414 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 04:25:22,415 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 04:25:22,416 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 04:25:22,417 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 04:25:22,418 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 04:25:22,420 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 04:25:22,423 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 04:25:22,424 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 04:25:22,426 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 04:25:22,427 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 04:25:22,430 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 04:25:22,430 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 04:25:22,430 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 04:25:22,431 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 04:25:22,433 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 04:25:22,434 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 04:25:22,435 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 04:25:22,436 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 04:25:22,436 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 04:25:22,436 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 04:25:22,437 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 04:25:22,437 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 04:25:22,439 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 04:25:22,439 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 04:25:22,440 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 04:25:22,465 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 04:25:22,465 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 04:25:22,466 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 04:25:22,466 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 04:25:22,467 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 04:25:22,467 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 04:25:22,467 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 04:25:22,467 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 04:25:22,467 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 04:25:22,468 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 04:25:22,468 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 04:25:22,468 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 04:25:22,468 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 04:25:22,468 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 04:25:22,468 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 04:25:22,469 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 04:25:22,469 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 04:25:22,469 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 04:25:22,469 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 04:25:22,469 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 04:25:22,469 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 04:25:22,470 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:25:22,470 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 04:25:22,470 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 04:25:22,470 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 04:25:22,470 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 04:25:22,471 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 04:25:22,471 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 04:25:22,471 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 -> 31de2fb67e84e52bb7705ac8720e6b139fef2d91 [2018-12-31 04:25:22,516 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 04:25:22,531 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 04:25:22,537 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 04:25:22,539 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 04:25:22,539 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 04:25:22,540 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-12-31 04:25:22,602 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14a50522f/3c4fc1db41a94052ba91fc8033067072/FLAG39432616b [2018-12-31 04:25:23,150 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 04:25:23,150 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-12-31 04:25:23,164 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14a50522f/3c4fc1db41a94052ba91fc8033067072/FLAG39432616b [2018-12-31 04:25:23,418 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14a50522f/3c4fc1db41a94052ba91fc8033067072 [2018-12-31 04:25:23,422 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 04:25:23,424 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 04:25:23,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 04:25:23,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 04:25:23,429 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 04:25:23,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:25:23" (1/1) ... [2018-12-31 04:25:23,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e33331b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:23, skipping insertion in model container [2018-12-31 04:25:23,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:25:23" (1/1) ... [2018-12-31 04:25:23,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 04:25:23,490 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 04:25:23,923 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:25:23,938 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 04:25:24,032 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:25:24,163 INFO L195 MainTranslator]: Completed translation [2018-12-31 04:25:24,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:24 WrapperNode [2018-12-31 04:25:24,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 04:25:24,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 04:25:24,165 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 04:25:24,165 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 04:25:24,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:24" (1/1) ... [2018-12-31 04:25:24,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:24" (1/1) ... [2018-12-31 04:25:24,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 04:25:24,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 04:25:24,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 04:25:24,226 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 04:25:24,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:24" (1/1) ... [2018-12-31 04:25:24,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:24" (1/1) ... [2018-12-31 04:25:24,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:24" (1/1) ... [2018-12-31 04:25:24,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:24" (1/1) ... [2018-12-31 04:25:24,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:24" (1/1) ... [2018-12-31 04:25:24,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:24" (1/1) ... [2018-12-31 04:25:24,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:24" (1/1) ... [2018-12-31 04:25:24,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 04:25:24,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 04:25:24,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 04:25:24,267 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 04:25:24,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:24" (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 [2018-12-31 04:25:24,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2018-12-31 04:25:24,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-31 04:25:24,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-31 04:25:24,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 04:25:24,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 04:25:24,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 04:25:25,261 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 04:25:25,261 INFO L280 CfgBuilder]: Removed 34 assue(true) statements. [2018-12-31 04:25:25,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:25:25 BoogieIcfgContainer [2018-12-31 04:25:25,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 04:25:25,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 04:25:25,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 04:25:25,267 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 04:25:25,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 04:25:23" (1/3) ... [2018-12-31 04:25:25,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fce7708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:25:25, skipping insertion in model container [2018-12-31 04:25:25,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:24" (2/3) ... [2018-12-31 04:25:25,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fce7708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:25:25, skipping insertion in model container [2018-12-31 04:25:25,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:25:25" (3/3) ... [2018-12-31 04:25:25,270 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-12-31 04:25:25,280 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 04:25:25,290 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-12-31 04:25:25,308 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-12-31 04:25:25,342 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 04:25:25,343 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 04:25:25,343 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 04:25:25,343 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 04:25:25,344 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 04:25:25,344 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 04:25:25,344 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 04:25:25,344 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 04:25:25,344 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 04:25:25,366 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-12-31 04:25:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-31 04:25:25,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:25,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-31 04:25:25,377 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:25,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:25,382 INFO L82 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2018-12-31 04:25:25,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:25,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:25,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:25,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:25,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:25,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:25,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:25,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 04:25:25,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 04:25:25,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 04:25:25,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 04:25:25,572 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 3 states. [2018-12-31 04:25:25,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:25,667 INFO L93 Difference]: Finished difference Result 182 states and 300 transitions. [2018-12-31 04:25:25,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 04:25:25,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-31 04:25:25,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:25,680 INFO L225 Difference]: With dead ends: 182 [2018-12-31 04:25:25,680 INFO L226 Difference]: Without dead ends: 96 [2018-12-31 04:25:25,684 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 [2018-12-31 04:25:25,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-31 04:25:25,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2018-12-31 04:25:25,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-31 04:25:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-12-31 04:25:25,726 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 4 [2018-12-31 04:25:25,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:25,726 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-12-31 04:25:25,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 04:25:25,727 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-12-31 04:25:25,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 04:25:25,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:25,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:25,728 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:25,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:25,729 INFO L82 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2018-12-31 04:25:25,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:25,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:25,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:25,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:25,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:25,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:25,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 04:25:25,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 04:25:25,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 04:25:25,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 04:25:25,786 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 3 states. [2018-12-31 04:25:25,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:25,864 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-12-31 04:25:25,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 04:25:25,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-31 04:25:25,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:25,867 INFO L225 Difference]: With dead ends: 81 [2018-12-31 04:25:25,867 INFO L226 Difference]: Without dead ends: 79 [2018-12-31 04:25:25,868 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 [2018-12-31 04:25:25,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-31 04:25:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-31 04:25:25,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-31 04:25:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2018-12-31 04:25:25,877 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 10 [2018-12-31 04:25:25,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:25,878 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2018-12-31 04:25:25,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 04:25:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2018-12-31 04:25:25,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 04:25:25,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:25,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:25,879 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:25,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:25,880 INFO L82 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2018-12-31 04:25:25,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:25,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:25,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:25,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:25,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:25,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:25,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:25,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:25:25,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:25:25,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:25:25,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:25:25,986 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 4 states. [2018-12-31 04:25:26,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:26,172 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-12-31 04:25:26,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:25:26,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-31 04:25:26,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:26,174 INFO L225 Difference]: With dead ends: 80 [2018-12-31 04:25:26,174 INFO L226 Difference]: Without dead ends: 78 [2018-12-31 04:25:26,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:25:26,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-31 04:25:26,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-12-31 04:25:26,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-31 04:25:26,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-12-31 04:25:26,184 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 10 [2018-12-31 04:25:26,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:26,185 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-12-31 04:25:26,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:25:26,185 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-12-31 04:25:26,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 04:25:26,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:26,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:26,186 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:26,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:26,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2018-12-31 04:25:26,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:26,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:26,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:26,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:26,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:26,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:26,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:26,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 04:25:26,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 04:25:26,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 04:25:26,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 04:25:26,289 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 3 states. [2018-12-31 04:25:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:26,548 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2018-12-31 04:25:26,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 04:25:26,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-31 04:25:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:26,550 INFO L225 Difference]: With dead ends: 79 [2018-12-31 04:25:26,550 INFO L226 Difference]: Without dead ends: 75 [2018-12-31 04:25:26,551 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 [2018-12-31 04:25:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-31 04:25:26,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-12-31 04:25:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-31 04:25:26,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2018-12-31 04:25:26,559 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 15 [2018-12-31 04:25:26,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:26,559 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2018-12-31 04:25:26,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 04:25:26,559 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2018-12-31 04:25:26,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 04:25:26,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:26,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:26,561 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:26,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:26,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1551589151, now seen corresponding path program 1 times [2018-12-31 04:25:26,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:26,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:26,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:26,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:26,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:26,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:26,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:26,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:25:26,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:25:26,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:25:26,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:25:26,680 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 4 states. [2018-12-31 04:25:26,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:26,931 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2018-12-31 04:25:26,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:25:26,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-31 04:25:26,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:26,934 INFO L225 Difference]: With dead ends: 190 [2018-12-31 04:25:26,934 INFO L226 Difference]: Without dead ends: 126 [2018-12-31 04:25:26,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:25:26,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-31 04:25:26,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 74. [2018-12-31 04:25:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-31 04:25:26,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2018-12-31 04:25:26,948 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 16 [2018-12-31 04:25:26,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:26,948 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2018-12-31 04:25:26,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:25:26,948 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2018-12-31 04:25:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 04:25:26,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:26,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:26,949 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:26,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:26,950 INFO L82 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2018-12-31 04:25:26,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:26,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:26,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:26,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:26,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:27,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:27,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:25:27,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:25:27,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:25:27,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:25:27,042 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 4 states. [2018-12-31 04:25:27,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:27,395 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2018-12-31 04:25:27,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:25:27,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-31 04:25:27,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:27,397 INFO L225 Difference]: With dead ends: 134 [2018-12-31 04:25:27,397 INFO L226 Difference]: Without dead ends: 114 [2018-12-31 04:25:27,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:25:27,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-31 04:25:27,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 73. [2018-12-31 04:25:27,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-31 04:25:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2018-12-31 04:25:27,405 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 16 [2018-12-31 04:25:27,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:27,405 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2018-12-31 04:25:27,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:25:27,406 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2018-12-31 04:25:27,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-31 04:25:27,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:27,407 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] [2018-12-31 04:25:27,407 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:27,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:27,408 INFO L82 PathProgramCache]: Analyzing trace with hash -940628020, now seen corresponding path program 1 times [2018-12-31 04:25:27,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:27,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:27,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:27,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:27,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:27,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:27,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 04:25:27,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 04:25:27,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 04:25:27,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 04:25:27,489 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 3 states. [2018-12-31 04:25:27,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:27,517 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2018-12-31 04:25:27,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 04:25:27,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-31 04:25:27,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:27,519 INFO L225 Difference]: With dead ends: 139 [2018-12-31 04:25:27,519 INFO L226 Difference]: Without dead ends: 97 [2018-12-31 04:25:27,520 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 [2018-12-31 04:25:27,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-31 04:25:27,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2018-12-31 04:25:27,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-31 04:25:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2018-12-31 04:25:27,527 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 20 [2018-12-31 04:25:27,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:27,527 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-12-31 04:25:27,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 04:25:27,528 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-12-31 04:25:27,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 04:25:27,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:27,529 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] [2018-12-31 04:25:27,529 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:27,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:27,530 INFO L82 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2018-12-31 04:25:27,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:27,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:27,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:27,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:27,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:27,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:27,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 04:25:27,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 04:25:27,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 04:25:27,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 04:25:27,584 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 3 states. [2018-12-31 04:25:27,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:27,610 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-12-31 04:25:27,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 04:25:27,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-31 04:25:27,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:27,614 INFO L225 Difference]: With dead ends: 76 [2018-12-31 04:25:27,614 INFO L226 Difference]: Without dead ends: 74 [2018-12-31 04:25:27,614 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 [2018-12-31 04:25:27,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-31 04:25:27,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-31 04:25:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-31 04:25:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2018-12-31 04:25:27,621 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 21 [2018-12-31 04:25:27,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:27,621 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2018-12-31 04:25:27,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 04:25:27,623 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2018-12-31 04:25:27,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 04:25:27,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:27,624 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, 1, 1] [2018-12-31 04:25:27,626 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:27,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:27,626 INFO L82 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2018-12-31 04:25:27,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:27,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:27,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:27,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:27,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:27,837 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 04:25:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:27,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:27,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:25:27,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:25:27,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:25:27,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:25:27,862 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 4 states. [2018-12-31 04:25:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:28,025 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2018-12-31 04:25:28,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:25:28,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-12-31 04:25:28,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:28,027 INFO L225 Difference]: With dead ends: 75 [2018-12-31 04:25:28,027 INFO L226 Difference]: Without dead ends: 73 [2018-12-31 04:25:28,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:25:28,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-31 04:25:28,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-12-31 04:25:28,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-31 04:25:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2018-12-31 04:25:28,033 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 23 [2018-12-31 04:25:28,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:28,033 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2018-12-31 04:25:28,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:25:28,033 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2018-12-31 04:25:28,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 04:25:28,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:28,035 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, 1, 1, 1] [2018-12-31 04:25:28,035 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:28,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:28,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2018-12-31 04:25:28,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:28,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:28,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:28,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:28,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:28,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:28,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 04:25:28,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 04:25:28,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 04:25:28,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 04:25:28,179 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 6 states. [2018-12-31 04:25:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:28,972 INFO L93 Difference]: Finished difference Result 178 states and 205 transitions. [2018-12-31 04:25:28,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 04:25:28,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-12-31 04:25:28,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:28,976 INFO L225 Difference]: With dead ends: 178 [2018-12-31 04:25:28,976 INFO L226 Difference]: Without dead ends: 135 [2018-12-31 04:25:28,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-31 04:25:28,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-31 04:25:28,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 82. [2018-12-31 04:25:28,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-31 04:25:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2018-12-31 04:25:28,983 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 24 [2018-12-31 04:25:28,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:28,984 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2018-12-31 04:25:28,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 04:25:28,984 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2018-12-31 04:25:28,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 04:25:28,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:28,985 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, 1, 1, 1] [2018-12-31 04:25:28,986 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:28,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:28,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2018-12-31 04:25:28,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:28,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:28,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:28,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:28,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:29,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:29,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 04:25:29,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 04:25:29,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 04:25:29,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 04:25:29,273 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 7 states. [2018-12-31 04:25:30,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:30,150 INFO L93 Difference]: Finished difference Result 237 states and 265 transitions. [2018-12-31 04:25:30,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 04:25:30,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-31 04:25:30,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:30,156 INFO L225 Difference]: With dead ends: 237 [2018-12-31 04:25:30,156 INFO L226 Difference]: Without dead ends: 235 [2018-12-31 04:25:30,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-12-31 04:25:30,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-12-31 04:25:30,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 94. [2018-12-31 04:25:30,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-31 04:25:30,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2018-12-31 04:25:30,169 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 24 [2018-12-31 04:25:30,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:30,170 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2018-12-31 04:25:30,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 04:25:30,170 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2018-12-31 04:25:30,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 04:25:30,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:30,171 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, 1, 1, 1, 1, 1] [2018-12-31 04:25:30,172 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:30,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:30,172 INFO L82 PathProgramCache]: Analyzing trace with hash -545310703, now seen corresponding path program 1 times [2018-12-31 04:25:30,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:30,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:30,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:30,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:30,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:30,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 04:25:30,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:30,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 04:25:30,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 04:25:30,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 04:25:30,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:25:30,256 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand 5 states. [2018-12-31 04:25:30,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:30,423 INFO L93 Difference]: Finished difference Result 141 states and 162 transitions. [2018-12-31 04:25:30,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 04:25:30,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-31 04:25:30,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:30,425 INFO L225 Difference]: With dead ends: 141 [2018-12-31 04:25:30,425 INFO L226 Difference]: Without dead ends: 123 [2018-12-31 04:25:30,426 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 [2018-12-31 04:25:30,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-31 04:25:30,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 115. [2018-12-31 04:25:30,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-31 04:25:30,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2018-12-31 04:25:30,437 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 26 [2018-12-31 04:25:30,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:30,437 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2018-12-31 04:25:30,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 04:25:30,437 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2018-12-31 04:25:30,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 04:25:30,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:30,455 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, 1, 1, 1, 1, 1] [2018-12-31 04:25:30,455 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:30,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:30,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1566334865, now seen corresponding path program 1 times [2018-12-31 04:25:30,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:30,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:30,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:30,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:30,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 04:25:30,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:30,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 04:25:30,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 04:25:30,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 04:25:30,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 04:25:30,539 INFO L87 Difference]: Start difference. First operand 115 states and 137 transitions. Second operand 3 states. [2018-12-31 04:25:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:30,638 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2018-12-31 04:25:30,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 04:25:30,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-31 04:25:30,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:30,641 INFO L225 Difference]: With dead ends: 115 [2018-12-31 04:25:30,641 INFO L226 Difference]: Without dead ends: 113 [2018-12-31 04:25:30,641 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 [2018-12-31 04:25:30,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-31 04:25:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-31 04:25:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-31 04:25:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2018-12-31 04:25:30,650 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 26 [2018-12-31 04:25:30,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:30,651 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2018-12-31 04:25:30,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 04:25:30,651 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2018-12-31 04:25:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 04:25:30,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:30,652 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, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:30,653 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:30,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:30,653 INFO L82 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2018-12-31 04:25:30,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:30,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:30,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:30,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:30,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:30,915 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-31 04:25:31,141 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-12-31 04:25:31,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:31,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:31,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 04:25:31,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 04:25:31,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 04:25:31,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 04:25:31,327 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand 8 states. [2018-12-31 04:25:32,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:32,105 INFO L93 Difference]: Finished difference Result 203 states and 235 transitions. [2018-12-31 04:25:32,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 04:25:32,106 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-31 04:25:32,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:32,108 INFO L225 Difference]: With dead ends: 203 [2018-12-31 04:25:32,108 INFO L226 Difference]: Without dead ends: 201 [2018-12-31 04:25:32,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-12-31 04:25:32,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-31 04:25:32,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 116. [2018-12-31 04:25:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-31 04:25:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 138 transitions. [2018-12-31 04:25:32,119 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 138 transitions. Word has length 27 [2018-12-31 04:25:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:32,120 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 138 transitions. [2018-12-31 04:25:32,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 04:25:32,120 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 138 transitions. [2018-12-31 04:25:32,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-31 04:25:32,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:32,122 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:32,122 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:32,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:32,123 INFO L82 PathProgramCache]: Analyzing trace with hash 2026653164, now seen corresponding path program 1 times [2018-12-31 04:25:32,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:32,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:32,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:32,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:32,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:32,387 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-12-31 04:25:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:32,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:25:32,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:25:32,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:32,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:25:32,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-31 04:25:32,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-31 04:25:32,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:32,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:32,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-31 04:25:32,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-31 04:25:32,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:32,783 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:32,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:32,793 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-12-31 04:25:32,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-31 04:25:32,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:32,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-31 04:25:32,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:32,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:32,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-31 04:25:32,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:32,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-31 04:25:32,891 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:32,898 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:32,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:32,909 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-12-31 04:25:32,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-31 04:25:32,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-31 04:25:32,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:33,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:33,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-31 04:25:33,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-31 04:25:33,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:33,172 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:33,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:33,222 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-12-31 04:25:33,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:33,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:25:33,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-12-31 04:25:33,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 04:25:33,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 04:25:33,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-31 04:25:33,260 INFO L87 Difference]: Start difference. First operand 116 states and 138 transitions. Second operand 8 states. [2018-12-31 04:25:34,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:34,181 INFO L93 Difference]: Finished difference Result 220 states and 256 transitions. [2018-12-31 04:25:34,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 04:25:34,182 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-12-31 04:25:34,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:34,184 INFO L225 Difference]: With dead ends: 220 [2018-12-31 04:25:34,184 INFO L226 Difference]: Without dead ends: 158 [2018-12-31 04:25:34,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-12-31 04:25:34,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-31 04:25:34,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 118. [2018-12-31 04:25:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-31 04:25:34,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2018-12-31 04:25:34,195 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 29 [2018-12-31 04:25:34,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:34,196 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2018-12-31 04:25:34,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 04:25:34,196 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2018-12-31 04:25:34,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-31 04:25:34,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:34,197 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:34,197 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:34,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:34,197 INFO L82 PathProgramCache]: Analyzing trace with hash -2133518130, now seen corresponding path program 1 times [2018-12-31 04:25:34,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:34,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:34,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:34,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:34,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:34,520 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2018-12-31 04:25:34,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:34,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:34,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 04:25:34,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 04:25:34,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 04:25:34,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 04:25:34,597 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand 6 states. [2018-12-31 04:25:34,938 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-12-31 04:25:35,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:35,173 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2018-12-31 04:25:35,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 04:25:35,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-12-31 04:25:35,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:35,176 INFO L225 Difference]: With dead ends: 161 [2018-12-31 04:25:35,176 INFO L226 Difference]: Without dead ends: 141 [2018-12-31 04:25:35,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 04:25:35,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-31 04:25:35,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 117. [2018-12-31 04:25:35,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-31 04:25:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2018-12-31 04:25:35,188 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 29 [2018-12-31 04:25:35,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:35,188 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2018-12-31 04:25:35,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 04:25:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2018-12-31 04:25:35,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 04:25:35,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:35,189 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:35,190 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:35,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:35,190 INFO L82 PathProgramCache]: Analyzing trace with hash 830518973, now seen corresponding path program 1 times [2018-12-31 04:25:35,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:35,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:35,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:35,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:35,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:35,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:25:35,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:25:35,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:35,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:25:35,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-31 04:25:35,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-31 04:25:35,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:35,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:35,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:35,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-31 04:25:35,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-31 04:25:35,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-31 04:25:35,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:35,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:35,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-31 04:25:35,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:35,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-31 04:25:35,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:35,693 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:35,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:35,697 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2018-12-31 04:25:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:35,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:25:35,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2018-12-31 04:25:35,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 04:25:35,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 04:25:35,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-31 04:25:35,745 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand 10 states. [2018-12-31 04:25:36,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:36,355 INFO L93 Difference]: Finished difference Result 221 states and 249 transitions. [2018-12-31 04:25:36,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 04:25:36,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-12-31 04:25:36,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:36,358 INFO L225 Difference]: With dead ends: 221 [2018-12-31 04:25:36,358 INFO L226 Difference]: Without dead ends: 190 [2018-12-31 04:25:36,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-31 04:25:36,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-31 04:25:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 134. [2018-12-31 04:25:36,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-31 04:25:36,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 161 transitions. [2018-12-31 04:25:36,373 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 161 transitions. Word has length 32 [2018-12-31 04:25:36,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:36,373 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 161 transitions. [2018-12-31 04:25:36,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 04:25:36,385 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 161 transitions. [2018-12-31 04:25:36,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 04:25:36,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:36,389 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:36,390 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:36,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:36,390 INFO L82 PathProgramCache]: Analyzing trace with hash -60835504, now seen corresponding path program 1 times [2018-12-31 04:25:36,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:36,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:36,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:36,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:36,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:36,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:36,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 04:25:36,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 04:25:36,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 04:25:36,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 04:25:36,456 INFO L87 Difference]: Start difference. First operand 134 states and 161 transitions. Second operand 3 states. [2018-12-31 04:25:36,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:36,645 INFO L93 Difference]: Finished difference Result 293 states and 360 transitions. [2018-12-31 04:25:36,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 04:25:36,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-31 04:25:36,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:36,647 INFO L225 Difference]: With dead ends: 293 [2018-12-31 04:25:36,647 INFO L226 Difference]: Without dead ends: 211 [2018-12-31 04:25:36,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 04:25:36,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-31 04:25:36,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 171. [2018-12-31 04:25:36,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-31 04:25:36,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 207 transitions. [2018-12-31 04:25:36,663 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 207 transitions. Word has length 32 [2018-12-31 04:25:36,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:36,663 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 207 transitions. [2018-12-31 04:25:36,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 04:25:36,663 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 207 transitions. [2018-12-31 04:25:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 04:25:36,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:36,664 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:36,664 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:36,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:36,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1562646056, now seen corresponding path program 1 times [2018-12-31 04:25:36,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:36,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:36,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:36,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:36,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:37,031 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 13 [2018-12-31 04:25:37,244 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2018-12-31 04:25:37,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:37,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:25:37,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:25:37,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:37,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:25:37,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-31 04:25:37,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:37,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:37,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-31 04:25:37,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-31 04:25:37,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-31 04:25:37,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:37,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:37,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-31 04:25:37,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-31 04:25:37,644 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:37,647 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:37,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:37,658 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-12-31 04:25:37,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:37,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:37,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-31 04:25:37,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:38,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-12-31 04:25:38,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:38,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-31 04:25:38,072 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:38,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-31 04:25:38,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-31 04:25:38,294 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:38,329 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:38,337 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:38,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-12-31 04:25:38,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:38,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-31 04:25:38,366 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:38,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-12-31 04:25:38,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-31 04:25:38,388 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:38,396 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:38,409 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:38,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:38,428 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:86, output treesize:51 [2018-12-31 04:25:38,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-12-31 04:25:38,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:38,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-12-31 04:25:38,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:38,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:38,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-12-31 04:25:38,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:38,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-12-31 04:25:38,569 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:38,580 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:38,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:25:38,599 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:94, output treesize:78 [2018-12-31 04:25:38,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 54 [2018-12-31 04:25:38,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:38,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-31 04:25:38,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:39,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-12-31 04:25:39,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:25:39,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:25:39,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-12-31 04:25:39,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:25:39,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-31 04:25:39,094 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:39,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-31 04:25:39,104 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-31 04:25:39,113 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:39,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:25:39,120 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:85, output treesize:7 [2018-12-31 04:25:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:39,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:25:39,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-12-31 04:25:39,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-31 04:25:39,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-31 04:25:39,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-12-31 04:25:39,159 INFO L87 Difference]: Start difference. First operand 171 states and 207 transitions. Second operand 17 states. [2018-12-31 04:25:39,972 WARN L181 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-12-31 04:25:41,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:41,324 INFO L93 Difference]: Finished difference Result 473 states and 561 transitions. [2018-12-31 04:25:41,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 04:25:41,325 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-12-31 04:25:41,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:41,328 INFO L225 Difference]: With dead ends: 473 [2018-12-31 04:25:41,328 INFO L226 Difference]: Without dead ends: 381 [2018-12-31 04:25:41,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=254, Invalid=738, Unknown=0, NotChecked=0, Total=992 [2018-12-31 04:25:41,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-12-31 04:25:41,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 205. [2018-12-31 04:25:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-31 04:25:41,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 247 transitions. [2018-12-31 04:25:41,353 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 247 transitions. Word has length 36 [2018-12-31 04:25:41,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:41,353 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 247 transitions. [2018-12-31 04:25:41,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-31 04:25:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 247 transitions. [2018-12-31 04:25:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 04:25:41,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:41,356 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:41,357 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:41,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:41,358 INFO L82 PathProgramCache]: Analyzing trace with hash -648373053, now seen corresponding path program 1 times [2018-12-31 04:25:41,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:41,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:41,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:41,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:41,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 04:25:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 04:25:41,410 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 04:25:41,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 04:25:41 BoogieIcfgContainer [2018-12-31 04:25:41,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 04:25:41,452 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 04:25:41,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 04:25:41,453 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 04:25:41,453 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:25:25" (3/4) ... [2018-12-31 04:25:41,457 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 04:25:41,523 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 04:25:41,523 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 04:25:41,524 INFO L168 Benchmark]: Toolchain (without parser) took 18101.32 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 287.8 MB). Free memory was 948.7 MB in the beginning and 889.0 MB in the end (delta: 59.7 MB). Peak memory consumption was 347.5 MB. Max. memory is 11.5 GB. [2018-12-31 04:25:41,525 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:25:41,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. [2018-12-31 04:25:41,526 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.99 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:25:41,528 INFO L168 Benchmark]: Boogie Preprocessor took 40.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:25:41,529 INFO L168 Benchmark]: RCFGBuilder took 995.21 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: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2018-12-31 04:25:41,529 INFO L168 Benchmark]: TraceAbstraction took 16188.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 145.8 MB). Free memory was 1.1 GB in the beginning and 898.0 MB in the end (delta: 186.8 MB). Peak memory consumption was 332.6 MB. Max. memory is 11.5 GB. [2018-12-31 04:25:41,531 INFO L168 Benchmark]: Witness Printer took 70.43 ms. Allocated memory is still 1.3 GB. Free memory was 898.0 MB in the beginning and 889.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2018-12-31 04:25:41,536 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 739.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.99 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 995.21 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: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16188.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 145.8 MB). Free memory was 1.1 GB in the beginning and 898.0 MB in the end (delta: 186.8 MB). Peak memory consumption was 332.6 MB. Max. memory is 11.5 GB. * Witness Printer took 70.43 ms. Allocated memory is still 1.3 GB. Free memory was 898.0 MB in the beginning and 889.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1025]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L991] SLL* list = malloc(sizeof(SLL)); [L992] list->next = ((void*)0) [L993] COND FALSE !(!(list != ((void*)0))) [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) [L993] EXPR list->inner [L993] list->inner->next = ((void*)0) [L993] EXPR list->inner [L993] list->inner->inner = ((void*)0) [L993] EXPR list->inner [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list [L1012] COND FALSE !(!(((void*)0) != end)) [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; [L1017] EXPR end->inner [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner [L1020] COND TRUE len == 0 [L1021] len = 1 [L1024] COND FALSE !(!(((void*)0) != inner)) [L1025] EXPR inner->inner [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner [L1027] inner = inner->inner [L1028] COND TRUE len == 1 [L1029] EXPR inner->inner [L1029] inner = inner->inner [L1018] COND TRUE ((void*)0) != inner [L1020] COND FALSE !(len == 0) [L1023] len = 2 [L1024] COND FALSE !(!(((void*)0) != inner)) [L1025] EXPR inner->inner [L1025] COND TRUE !(((void*)0) == inner->inner) [L1025] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 13 error locations. UNSAFE Result, 16.1s OverallTime, 20 OverallIterations, 2 TraceHistogramMax, 8.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1415 SDtfs, 2783 SDslu, 2756 SDs, 0 SdLazy, 1641 SolverSat, 268 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 121 SyntacticMatches, 8 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=19, 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.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 761 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 553 NumberOfCodeBlocks, 553 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 495 ConstructedInterpolants, 10 QuantifiedInterpolants, 185931 SizeOfPredicates, 29 NumberOfNonLiveVariables, 314 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 8/18 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...