/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_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:15:04,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:15:04,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:15:04,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:15:04,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:15:04,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:15:04,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:15:04,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:15:04,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:15:04,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:15:04,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:15:04,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:15:04,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:15:04,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:15:04,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:15:04,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:15:04,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:15:04,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:15:04,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:15:04,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:15:04,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:15:04,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:15:04,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:15:04,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:15:04,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:15:04,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:15:04,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:15:04,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:15:04,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:15:04,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:15:04,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:15:04,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:15:04,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:15:04,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:15:04,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:15:04,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:15:04,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:15:04,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:15:04,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:15:04,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:15:04,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:15:04,216 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:15:04,244 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:15:04,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:15:04,250 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:15:04,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:15:04,253 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:15:04,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:15:04,253 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:15:04,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:15:04,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:15:04,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:15:04,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:15:04,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:15:04,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:15:04,255 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:15:04,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:15:04,255 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:15:04,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:15:04,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:15:04,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:15:04,259 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:15:04,259 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:15:04,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:15:04,259 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:15:04,260 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:15:04,260 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:15:04,260 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:15:04,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:15:04,260 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:15:04,260 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:15:04,587 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:15:04,606 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:15:04,610 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:15:04,611 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:15:04,612 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:15:04,612 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-06 22:15:04,683 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/781a9f963/fac95716c2c74e78886d45b495f88be7/FLAG821d5dda9 [2019-11-06 22:15:05,243 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:15:05,243 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-06 22:15:05,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/781a9f963/fac95716c2c74e78886d45b495f88be7/FLAG821d5dda9 [2019-11-06 22:15:05,513 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/781a9f963/fac95716c2c74e78886d45b495f88be7 [2019-11-06 22:15:05,521 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:15:05,523 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:15:05,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:15:05,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:15:05,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:15:05,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:05" (1/1) ... [2019-11-06 22:15:05,536 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:15:05, skipping insertion in model container [2019-11-06 22:15:05,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:05" (1/1) ... [2019-11-06 22:15:05,544 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:15:05,618 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:15:06,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:15:06,360 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:15:06,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:15:06,596 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:15:06,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:06 WrapperNode [2019-11-06 22:15:06,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:15:06,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:15:06,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:15:06,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:15:06,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:06" (1/1) ... [2019-11-06 22:15:06,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:06" (1/1) ... [2019-11-06 22:15:06,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:06" (1/1) ... [2019-11-06 22:15:06,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:06" (1/1) ... [2019-11-06 22:15:06,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:06" (1/1) ... [2019-11-06 22:15:06,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:06" (1/1) ... [2019-11-06 22:15:06,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:06" (1/1) ... [2019-11-06 22:15:06,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:15:06,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:15:06,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:15:06,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:15:06,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:06" (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:15:06,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:15:06,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:15:06,892 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:15:06,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:15:06,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 22:15:06,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-06 22:15:06,894 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-06 22:15:06,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 22:15:06,895 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-06 22:15:06,895 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-06 22:15:06,895 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-06 22:15:06,896 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-06 22:15:06,896 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-06 22:15:06,897 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-06 22:15:06,897 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-06 22:15:06,898 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:15:06,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:15:06,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:15:08,840 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:15:08,840 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-06 22:15:08,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:08 BoogieIcfgContainer [2019-11-06 22:15:08,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:15:08,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:15:08,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:15:08,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:15:08,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:15:05" (1/3) ... [2019-11-06 22:15:08,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6d31ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:08, skipping insertion in model container [2019-11-06 22:15:08,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:06" (2/3) ... [2019-11-06 22:15:08,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6d31ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:08, skipping insertion in model container [2019-11-06 22:15:08,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:08" (3/3) ... [2019-11-06 22:15:08,859 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-06 22:15:08,870 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:15:08,898 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-06 22:15:08,910 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-06 22:15:08,941 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:15:08,941 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:15:08,941 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:15:08,942 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:15:08,942 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:15:08,942 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:15:08,942 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:15:08,942 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:15:08,972 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states. [2019-11-06 22:15:08,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-06 22:15:08,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:08,992 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] [2019-11-06 22:15:08,994 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:09,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:09,001 INFO L82 PathProgramCache]: Analyzing trace with hash 42890573, now seen corresponding path program 1 times [2019-11-06 22:15:09,009 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:09,010 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86441597] [2019-11-06 22:15:09,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:10,382 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-11-06 22:15:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:10,503 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:15:10,504 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86441597] [2019-11-06 22:15:10,505 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:10,505 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:15:10,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395848061] [2019-11-06 22:15:10,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:15:10,514 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:10,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:15:10,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:15:10,531 INFO L87 Difference]: Start difference. First operand 418 states. Second operand 5 states. [2019-11-06 22:15:14,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:14,529 INFO L93 Difference]: Finished difference Result 1212 states and 2155 transitions. [2019-11-06 22:15:14,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:15:14,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-11-06 22:15:14,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:14,552 INFO L225 Difference]: With dead ends: 1212 [2019-11-06 22:15:14,553 INFO L226 Difference]: Without dead ends: 799 [2019-11-06 22:15:14,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 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:15:14,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-11-06 22:15:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 773. [2019-11-06 22:15:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-11-06 22:15:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1109 transitions. [2019-11-06 22:15:14,705 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1109 transitions. Word has length 152 [2019-11-06 22:15:14,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:14,707 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1109 transitions. [2019-11-06 22:15:14,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:15:14,707 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1109 transitions. [2019-11-06 22:15:14,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-06 22:15:14,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:14,719 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:15:14,719 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:14,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:14,720 INFO L82 PathProgramCache]: Analyzing trace with hash -832663523, now seen corresponding path program 1 times [2019-11-06 22:15:14,720 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:14,721 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447593589] [2019-11-06 22:15:14,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:15,146 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-11-06 22:15:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:15,183 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:15:15,184 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447593589] [2019-11-06 22:15:15,184 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:15,184 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:15,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123159419] [2019-11-06 22:15:15,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:15,186 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:15,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:15,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:15,187 INFO L87 Difference]: Start difference. First operand 773 states and 1109 transitions. Second operand 4 states. [2019-11-06 22:15:17,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:17,580 INFO L93 Difference]: Finished difference Result 2273 states and 3257 transitions. [2019-11-06 22:15:17,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:15:17,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-06 22:15:17,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:17,590 INFO L225 Difference]: With dead ends: 2273 [2019-11-06 22:15:17,591 INFO L226 Difference]: Without dead ends: 1532 [2019-11-06 22:15:17,595 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:15:17,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-11-06 22:15:17,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 775. [2019-11-06 22:15:17,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-11-06 22:15:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1111 transitions. [2019-11-06 22:15:17,690 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1111 transitions. Word has length 153 [2019-11-06 22:15:17,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:17,692 INFO L462 AbstractCegarLoop]: Abstraction has 775 states and 1111 transitions. [2019-11-06 22:15:17,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:15:17,693 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1111 transitions. [2019-11-06 22:15:17,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-06 22:15:17,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:17,696 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] [2019-11-06 22:15:17,698 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:17,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:17,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1878298894, now seen corresponding path program 1 times [2019-11-06 22:15:17,698 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:17,699 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719453079] [2019-11-06 22:15:17,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:18,322 WARN L191 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-11-06 22:15:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:18,393 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:15:18,393 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719453079] [2019-11-06 22:15:18,394 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:18,394 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:15:18,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594312642] [2019-11-06 22:15:18,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:15:18,397 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:18,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:15:18,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:15:18,401 INFO L87 Difference]: Start difference. First operand 775 states and 1111 transitions. Second operand 5 states. [2019-11-06 22:15:20,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:20,302 INFO L93 Difference]: Finished difference Result 1532 states and 2197 transitions. [2019-11-06 22:15:20,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:15:20,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-11-06 22:15:20,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:20,312 INFO L225 Difference]: With dead ends: 1532 [2019-11-06 22:15:20,313 INFO L226 Difference]: Without dead ends: 775 [2019-11-06 22:15:20,317 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:15:20,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-11-06 22:15:20,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 774. [2019-11-06 22:15:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-11-06 22:15:20,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1108 transitions. [2019-11-06 22:15:20,346 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1108 transitions. Word has length 154 [2019-11-06 22:15:20,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:20,347 INFO L462 AbstractCegarLoop]: Abstraction has 774 states and 1108 transitions. [2019-11-06 22:15:20,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:15:20,347 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1108 transitions. [2019-11-06 22:15:20,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-06 22:15:20,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:20,350 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] [2019-11-06 22:15:20,350 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:20,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:20,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1636071890, now seen corresponding path program 1 times [2019-11-06 22:15:20,351 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:20,351 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093990561] [2019-11-06 22:15:20,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:20,947 WARN L191 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-11-06 22:15:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:21,022 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:15:21,022 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093990561] [2019-11-06 22:15:21,023 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:21,023 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:15:21,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741311895] [2019-11-06 22:15:21,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:15:21,024 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:21,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:15:21,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:15:21,026 INFO L87 Difference]: Start difference. First operand 774 states and 1108 transitions. Second operand 5 states. [2019-11-06 22:15:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:22,688 INFO L93 Difference]: Finished difference Result 1535 states and 2199 transitions. [2019-11-06 22:15:22,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:15:22,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-11-06 22:15:22,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:22,692 INFO L225 Difference]: With dead ends: 1535 [2019-11-06 22:15:22,692 INFO L226 Difference]: Without dead ends: 772 [2019-11-06 22:15:22,694 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:15:22,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-11-06 22:15:22,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2019-11-06 22:15:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-11-06 22:15:22,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1104 transitions. [2019-11-06 22:15:22,724 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1104 transitions. Word has length 154 [2019-11-06 22:15:22,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:22,724 INFO L462 AbstractCegarLoop]: Abstraction has 772 states and 1104 transitions. [2019-11-06 22:15:22,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:15:22,724 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1104 transitions. [2019-11-06 22:15:22,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-06 22:15:22,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:22,727 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] [2019-11-06 22:15:22,727 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:22,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:22,728 INFO L82 PathProgramCache]: Analyzing trace with hash -674126987, now seen corresponding path program 1 times [2019-11-06 22:15:22,728 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:22,728 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48753772] [2019-11-06 22:15:22,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:23,080 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-11-06 22:15:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:23,130 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:15:23,131 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48753772] [2019-11-06 22:15:23,131 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:23,131 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:23,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302244613] [2019-11-06 22:15:23,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:23,132 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:23,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:23,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:23,133 INFO L87 Difference]: Start difference. First operand 772 states and 1104 transitions. Second operand 4 states. [2019-11-06 22:15:26,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:26,500 INFO L93 Difference]: Finished difference Result 1732 states and 2480 transitions. [2019-11-06 22:15:26,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:15:26,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-06 22:15:26,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:26,509 INFO L225 Difference]: With dead ends: 1732 [2019-11-06 22:15:26,509 INFO L226 Difference]: Without dead ends: 1156 [2019-11-06 22:15:26,511 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:15:26,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2019-11-06 22:15:26,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1130. [2019-11-06 22:15:26,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-11-06 22:15:26,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1602 transitions. [2019-11-06 22:15:26,550 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1602 transitions. Word has length 154 [2019-11-06 22:15:26,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:26,551 INFO L462 AbstractCegarLoop]: Abstraction has 1130 states and 1602 transitions. [2019-11-06 22:15:26,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:15:26,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1602 transitions. [2019-11-06 22:15:26,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-06 22:15:26,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:26,554 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] [2019-11-06 22:15:26,555 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:26,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:26,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1140766677, now seen corresponding path program 1 times [2019-11-06 22:15:26,555 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:26,556 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037369131] [2019-11-06 22:15:26,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:26,871 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-11-06 22:15:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:26,932 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:15:26,933 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037369131] [2019-11-06 22:15:26,934 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:26,934 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:26,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668342778] [2019-11-06 22:15:26,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:26,936 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:26,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:26,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:26,937 INFO L87 Difference]: Start difference. First operand 1130 states and 1602 transitions. Second operand 4 states. [2019-11-06 22:15:29,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:29,079 INFO L93 Difference]: Finished difference Result 2442 states and 3547 transitions. [2019-11-06 22:15:29,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:15:29,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-06 22:15:29,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:29,086 INFO L225 Difference]: With dead ends: 2442 [2019-11-06 22:15:29,087 INFO L226 Difference]: Without dead ends: 1501 [2019-11-06 22:15:29,089 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:15:29,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2019-11-06 22:15:29,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1342. [2019-11-06 22:15:29,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-11-06 22:15:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1945 transitions. [2019-11-06 22:15:29,139 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1945 transitions. Word has length 156 [2019-11-06 22:15:29,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:29,139 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 1945 transitions. [2019-11-06 22:15:29,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:15:29,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1945 transitions. [2019-11-06 22:15:29,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-06 22:15:29,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:29,143 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] [2019-11-06 22:15:29,143 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:29,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:29,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1542236816, now seen corresponding path program 1 times [2019-11-06 22:15:29,144 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:29,144 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155388110] [2019-11-06 22:15:29,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:29,475 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-11-06 22:15:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:29,544 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:15:29,544 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155388110] [2019-11-06 22:15:29,544 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:29,544 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:29,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699448407] [2019-11-06 22:15:29,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:29,545 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:29,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:29,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:29,546 INFO L87 Difference]: Start difference. First operand 1342 states and 1945 transitions. Second operand 4 states. [2019-11-06 22:15:31,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:31,853 INFO L93 Difference]: Finished difference Result 2987 states and 4450 transitions. [2019-11-06 22:15:31,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:15:31,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-06 22:15:31,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:31,864 INFO L225 Difference]: With dead ends: 2987 [2019-11-06 22:15:31,864 INFO L226 Difference]: Without dead ends: 1918 [2019-11-06 22:15:31,867 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:15:31,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2019-11-06 22:15:31,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1719. [2019-11-06 22:15:31,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-11-06 22:15:31,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2553 transitions. [2019-11-06 22:15:31,935 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2553 transitions. Word has length 158 [2019-11-06 22:15:31,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:31,936 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2553 transitions. [2019-11-06 22:15:31,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:15:31,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2553 transitions. [2019-11-06 22:15:31,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-06 22:15:31,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:31,939 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:15:31,939 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:31,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:31,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1399172685, now seen corresponding path program 1 times [2019-11-06 22:15:31,940 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:31,940 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372384709] [2019-11-06 22:15:31,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:32,320 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-11-06 22:15:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:32,370 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:15:32,370 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372384709] [2019-11-06 22:15:32,370 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:32,371 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:15:32,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90075796] [2019-11-06 22:15:32,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:15:32,372 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:32,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:15:32,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:15:32,372 INFO L87 Difference]: Start difference. First operand 1719 states and 2553 transitions. Second operand 6 states. [2019-11-06 22:15:32,673 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 208 [2019-11-06 22:15:34,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:34,581 INFO L93 Difference]: Finished difference Result 4371 states and 6633 transitions. [2019-11-06 22:15:34,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:15:34,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-11-06 22:15:34,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:34,598 INFO L225 Difference]: With dead ends: 4371 [2019-11-06 22:15:34,598 INFO L226 Difference]: Without dead ends: 2835 [2019-11-06 22:15:34,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:15:34,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2019-11-06 22:15:34,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2833. [2019-11-06 22:15:34,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2833 states. [2019-11-06 22:15:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2833 states to 2833 states and 4278 transitions. [2019-11-06 22:15:34,723 INFO L78 Accepts]: Start accepts. Automaton has 2833 states and 4278 transitions. Word has length 159 [2019-11-06 22:15:34,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:34,724 INFO L462 AbstractCegarLoop]: Abstraction has 2833 states and 4278 transitions. [2019-11-06 22:15:34,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:15:34,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2833 states and 4278 transitions. [2019-11-06 22:15:34,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-06 22:15:34,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:34,727 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:15:34,728 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:34,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:34,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1519156504, now seen corresponding path program 1 times [2019-11-06 22:15:34,728 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:34,729 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817843113] [2019-11-06 22:15:34,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:35,124 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-11-06 22:15:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:35,185 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:15:35,186 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817843113] [2019-11-06 22:15:35,186 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:35,186 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:15:35,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504783977] [2019-11-06 22:15:35,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:15:35,187 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:35,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:15:35,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:15:35,188 INFO L87 Difference]: Start difference. First operand 2833 states and 4278 transitions. Second operand 5 states. [2019-11-06 22:15:38,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:38,161 INFO L93 Difference]: Finished difference Result 7338 states and 11090 transitions. [2019-11-06 22:15:38,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:15:38,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-11-06 22:15:38,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:38,179 INFO L225 Difference]: With dead ends: 7338 [2019-11-06 22:15:38,179 INFO L226 Difference]: Without dead ends: 4536 [2019-11-06 22:15:38,185 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:15:38,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2019-11-06 22:15:38,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 4513. [2019-11-06 22:15:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4513 states. [2019-11-06 22:15:38,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4513 states to 4513 states and 6769 transitions. [2019-11-06 22:15:38,392 INFO L78 Accepts]: Start accepts. Automaton has 4513 states and 6769 transitions. Word has length 159 [2019-11-06 22:15:38,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:38,393 INFO L462 AbstractCegarLoop]: Abstraction has 4513 states and 6769 transitions. [2019-11-06 22:15:38,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:15:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 4513 states and 6769 transitions. [2019-11-06 22:15:38,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-06 22:15:38,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:38,398 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, 1, 1] [2019-11-06 22:15:38,398 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:38,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:38,399 INFO L82 PathProgramCache]: Analyzing trace with hash 779025742, now seen corresponding path program 1 times [2019-11-06 22:15:38,399 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:38,399 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316748438] [2019-11-06 22:15:38,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:38,712 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-11-06 22:15:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:38,755 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:15:38,755 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316748438] [2019-11-06 22:15:38,756 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:38,756 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:38,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526565585] [2019-11-06 22:15:38,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:38,757 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:38,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:38,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:38,757 INFO L87 Difference]: Start difference. First operand 4513 states and 6769 transitions. Second operand 4 states. [2019-11-06 22:15:40,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:40,989 INFO L93 Difference]: Finished difference Result 11128 states and 16749 transitions. [2019-11-06 22:15:40,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:15:40,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-06 22:15:40,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:41,012 INFO L225 Difference]: With dead ends: 11128 [2019-11-06 22:15:41,012 INFO L226 Difference]: Without dead ends: 6987 [2019-11-06 22:15:41,021 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:15:41,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6987 states. [2019-11-06 22:15:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6987 to 6966. [2019-11-06 22:15:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6966 states. [2019-11-06 22:15:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6966 states to 6966 states and 10335 transitions. [2019-11-06 22:15:41,390 INFO L78 Accepts]: Start accepts. Automaton has 6966 states and 10335 transitions. Word has length 161 [2019-11-06 22:15:41,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:41,390 INFO L462 AbstractCegarLoop]: Abstraction has 6966 states and 10335 transitions. [2019-11-06 22:15:41,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:15:41,390 INFO L276 IsEmpty]: Start isEmpty. Operand 6966 states and 10335 transitions. [2019-11-06 22:15:41,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-06 22:15:41,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:41,398 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, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:41,398 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:41,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:41,398 INFO L82 PathProgramCache]: Analyzing trace with hash -169339511, now seen corresponding path program 1 times [2019-11-06 22:15:41,399 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:41,399 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406880909] [2019-11-06 22:15:41,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:41,709 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-11-06 22:15:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:41,743 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:15:41,743 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406880909] [2019-11-06 22:15:41,743 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:41,743 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:41,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820660296] [2019-11-06 22:15:41,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:41,744 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:41,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:41,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:41,745 INFO L87 Difference]: Start difference. First operand 6966 states and 10335 transitions. Second operand 4 states.