java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:44:32,439 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:44:32,441 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:44:32,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:44:32,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:44:32,460 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:44:32,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:44:32,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:44:32,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:44:32,479 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:44:32,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:44:32,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:44:32,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:44:32,485 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:44:32,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:44:32,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:44:32,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:44:32,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:44:32,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:44:32,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:44:32,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:44:32,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:44:32,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:44:32,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:44:32,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:44:32,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:44:32,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:44:32,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:44:32,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:44:32,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:44:32,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:44:32,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:44:32,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:44:32,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:44:32,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:44:32,516 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:44:32,516 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:44:32,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:44:32,517 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:44:32,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:44:32,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:44:32,519 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 19:44:32,551 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:44:32,553 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:44:32,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:44:32,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:44:32,555 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:44:32,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:44:32,555 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:44:32,555 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:44:32,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:44:32,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:44:32,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:44:32,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:44:32,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:44:32,558 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:44:32,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:44:32,559 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:44:32,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:44:32,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:44:32,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:44:32,560 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:44:32,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:44:32,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:44:32,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:44:32,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:44:32,560 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:44:32,561 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:44:32,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:44:32,561 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:44:32,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:44:32,844 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:44:32,861 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:44:32,866 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:44:32,869 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:44:32,870 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:44:32,870 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 19:44:32,946 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7fb77ccf/1b3fbdc5ef5b4e64bb45b28db307ccbf/FLAGa2ebeff71 [2019-10-13 19:44:33,500 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:44:33,505 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 19:44:33,532 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7fb77ccf/1b3fbdc5ef5b4e64bb45b28db307ccbf/FLAGa2ebeff71 [2019-10-13 19:44:33,787 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7fb77ccf/1b3fbdc5ef5b4e64bb45b28db307ccbf [2019-10-13 19:44:33,797 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:44:33,798 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:44:33,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:44:33,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:44:33,803 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:44:33,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:44:33" (1/1) ... [2019-10-13 19:44:33,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4262f24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:33, skipping insertion in model container [2019-10-13 19:44:33,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:44:33" (1/1) ... [2019-10-13 19:44:33,816 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:44:33,895 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:44:34,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:44:34,593 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:44:35,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:44:35,059 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:44:35,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:35 WrapperNode [2019-10-13 19:44:35,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:44:35,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:44:35,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:44:35,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:44:35,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:35" (1/1) ... [2019-10-13 19:44:35,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:35" (1/1) ... [2019-10-13 19:44:35,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:35" (1/1) ... [2019-10-13 19:44:35,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:35" (1/1) ... [2019-10-13 19:44:35,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:35" (1/1) ... [2019-10-13 19:44:35,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:35" (1/1) ... [2019-10-13 19:44:35,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:35" (1/1) ... [2019-10-13 19:44:35,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:44:35,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:44:35,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:44:35,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:44:35,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:44:35,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:44:35,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:44:35,290 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:44:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:44:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:44:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 19:44:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 19:44:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 19:44:35,291 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 19:44:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 19:44:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 19:44:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 19:44:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 19:44:35,293 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 19:44:35,293 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 19:44:35,293 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:44:35,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:44:35,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:44:37,044 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:44:37,045 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 19:44:37,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:44:37 BoogieIcfgContainer [2019-10-13 19:44:37,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:44:37,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:44:37,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:44:37,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:44:37,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:44:33" (1/3) ... [2019-10-13 19:44:37,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6297879b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:44:37, skipping insertion in model container [2019-10-13 19:44:37,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:35" (2/3) ... [2019-10-13 19:44:37,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6297879b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:44:37, skipping insertion in model container [2019-10-13 19:44:37,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:44:37" (3/3) ... [2019-10-13 19:44:37,056 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 19:44:37,067 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:44:37,087 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-13 19:44:37,097 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-13 19:44:37,129 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:44:37,129 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:44:37,129 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:44:37,129 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:44:37,130 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:44:37,130 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:44:37,130 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:44:37,130 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:44:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states. [2019-10-13 19:44:37,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 19:44:37,186 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:37,187 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-10-13 19:44:37,189 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:37,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:37,193 INFO L82 PathProgramCache]: Analyzing trace with hash 566032510, now seen corresponding path program 1 times [2019-10-13 19:44:37,199 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:37,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652266283] [2019-10-13 19:44:37,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:37,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:37,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:38,184 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-13 19:44:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:38,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:44:38,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652266283] [2019-10-13 19:44:38,288 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:38,288 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:44:38,288 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184304381] [2019-10-13 19:44:38,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:44:38,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:38,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:44:38,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:44:38,316 INFO L87 Difference]: Start difference. First operand 376 states. Second operand 4 states. [2019-10-13 19:44:38,731 WARN L191 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2019-10-13 19:44:41,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:41,255 INFO L93 Difference]: Finished difference Result 683 states and 1210 transitions. [2019-10-13 19:44:41,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:44:41,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-13 19:44:41,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:41,276 INFO L225 Difference]: With dead ends: 683 [2019-10-13 19:44:41,277 INFO L226 Difference]: Without dead ends: 536 [2019-10-13 19:44:41,282 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:44:41,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-10-13 19:44:41,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 534. [2019-10-13 19:44:41,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-13 19:44:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 783 transitions. [2019-10-13 19:44:41,373 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 783 transitions. Word has length 137 [2019-10-13 19:44:41,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:41,374 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 783 transitions. [2019-10-13 19:44:41,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:44:41,374 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 783 transitions. [2019-10-13 19:44:41,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 19:44:41,379 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:41,379 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-10-13 19:44:41,379 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:41,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:41,380 INFO L82 PathProgramCache]: Analyzing trace with hash 227617534, now seen corresponding path program 1 times [2019-10-13 19:44:41,380 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:41,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747347131] [2019-10-13 19:44:41,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:41,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:41,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:41,810 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-13 19:44:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:41,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:44:41,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747347131] [2019-10-13 19:44:41,884 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:41,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:44:41,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228957255] [2019-10-13 19:44:41,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:44:41,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:41,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:44:41,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:44:41,889 INFO L87 Difference]: Start difference. First operand 534 states and 783 transitions. Second operand 4 states. [2019-10-13 19:44:42,231 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2019-10-13 19:44:44,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:44,158 INFO L93 Difference]: Finished difference Result 1069 states and 1620 transitions. [2019-10-13 19:44:44,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:44:44,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-13 19:44:44,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:44,167 INFO L225 Difference]: With dead ends: 1069 [2019-10-13 19:44:44,167 INFO L226 Difference]: Without dead ends: 878 [2019-10-13 19:44:44,169 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:44:44,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2019-10-13 19:44:44,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 876. [2019-10-13 19:44:44,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-10-13 19:44:44,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1307 transitions. [2019-10-13 19:44:44,215 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1307 transitions. Word has length 137 [2019-10-13 19:44:44,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:44,216 INFO L462 AbstractCegarLoop]: Abstraction has 876 states and 1307 transitions. [2019-10-13 19:44:44,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:44:44,216 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1307 transitions. [2019-10-13 19:44:44,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 19:44:44,220 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:44,221 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-10-13 19:44:44,221 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:44,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:44,222 INFO L82 PathProgramCache]: Analyzing trace with hash 227278910, now seen corresponding path program 1 times [2019-10-13 19:44:44,222 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:44,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421223152] [2019-10-13 19:44:44,222 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:44,222 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:44,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:44,801 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-13 19:44:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:44,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:44:44,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421223152] [2019-10-13 19:44:44,840 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:44,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:44:44,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476348719] [2019-10-13 19:44:44,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:44:44,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:44,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:44:44,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:44:44,842 INFO L87 Difference]: Start difference. First operand 876 states and 1307 transitions. Second operand 5 states. [2019-10-13 19:44:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:47,857 INFO L93 Difference]: Finished difference Result 2559 states and 3814 transitions. [2019-10-13 19:44:47,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:44:47,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-10-13 19:44:47,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:47,869 INFO L225 Difference]: With dead ends: 2559 [2019-10-13 19:44:47,870 INFO L226 Difference]: Without dead ends: 1696 [2019-10-13 19:44:47,875 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:44:47,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2019-10-13 19:44:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1660. [2019-10-13 19:44:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-10-13 19:44:47,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2465 transitions. [2019-10-13 19:44:47,960 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2465 transitions. Word has length 137 [2019-10-13 19:44:47,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:47,961 INFO L462 AbstractCegarLoop]: Abstraction has 1660 states and 2465 transitions. [2019-10-13 19:44:47,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:44:47,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2465 transitions. [2019-10-13 19:44:47,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 19:44:47,965 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:47,965 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-10-13 19:44:47,965 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:47,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:47,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1550747192, now seen corresponding path program 1 times [2019-10-13 19:44:47,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:47,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494349327] [2019-10-13 19:44:47,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:47,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:47,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:48,382 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-13 19:44:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:44:48,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494349327] [2019-10-13 19:44:48,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:48,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:44:48,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979985332] [2019-10-13 19:44:48,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:44:48,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:48,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:44:48,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:44:48,447 INFO L87 Difference]: Start difference. First operand 1660 states and 2465 transitions. Second operand 4 states. [2019-10-13 19:44:50,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:50,337 INFO L93 Difference]: Finished difference Result 4934 states and 7325 transitions. [2019-10-13 19:44:50,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:44:50,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-13 19:44:50,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:50,354 INFO L225 Difference]: With dead ends: 4934 [2019-10-13 19:44:50,354 INFO L226 Difference]: Without dead ends: 3306 [2019-10-13 19:44:50,358 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:44:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3306 states. [2019-10-13 19:44:50,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3306 to 1662. [2019-10-13 19:44:50,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1662 states. [2019-10-13 19:44:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2467 transitions. [2019-10-13 19:44:50,447 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2467 transitions. Word has length 138 [2019-10-13 19:44:50,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:50,447 INFO L462 AbstractCegarLoop]: Abstraction has 1662 states and 2467 transitions. [2019-10-13 19:44:50,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:44:50,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2467 transitions. [2019-10-13 19:44:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 19:44:50,451 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:50,451 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:44:50,452 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:50,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:50,452 INFO L82 PathProgramCache]: Analyzing trace with hash -2121179683, now seen corresponding path program 1 times [2019-10-13 19:44:50,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:50,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374400962] [2019-10-13 19:44:50,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:50,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:50,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:50,914 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-13 19:44:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:50,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:44:50,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374400962] [2019-10-13 19:44:50,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:50,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:44:50,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425960901] [2019-10-13 19:44:50,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:44:50,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:50,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:44:50,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:44:50,962 INFO L87 Difference]: Start difference. First operand 1662 states and 2467 transitions. Second operand 5 states. [2019-10-13 19:44:53,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:53,787 INFO L93 Difference]: Finished difference Result 4830 states and 7153 transitions. [2019-10-13 19:44:53,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:44:53,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-10-13 19:44:53,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:53,804 INFO L225 Difference]: With dead ends: 4830 [2019-10-13 19:44:53,804 INFO L226 Difference]: Without dead ends: 3202 [2019-10-13 19:44:53,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:44:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states. [2019-10-13 19:44:53,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 3166. [2019-10-13 19:44:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3166 states. [2019-10-13 19:44:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3166 states to 3166 states and 4659 transitions. [2019-10-13 19:44:53,966 INFO L78 Accepts]: Start accepts. Automaton has 3166 states and 4659 transitions. Word has length 139 [2019-10-13 19:44:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:53,968 INFO L462 AbstractCegarLoop]: Abstraction has 3166 states and 4659 transitions. [2019-10-13 19:44:53,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:44:53,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3166 states and 4659 transitions. [2019-10-13 19:44:53,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 19:44:53,974 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:53,974 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:44:53,975 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:53,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:53,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1901470855, now seen corresponding path program 1 times [2019-10-13 19:44:53,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:53,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071177383] [2019-10-13 19:44:53,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:53,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:53,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:54,355 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-13 19:44:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:44:54,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071177383] [2019-10-13 19:44:54,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:54,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:44:54,401 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370812323] [2019-10-13 19:44:54,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:44:54,402 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:54,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:44:54,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:44:54,409 INFO L87 Difference]: Start difference. First operand 3166 states and 4659 transitions. Second operand 4 states. [2019-10-13 19:44:57,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:57,415 INFO L93 Difference]: Finished difference Result 9414 states and 13849 transitions. [2019-10-13 19:44:57,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:44:57,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-13 19:44:57,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:57,444 INFO L225 Difference]: With dead ends: 9414 [2019-10-13 19:44:57,444 INFO L226 Difference]: Without dead ends: 6296 [2019-10-13 19:44:57,452 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:44:57,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6296 states. [2019-10-13 19:44:57,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6296 to 3170. [2019-10-13 19:44:57,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3170 states. [2019-10-13 19:44:57,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 4663 transitions. [2019-10-13 19:44:57,631 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 4663 transitions. Word has length 140 [2019-10-13 19:44:57,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:57,632 INFO L462 AbstractCegarLoop]: Abstraction has 3170 states and 4663 transitions. [2019-10-13 19:44:57,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:44:57,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 4663 transitions. [2019-10-13 19:44:57,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 19:44:57,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:57,639 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:44:57,639 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:57,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:57,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1097233700, now seen corresponding path program 1 times [2019-10-13 19:44:57,640 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:57,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028702297] [2019-10-13 19:44:57,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:57,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:57,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:58,007 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-13 19:44:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:44:58,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028702297] [2019-10-13 19:44:58,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:58,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:44:58,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419607453] [2019-10-13 19:44:58,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:44:58,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:58,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:44:58,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:44:58,098 INFO L87 Difference]: Start difference. First operand 3170 states and 4663 transitions. Second operand 4 states. [2019-10-13 19:45:00,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:00,496 INFO L93 Difference]: Finished difference Result 8343 states and 12276 transitions. [2019-10-13 19:45:00,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:00,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-10-13 19:45:00,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:00,519 INFO L225 Difference]: With dead ends: 8343 [2019-10-13 19:45:00,520 INFO L226 Difference]: Without dead ends: 5461 [2019-10-13 19:45:00,526 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:00,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5461 states. [2019-10-13 19:45:00,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5461 to 5425. [2019-10-13 19:45:00,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5425 states. [2019-10-13 19:45:00,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5425 states to 5425 states and 7876 transitions. [2019-10-13 19:45:00,766 INFO L78 Accepts]: Start accepts. Automaton has 5425 states and 7876 transitions. Word has length 141 [2019-10-13 19:45:00,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:00,766 INFO L462 AbstractCegarLoop]: Abstraction has 5425 states and 7876 transitions. [2019-10-13 19:45:00,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:00,766 INFO L276 IsEmpty]: Start isEmpty. Operand 5425 states and 7876 transitions. [2019-10-13 19:45:00,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 19:45:00,776 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:00,776 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:45:00,776 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:00,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:00,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1702008345, now seen corresponding path program 1 times [2019-10-13 19:45:00,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:00,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803239959] [2019-10-13 19:45:00,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:00,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:00,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:01,190 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-13 19:45:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:01,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803239959] [2019-10-13 19:45:01,223 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:01,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:01,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538560714] [2019-10-13 19:45:01,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:01,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:01,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:01,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:01,227 INFO L87 Difference]: Start difference. First operand 5425 states and 7876 transitions. Second operand 5 states. [2019-10-13 19:45:03,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:03,074 INFO L93 Difference]: Finished difference Result 11218 states and 16169 transitions. [2019-10-13 19:45:03,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:03,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-13 19:45:03,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:03,097 INFO L225 Difference]: With dead ends: 11218 [2019-10-13 19:45:03,097 INFO L226 Difference]: Without dead ends: 5673 [2019-10-13 19:45:03,107 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:03,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5673 states. [2019-10-13 19:45:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5673 to 5637. [2019-10-13 19:45:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5637 states. [2019-10-13 19:45:03,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5637 states to 5637 states and 8064 transitions. [2019-10-13 19:45:03,349 INFO L78 Accepts]: Start accepts. Automaton has 5637 states and 8064 transitions. Word has length 141 [2019-10-13 19:45:03,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:03,350 INFO L462 AbstractCegarLoop]: Abstraction has 5637 states and 8064 transitions. [2019-10-13 19:45:03,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:03,350 INFO L276 IsEmpty]: Start isEmpty. Operand 5637 states and 8064 transitions. [2019-10-13 19:45:03,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 19:45:03,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:03,359 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:45:03,359 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:03,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:03,359 INFO L82 PathProgramCache]: Analyzing trace with hash 680281852, now seen corresponding path program 1 times [2019-10-13 19:45:03,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:03,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599099168] [2019-10-13 19:45:03,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:03,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:03,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:03,780 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-13 19:45:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:03,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599099168] [2019-10-13 19:45:03,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:03,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:03,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566609935] [2019-10-13 19:45:03,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:03,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:03,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:03,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:03,839 INFO L87 Difference]: Start difference. First operand 5637 states and 8064 transitions. Second operand 5 states. [2019-10-13 19:45:06,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:06,501 INFO L93 Difference]: Finished difference Result 7924 states and 11307 transitions. [2019-10-13 19:45:06,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:06,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-13 19:45:06,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:06,515 INFO L225 Difference]: With dead ends: 7924 [2019-10-13 19:45:06,515 INFO L226 Difference]: Without dead ends: 5673 [2019-10-13 19:45:06,521 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:45:06,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5673 states. [2019-10-13 19:45:06,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5673 to 5425. [2019-10-13 19:45:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5425 states. [2019-10-13 19:45:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5425 states to 5425 states and 7802 transitions. [2019-10-13 19:45:06,838 INFO L78 Accepts]: Start accepts. Automaton has 5425 states and 7802 transitions. Word has length 141 [2019-10-13 19:45:06,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:06,838 INFO L462 AbstractCegarLoop]: Abstraction has 5425 states and 7802 transitions. [2019-10-13 19:45:06,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand 5425 states and 7802 transitions. [2019-10-13 19:45:06,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 19:45:06,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:06,847 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:45:06,848 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:06,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:06,849 INFO L82 PathProgramCache]: Analyzing trace with hash -341992133, now seen corresponding path program 1 times [2019-10-13 19:45:06,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:06,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549368736] [2019-10-13 19:45:06,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:06,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:06,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:07,185 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-13 19:45:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:07,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:07,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549368736] [2019-10-13 19:45:07,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:07,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:07,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505718950] [2019-10-13 19:45:07,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:07,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:07,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:07,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:07,219 INFO L87 Difference]: Start difference. First operand 5425 states and 7802 transitions. Second operand 4 states.