/usr/bin/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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:12:48,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:12:48,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:12:48,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:12:48,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:12:48,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:12:48,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:12:48,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:12:48,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:12:48,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:12:48,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:12:48,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:12:48,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:12:48,431 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:12:48,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:12:48,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:12:48,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:12:48,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:12:48,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:12:48,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:12:48,447 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:12:48,448 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:12:48,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:12:48,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:12:48,453 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:12:48,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:12:48,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:12:48,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:12:48,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:12:48,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:12:48,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:12:48,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:12:48,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:12:48,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:12:48,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:12:48,459 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:12:48,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:12:48,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:12:48,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:12:48,461 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:12:48,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:12:48,462 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-11-06 22:12:48,475 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:12:48,476 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:12:48,477 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:12:48,477 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:12:48,477 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:12:48,478 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:12:48,478 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:12:48,478 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:12:48,478 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:12:48,478 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:12:48,478 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:12:48,479 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:12:48,479 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:12:48,479 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:12:48,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:12:48,479 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:12:48,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:12:48,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:12:48,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:12:48,480 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:12:48,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:12:48,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:12:48,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:12:48,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:12:48,481 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:12:48,481 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:12:48,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:12:48,482 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:12:48,482 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:12:48,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:12:48,770 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:12:48,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:12:48,774 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:12:48,775 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:12:48,775 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-06 22:12:48,837 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fac2ae2a/e653eed0ab0c4ff6a7b3cf1ff09e7b94/FLAG49a3b0b22 [2019-11-06 22:12:49,441 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:12:49,442 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-06 22:12:49,457 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fac2ae2a/e653eed0ab0c4ff6a7b3cf1ff09e7b94/FLAG49a3b0b22 [2019-11-06 22:12:49,719 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fac2ae2a/e653eed0ab0c4ff6a7b3cf1ff09e7b94 [2019-11-06 22:12:49,729 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:12:49,730 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:12:49,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:12:49,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:12:49,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:12:49,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:12:49" (1/1) ... [2019-11-06 22:12:49,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ab0e00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:49, skipping insertion in model container [2019-11-06 22:12:49,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:12:49" (1/1) ... [2019-11-06 22:12:49,746 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:12:49,821 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:12:50,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:12:50,462 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:12:50,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:12:50,931 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:12:50,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:50 WrapperNode [2019-11-06 22:12:50,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:12:50,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:12:50,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:12:50,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:12:50,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:50" (1/1) ... [2019-11-06 22:12:50,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:50" (1/1) ... [2019-11-06 22:12:50,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:50" (1/1) ... [2019-11-06 22:12:50,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:50" (1/1) ... [2019-11-06 22:12:51,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:50" (1/1) ... [2019-11-06 22:12:51,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:50" (1/1) ... [2019-11-06 22:12:51,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:50" (1/1) ... [2019-11-06 22:12:51,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:12:51,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:12:51,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:12:51,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:12:51,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:12:51,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:12:51,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:12:51,137 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:12:51,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:12:51,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 22:12:51,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-06 22:12:51,139 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-06 22:12:51,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 22:12:51,140 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-06 22:12:51,141 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-06 22:12:51,141 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-06 22:12:51,141 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-06 22:12:51,142 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-06 22:12:51,142 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-06 22:12:51,143 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-06 22:12:51,143 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:12:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:12:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:12:52,802 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:12:52,802 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-06 22:12:52,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:12:52 BoogieIcfgContainer [2019-11-06 22:12:52,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:12:52,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:12:52,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:12:52,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:12:52,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:12:49" (1/3) ... [2019-11-06 22:12:52,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64400b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:12:52, skipping insertion in model container [2019-11-06 22:12:52,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:50" (2/3) ... [2019-11-06 22:12:52,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64400b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:12:52, skipping insertion in model container [2019-11-06 22:12:52,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:12:52" (3/3) ... [2019-11-06 22:12:52,823 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-06 22:12:52,836 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:12:52,864 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-06 22:12:52,877 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-06 22:12:52,920 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:12:52,920 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:12:52,921 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:12:52,921 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:12:52,921 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:12:52,921 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:12:52,921 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:12:52,921 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:12:52,959 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states. [2019-11-06 22:12:52,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-06 22:12:52,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:52,991 INFO L410 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, 1] [2019-11-06 22:12:52,994 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:53,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:53,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1111774015, now seen corresponding path program 1 times [2019-11-06 22:12:53,008 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:53,008 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590787659] [2019-11-06 22:12:53,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:54,136 WARN L191 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-11-06 22:12:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:54,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:54,239 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590787659] [2019-11-06 22:12:54,239 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:54,240 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:12:54,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545205072] [2019-11-06 22:12:54,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:12:54,247 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:54,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:12:54,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:12:54,264 INFO L87 Difference]: Start difference. First operand 382 states. Second operand 5 states. [2019-11-06 22:12:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:57,960 INFO L93 Difference]: Finished difference Result 1107 states and 1990 transitions. [2019-11-06 22:12:57,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:12:57,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-11-06 22:12:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:57,985 INFO L225 Difference]: With dead ends: 1107 [2019-11-06 22:12:57,985 INFO L226 Difference]: Without dead ends: 730 [2019-11-06 22:12:57,991 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:12:58,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-11-06 22:12:58,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 705. [2019-11-06 22:12:58,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-11-06 22:12:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1008 transitions. [2019-11-06 22:12:58,101 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1008 transitions. Word has length 143 [2019-11-06 22:12:58,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:58,102 INFO L462 AbstractCegarLoop]: Abstraction has 705 states and 1008 transitions. [2019-11-06 22:12:58,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:12:58,102 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1008 transitions. [2019-11-06 22:12:58,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-06 22:12:58,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:58,106 INFO L410 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, 1, 1] [2019-11-06 22:12:58,106 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:58,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:58,107 INFO L82 PathProgramCache]: Analyzing trace with hash 25365273, now seen corresponding path program 1 times [2019-11-06 22:12:58,107 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:58,107 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528527414] [2019-11-06 22:12:58,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:58,445 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-11-06 22:12:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:58,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:58,484 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528527414] [2019-11-06 22:12:58,484 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:58,485 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:12:58,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458154081] [2019-11-06 22:12:58,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:12:58,488 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:58,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:12:58,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:12:58,489 INFO L87 Difference]: Start difference. First operand 705 states and 1008 transitions. Second operand 4 states. [2019-11-06 22:13:01,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:01,327 INFO L93 Difference]: Finished difference Result 2069 states and 2954 transitions. [2019-11-06 22:13:01,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:13:01,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-11-06 22:13:01,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:01,336 INFO L225 Difference]: With dead ends: 2069 [2019-11-06 22:13:01,336 INFO L226 Difference]: Without dead ends: 1396 [2019-11-06 22:13:01,340 INFO L630 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-11-06 22:13:01,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2019-11-06 22:13:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 707. [2019-11-06 22:13:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-11-06 22:13:01,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1010 transitions. [2019-11-06 22:13:01,389 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1010 transitions. Word has length 144 [2019-11-06 22:13:01,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:01,390 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 1010 transitions. [2019-11-06 22:13:01,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:13:01,390 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1010 transitions. [2019-11-06 22:13:01,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-06 22:13:01,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:01,394 INFO L410 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, 1, 1, 1] [2019-11-06 22:13:01,394 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:01,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:01,394 INFO L82 PathProgramCache]: Analyzing trace with hash 166703234, now seen corresponding path program 1 times [2019-11-06 22:13:01,395 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:01,395 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779658336] [2019-11-06 22:13:01,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:01,937 WARN L191 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-11-06 22:13:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:01,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:01,984 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779658336] [2019-11-06 22:13:01,984 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:01,985 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:13:01,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208730669] [2019-11-06 22:13:01,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:13:01,990 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:01,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:13:01,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:13:01,997 INFO L87 Difference]: Start difference. First operand 707 states and 1010 transitions. Second operand 4 states. [2019-11-06 22:13:04,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:04,983 INFO L93 Difference]: Finished difference Result 1893 states and 2715 transitions. [2019-11-06 22:13:04,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:13:04,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-06 22:13:04,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:04,992 INFO L225 Difference]: With dead ends: 1893 [2019-11-06 22:13:04,992 INFO L226 Difference]: Without dead ends: 1368 [2019-11-06 22:13:04,994 INFO L630 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-11-06 22:13:04,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2019-11-06 22:13:05,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1343. [2019-11-06 22:13:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1343 states. [2019-11-06 22:13:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1911 transitions. [2019-11-06 22:13:05,078 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1911 transitions. Word has length 145 [2019-11-06 22:13:05,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:05,079 INFO L462 AbstractCegarLoop]: Abstraction has 1343 states and 1911 transitions. [2019-11-06 22:13:05,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:13:05,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1911 transitions. [2019-11-06 22:13:05,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-06 22:13:05,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:05,085 INFO L410 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, 1, 1, 1] [2019-11-06 22:13:05,086 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:05,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:05,087 INFO L82 PathProgramCache]: Analyzing trace with hash 271175045, now seen corresponding path program 1 times [2019-11-06 22:13:05,087 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:05,087 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862499841] [2019-11-06 22:13:05,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:05,769 WARN L191 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-11-06 22:13:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:05,845 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862499841] [2019-11-06 22:13:05,845 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:05,845 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:13:05,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968483201] [2019-11-06 22:13:05,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:13:05,847 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:05,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:13:05,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:13:05,848 INFO L87 Difference]: Start difference. First operand 1343 states and 1911 transitions. Second operand 5 states. [2019-11-06 22:13:07,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:07,688 INFO L93 Difference]: Finished difference Result 2201 states and 3141 transitions. [2019-11-06 22:13:07,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:13:07,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-11-06 22:13:07,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:07,696 INFO L225 Difference]: With dead ends: 2201 [2019-11-06 22:13:07,697 INFO L226 Difference]: Without dead ends: 1030 [2019-11-06 22:13:07,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:13:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-11-06 22:13:07,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1030. [2019-11-06 22:13:07,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030 states. [2019-11-06 22:13:07,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1457 transitions. [2019-11-06 22:13:07,746 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1457 transitions. Word has length 145 [2019-11-06 22:13:07,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:07,747 INFO L462 AbstractCegarLoop]: Abstraction has 1030 states and 1457 transitions. [2019-11-06 22:13:07,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:13:07,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1457 transitions. [2019-11-06 22:13:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-06 22:13:07,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:07,751 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:13:07,751 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:07,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:07,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1646821595, now seen corresponding path program 1 times [2019-11-06 22:13:07,752 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:07,752 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384965635] [2019-11-06 22:13:07,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:08,388 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-11-06 22:13:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:08,481 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384965635] [2019-11-06 22:13:08,482 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:08,482 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 22:13:08,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118812004] [2019-11-06 22:13:08,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:13:08,483 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:08,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:13:08,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:13:08,484 INFO L87 Difference]: Start difference. First operand 1030 states and 1457 transitions. Second operand 10 states. [2019-11-06 22:13:08,826 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-11-06 22:13:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:11,045 INFO L93 Difference]: Finished difference Result 2677 states and 3904 transitions. [2019-11-06 22:13:11,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 22:13:11,046 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 151 [2019-11-06 22:13:11,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:11,055 INFO L225 Difference]: With dead ends: 2677 [2019-11-06 22:13:11,055 INFO L226 Difference]: Without dead ends: 1818 [2019-11-06 22:13:11,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-06 22:13:11,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2019-11-06 22:13:11,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1496. [2019-11-06 22:13:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-11-06 22:13:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2138 transitions. [2019-11-06 22:13:11,131 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2138 transitions. Word has length 151 [2019-11-06 22:13:11,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:11,132 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 2138 transitions. [2019-11-06 22:13:11,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:13:11,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2138 transitions. [2019-11-06 22:13:11,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-06 22:13:11,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:11,136 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:13:11,136 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:11,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:11,137 INFO L82 PathProgramCache]: Analyzing trace with hash 154501339, now seen corresponding path program 1 times [2019-11-06 22:13:11,137 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:11,137 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682434508] [2019-11-06 22:13:11,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:11,555 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-11-06 22:13:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:11,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:11,604 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682434508] [2019-11-06 22:13:11,604 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:11,604 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:13:11,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041760920] [2019-11-06 22:13:11,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:13:11,605 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:11,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:13:11,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:13:11,606 INFO L87 Difference]: Start difference. First operand 1496 states and 2138 transitions. Second operand 5 states. [2019-11-06 22:13:11,882 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2019-11-06 22:13:13,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:13,437 INFO L93 Difference]: Finished difference Result 2950 states and 4367 transitions. [2019-11-06 22:13:13,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:13:13,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-11-06 22:13:13,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:13,455 INFO L225 Difference]: With dead ends: 2950 [2019-11-06 22:13:13,455 INFO L226 Difference]: Without dead ends: 2430 [2019-11-06 22:13:13,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:13:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2019-11-06 22:13:13,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2428. [2019-11-06 22:13:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2019-11-06 22:13:13,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 3512 transitions. [2019-11-06 22:13:13,570 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 3512 transitions. Word has length 151 [2019-11-06 22:13:13,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:13,571 INFO L462 AbstractCegarLoop]: Abstraction has 2428 states and 3512 transitions. [2019-11-06 22:13:13,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:13:13,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 3512 transitions. [2019-11-06 22:13:13,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-06 22:13:13,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:13,576 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:13:13,577 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:13,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:13,577 INFO L82 PathProgramCache]: Analyzing trace with hash 2031358202, now seen corresponding path program 1 times [2019-11-06 22:13:13,577 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:13,578 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775627929] [2019-11-06 22:13:13,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:14,016 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-11-06 22:13:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:14,067 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775627929] [2019-11-06 22:13:14,067 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:14,067 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:13:14,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401535599] [2019-11-06 22:13:14,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:13:14,070 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:14,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:13:14,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:13:14,070 INFO L87 Difference]: Start difference. First operand 2428 states and 3512 transitions. Second operand 5 states. [2019-11-06 22:13:16,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:16,837 INFO L93 Difference]: Finished difference Result 6277 states and 9070 transitions. [2019-11-06 22:13:16,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:13:16,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-11-06 22:13:16,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:16,853 INFO L225 Difference]: With dead ends: 6277 [2019-11-06 22:13:16,854 INFO L226 Difference]: Without dead ends: 3872 [2019-11-06 22:13:16,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:13:16,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3872 states. [2019-11-06 22:13:17,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3872 to 3850. [2019-11-06 22:13:17,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3850 states. [2019-11-06 22:13:17,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 3850 states and 5507 transitions. [2019-11-06 22:13:17,080 INFO L78 Accepts]: Start accepts. Automaton has 3850 states and 5507 transitions. Word has length 151 [2019-11-06 22:13:17,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:17,080 INFO L462 AbstractCegarLoop]: Abstraction has 3850 states and 5507 transitions. [2019-11-06 22:13:17,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:13:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3850 states and 5507 transitions. [2019-11-06 22:13:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-06 22:13:17,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:17,089 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:13:17,090 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:17,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:17,091 INFO L82 PathProgramCache]: Analyzing trace with hash 30760331, now seen corresponding path program 1 times [2019-11-06 22:13:17,091 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:17,091 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42150128] [2019-11-06 22:13:17,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:17,486 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-11-06 22:13:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:17,536 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42150128] [2019-11-06 22:13:17,536 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:17,536 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:13:17,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192388688] [2019-11-06 22:13:17,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:13:17,538 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:17,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:13:17,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:13:17,538 INFO L87 Difference]: Start difference. First operand 3850 states and 5507 transitions. Second operand 4 states. [2019-11-06 22:13:20,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:20,429 INFO L93 Difference]: Finished difference Result 10830 states and 15529 transitions. [2019-11-06 22:13:20,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:13:20,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-06 22:13:20,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:20,456 INFO L225 Difference]: With dead ends: 10830 [2019-11-06 22:13:20,456 INFO L226 Difference]: Without dead ends: 7331 [2019-11-06 22:13:20,464 INFO L630 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-11-06 22:13:20,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7331 states. [2019-11-06 22:13:20,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7331 to 7311. [2019-11-06 22:13:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7311 states. [2019-11-06 22:13:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7311 states to 7311 states and 10356 transitions. [2019-11-06 22:13:20,804 INFO L78 Accepts]: Start accepts. Automaton has 7311 states and 10356 transitions. Word has length 153 [2019-11-06 22:13:20,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:20,804 INFO L462 AbstractCegarLoop]: Abstraction has 7311 states and 10356 transitions. [2019-11-06 22:13:20,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:13:20,804 INFO L276 IsEmpty]: Start isEmpty. Operand 7311 states and 10356 transitions. [2019-11-06 22:13:20,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-06 22:13:20,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:20,816 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:13:20,816 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:20,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:20,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1476891570, now seen corresponding path program 1 times [2019-11-06 22:13:20,817 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:20,817 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592196720] [2019-11-06 22:13:20,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:21,244 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-11-06 22:13:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:21,283 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592196720] [2019-11-06 22:13:21,283 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:21,283 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:13:21,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840455218] [2019-11-06 22:13:21,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:13:21,284 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:21,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:13:21,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:13:21,284 INFO L87 Difference]: Start difference. First operand 7311 states and 10356 transitions. Second operand 5 states. [2019-11-06 22:13:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:22,899 INFO L93 Difference]: Finished difference Result 11608 states and 16445 transitions. [2019-11-06 22:13:22,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:13:22,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-11-06 22:13:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:22,922 INFO L225 Difference]: With dead ends: 11608 [2019-11-06 22:13:22,922 INFO L226 Difference]: Without dead ends: 5961 [2019-11-06 22:13:22,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:13:22,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2019-11-06 22:13:23,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 5961. [2019-11-06 22:13:23,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5961 states. [2019-11-06 22:13:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5961 states to 5961 states and 8411 transitions. [2019-11-06 22:13:23,252 INFO L78 Accepts]: Start accepts. Automaton has 5961 states and 8411 transitions. Word has length 153 [2019-11-06 22:13:23,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:23,252 INFO L462 AbstractCegarLoop]: Abstraction has 5961 states and 8411 transitions. [2019-11-06 22:13:23,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:13:23,256 INFO L276 IsEmpty]: Start isEmpty. Operand 5961 states and 8411 transitions. [2019-11-06 22:13:23,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-06 22:13:23,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:23,268 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:13:23,268 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:23,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:23,276 INFO L82 PathProgramCache]: Analyzing trace with hash 770800706, now seen corresponding path program 1 times [2019-11-06 22:13:23,279 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:23,280 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131305563] [2019-11-06 22:13:23,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:23,814 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-11-06 22:13:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:23,866 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131305563] [2019-11-06 22:13:23,866 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:23,867 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 22:13:23,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593989998] [2019-11-06 22:13:23,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 22:13:23,868 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:23,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 22:13:23,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:13:23,868 INFO L87 Difference]: Start difference. First operand 5961 states and 8411 transitions. Second operand 9 states. [2019-11-06 22:13:24,138 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 194