/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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:07:33,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:07:33,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:07:33,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:07:33,139 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:07:33,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:07:33,143 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:07:33,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:07:33,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:07:33,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:07:33,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:07:33,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:07:33,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:07:33,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:07:33,170 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:07:33,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:07:33,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:07:33,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:07:33,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:07:33,181 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:07:33,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:07:33,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:07:33,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:07:33,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:07:33,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:07:33,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:07:33,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:07:33,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:07:33,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:07:33,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:07:33,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:07:33,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:07:33,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:07:33,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:07:33,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:07:33,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:07:33,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:07:33,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:07:33,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:07:33,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:07:33,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:07:33,202 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-07 01:07:33,217 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:07:33,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:07:33,219 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:07:33,219 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:07:33,219 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:07:33,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:07:33,220 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:07:33,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:07:33,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:07:33,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:07:33,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:07:33,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:07:33,221 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:07:33,221 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:07:33,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:07:33,221 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:07:33,221 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:07:33,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:07:33,222 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:07:33,222 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:07:33,222 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:07:33,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:07:33,223 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:07:33,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:07:33,223 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:07:33,223 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:07:33,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:07:33,223 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:07:33,224 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 01:07:33,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:07:33,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:07:33,520 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:07:33,521 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:07:33,522 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:07:33,523 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-11-07 01:07:33,593 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cce06322f/03c3a2a92f2148b1b82babe8be919584/FLAGb25a93c59 [2019-11-07 01:07:34,144 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:07:34,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-11-07 01:07:34,155 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cce06322f/03c3a2a92f2148b1b82babe8be919584/FLAGb25a93c59 [2019-11-07 01:07:34,452 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cce06322f/03c3a2a92f2148b1b82babe8be919584 [2019-11-07 01:07:34,460 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:07:34,461 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:07:34,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:07:34,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:07:34,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:07:34,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:07:34" (1/1) ... [2019-11-07 01:07:34,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d72cbe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:34, skipping insertion in model container [2019-11-07 01:07:34,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:07:34" (1/1) ... [2019-11-07 01:07:34,479 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:07:34,538 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:07:34,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:07:34,943 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:07:35,008 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:07:35,043 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:07:35,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:35 WrapperNode [2019-11-07 01:07:35,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:07:35,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:07:35,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:07:35,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:07:35,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:35" (1/1) ... [2019-11-07 01:07:35,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:35" (1/1) ... [2019-11-07 01:07:35,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:35" (1/1) ... [2019-11-07 01:07:35,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:35" (1/1) ... [2019-11-07 01:07:35,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:35" (1/1) ... [2019-11-07 01:07:35,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:35" (1/1) ... [2019-11-07 01:07:35,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:35" (1/1) ... [2019-11-07 01:07:35,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:07:35,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:07:35,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:07:35,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:07:35,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:07:35,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:07:35,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:07:35,176 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-11-07 01:07:35,176 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-11-07 01:07:35,177 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-11-07 01:07:35,177 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-11-07 01:07:35,177 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-11-07 01:07:35,177 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-11-07 01:07:35,177 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-07 01:07:35,177 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-11-07 01:07:35,177 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-11-07 01:07:35,177 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-11-07 01:07:35,178 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-11-07 01:07:35,178 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:07:35,178 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-11-07 01:07:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:07:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:07:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:07:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:07:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:07:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:07:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:07:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-11-07 01:07:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-11-07 01:07:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-11-07 01:07:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-11-07 01:07:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-11-07 01:07:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:07:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:07:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-11-07 01:07:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-11-07 01:07:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-11-07 01:07:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-11-07 01:07:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:07:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:07:35,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:07:36,040 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:07:36,040 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-07 01:07:36,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:07:36 BoogieIcfgContainer [2019-11-07 01:07:36,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:07:36,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:07:36,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:07:36,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:07:36,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:07:34" (1/3) ... [2019-11-07 01:07:36,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea5b7fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:07:36, skipping insertion in model container [2019-11-07 01:07:36,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:35" (2/3) ... [2019-11-07 01:07:36,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea5b7fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:07:36, skipping insertion in model container [2019-11-07 01:07:36,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:07:36" (3/3) ... [2019-11-07 01:07:36,051 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-11-07 01:07:36,062 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:07:36,071 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:07:36,084 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:07:36,113 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:07:36,113 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:07:36,113 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:07:36,113 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:07:36,114 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:07:36,114 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:07:36,114 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:07:36,114 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:07:36,140 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states. [2019-11-07 01:07:36,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 01:07:36,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:36,150 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] [2019-11-07 01:07:36,152 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:36,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:36,158 INFO L82 PathProgramCache]: Analyzing trace with hash 310880814, now seen corresponding path program 1 times [2019-11-07 01:07:36,167 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:36,167 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670415819] [2019-11-07 01:07:36,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:36,428 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-07 01:07:36,429 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670415819] [2019-11-07 01:07:36,430 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:36,430 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:36,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61593128] [2019-11-07 01:07:36,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:36,440 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:36,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:36,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:36,456 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 4 states. [2019-11-07 01:07:36,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:36,665 INFO L93 Difference]: Finished difference Result 412 states and 673 transitions. [2019-11-07 01:07:36,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:07:36,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-07 01:07:36,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:36,696 INFO L225 Difference]: With dead ends: 412 [2019-11-07 01:07:36,696 INFO L226 Difference]: Without dead ends: 212 [2019-11-07 01:07:36,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:36,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-11-07 01:07:36,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2019-11-07 01:07:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-07 01:07:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 313 transitions. [2019-11-07 01:07:36,786 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 313 transitions. Word has length 21 [2019-11-07 01:07:36,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:36,787 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 313 transitions. [2019-11-07 01:07:36,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 313 transitions. [2019-11-07 01:07:36,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-07 01:07:36,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:36,790 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] [2019-11-07 01:07:36,790 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:36,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:36,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1405375627, now seen corresponding path program 1 times [2019-11-07 01:07:36,791 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:36,791 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430176784] [2019-11-07 01:07:36,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:36,941 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-07 01:07:36,941 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430176784] [2019-11-07 01:07:36,941 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:36,941 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:36,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334177787] [2019-11-07 01:07:36,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:36,946 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:36,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:36,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:36,947 INFO L87 Difference]: Start difference. First operand 210 states and 313 transitions. Second operand 4 states. [2019-11-07 01:07:37,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:37,028 INFO L93 Difference]: Finished difference Result 427 states and 643 transitions. [2019-11-07 01:07:37,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:07:37,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-07 01:07:37,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:37,038 INFO L225 Difference]: With dead ends: 427 [2019-11-07 01:07:37,038 INFO L226 Difference]: Without dead ends: 226 [2019-11-07 01:07:37,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:37,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-07 01:07:37,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 223. [2019-11-07 01:07:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-07 01:07:37,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 329 transitions. [2019-11-07 01:07:37,080 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 329 transitions. Word has length 22 [2019-11-07 01:07:37,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:37,080 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 329 transitions. [2019-11-07 01:07:37,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:37,081 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 329 transitions. [2019-11-07 01:07:37,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-07 01:07:37,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:37,083 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:37,083 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:37,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:37,084 INFO L82 PathProgramCache]: Analyzing trace with hash -152672816, now seen corresponding path program 1 times [2019-11-07 01:07:37,084 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:37,084 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551614645] [2019-11-07 01:07:37,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:37,160 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551614645] [2019-11-07 01:07:37,161 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:37,161 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:37,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567843681] [2019-11-07 01:07:37,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:37,163 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:37,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:37,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:37,165 INFO L87 Difference]: Start difference. First operand 223 states and 329 transitions. Second operand 3 states. [2019-11-07 01:07:37,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:37,216 INFO L93 Difference]: Finished difference Result 459 states and 689 transitions. [2019-11-07 01:07:37,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:37,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-07 01:07:37,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:37,227 INFO L225 Difference]: With dead ends: 459 [2019-11-07 01:07:37,228 INFO L226 Difference]: Without dead ends: 252 [2019-11-07 01:07:37,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:37,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-11-07 01:07:37,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 225. [2019-11-07 01:07:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-07 01:07:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 331 transitions. [2019-11-07 01:07:37,278 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 331 transitions. Word has length 30 [2019-11-07 01:07:37,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:37,279 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 331 transitions. [2019-11-07 01:07:37,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:37,280 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 331 transitions. [2019-11-07 01:07:37,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-07 01:07:37,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:37,289 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:37,289 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:37,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:37,289 INFO L82 PathProgramCache]: Analyzing trace with hash 279611359, now seen corresponding path program 1 times [2019-11-07 01:07:37,290 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:37,290 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071696873] [2019-11-07 01:07:37,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:37,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:37,412 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071696873] [2019-11-07 01:07:37,412 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:37,412 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:07:37,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824714419] [2019-11-07 01:07:37,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:07:37,413 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:37,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:07:37,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:37,415 INFO L87 Difference]: Start difference. First operand 225 states and 331 transitions. Second operand 5 states. [2019-11-07 01:07:37,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:37,462 INFO L93 Difference]: Finished difference Result 436 states and 647 transitions. [2019-11-07 01:07:37,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:07:37,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-07 01:07:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:37,466 INFO L225 Difference]: With dead ends: 436 [2019-11-07 01:07:37,466 INFO L226 Difference]: Without dead ends: 233 [2019-11-07 01:07:37,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:37,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-11-07 01:07:37,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2019-11-07 01:07:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-11-07 01:07:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 335 transitions. [2019-11-07 01:07:37,482 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 335 transitions. Word has length 38 [2019-11-07 01:07:37,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:37,483 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 335 transitions. [2019-11-07 01:07:37,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:07:37,485 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 335 transitions. [2019-11-07 01:07:37,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-07 01:07:37,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:37,489 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] [2019-11-07 01:07:37,489 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:37,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:37,490 INFO L82 PathProgramCache]: Analyzing trace with hash -955467248, now seen corresponding path program 1 times [2019-11-07 01:07:37,490 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:37,491 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839850755] [2019-11-07 01:07:37,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:37,589 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-07 01:07:37,589 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839850755] [2019-11-07 01:07:37,589 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:37,590 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:37,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363945518] [2019-11-07 01:07:37,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:37,591 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:37,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:37,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:37,592 INFO L87 Difference]: Start difference. First operand 229 states and 335 transitions. Second operand 4 states. [2019-11-07 01:07:37,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:37,625 INFO L93 Difference]: Finished difference Result 397 states and 586 transitions. [2019-11-07 01:07:37,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:37,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-07 01:07:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:37,629 INFO L225 Difference]: With dead ends: 397 [2019-11-07 01:07:37,630 INFO L226 Difference]: Without dead ends: 225 [2019-11-07 01:07:37,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:37,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-07 01:07:37,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2019-11-07 01:07:37,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-07 01:07:37,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 326 transitions. [2019-11-07 01:07:37,652 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 326 transitions. Word has length 39 [2019-11-07 01:07:37,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:37,652 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 326 transitions. [2019-11-07 01:07:37,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:37,653 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 326 transitions. [2019-11-07 01:07:37,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-07 01:07:37,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:37,655 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:37,655 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:37,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:37,655 INFO L82 PathProgramCache]: Analyzing trace with hash -13889788, now seen corresponding path program 1 times [2019-11-07 01:07:37,656 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:37,656 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350872016] [2019-11-07 01:07:37,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 01:07:37,731 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350872016] [2019-11-07 01:07:37,731 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:37,731 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:37,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209862145] [2019-11-07 01:07:37,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:37,733 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:37,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:37,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:37,733 INFO L87 Difference]: Start difference. First operand 225 states and 326 transitions. Second operand 4 states. [2019-11-07 01:07:37,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:37,797 INFO L93 Difference]: Finished difference Result 446 states and 656 transitions. [2019-11-07 01:07:37,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:07:37,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-11-07 01:07:37,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:37,800 INFO L225 Difference]: With dead ends: 446 [2019-11-07 01:07:37,801 INFO L226 Difference]: Without dead ends: 244 [2019-11-07 01:07:37,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:37,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-11-07 01:07:37,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2019-11-07 01:07:37,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-07 01:07:37,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 345 transitions. [2019-11-07 01:07:37,817 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 345 transitions. Word has length 41 [2019-11-07 01:07:37,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:37,818 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 345 transitions. [2019-11-07 01:07:37,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:37,818 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 345 transitions. [2019-11-07 01:07:37,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-07 01:07:37,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:37,820 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:37,820 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:37,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:37,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1194739861, now seen corresponding path program 1 times [2019-11-07 01:07:37,821 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:37,821 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236157715] [2019-11-07 01:07:37,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 01:07:37,873 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236157715] [2019-11-07 01:07:37,873 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:37,874 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:37,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565141935] [2019-11-07 01:07:37,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:37,875 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:37,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:37,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:37,876 INFO L87 Difference]: Start difference. First operand 241 states and 345 transitions. Second operand 4 states. [2019-11-07 01:07:37,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:37,956 INFO L93 Difference]: Finished difference Result 466 states and 684 transitions. [2019-11-07 01:07:37,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:07:37,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-11-07 01:07:37,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:37,960 INFO L225 Difference]: With dead ends: 466 [2019-11-07 01:07:37,960 INFO L226 Difference]: Without dead ends: 250 [2019-11-07 01:07:37,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-07 01:07:37,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-11-07 01:07:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-11-07 01:07:37,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 353 transitions. [2019-11-07 01:07:37,975 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 353 transitions. Word has length 41 [2019-11-07 01:07:37,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:37,976 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 353 transitions. [2019-11-07 01:07:37,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 353 transitions. [2019-11-07 01:07:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 01:07:37,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:37,977 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:37,978 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:37,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:37,978 INFO L82 PathProgramCache]: Analyzing trace with hash -291623798, now seen corresponding path program 1 times [2019-11-07 01:07:37,978 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:37,979 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7988079] [2019-11-07 01:07:37,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-07 01:07:38,051 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7988079] [2019-11-07 01:07:38,051 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:38,051 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:07:38,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011602360] [2019-11-07 01:07:38,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:07:38,052 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:38,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:07:38,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:38,053 INFO L87 Difference]: Start difference. First operand 248 states and 353 transitions. Second operand 5 states. [2019-11-07 01:07:38,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:38,080 INFO L93 Difference]: Finished difference Result 465 states and 671 transitions. [2019-11-07 01:07:38,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:07:38,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-11-07 01:07:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:38,082 INFO L225 Difference]: With dead ends: 465 [2019-11-07 01:07:38,083 INFO L226 Difference]: Without dead ends: 250 [2019-11-07 01:07:38,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:38,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-07 01:07:38,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-11-07 01:07:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-11-07 01:07:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 352 transitions. [2019-11-07 01:07:38,098 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 352 transitions. Word has length 59 [2019-11-07 01:07:38,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:38,098 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 352 transitions. [2019-11-07 01:07:38,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:07:38,098 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 352 transitions. [2019-11-07 01:07:38,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-07 01:07:38,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:38,099 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:38,100 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:38,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:38,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1361992071, now seen corresponding path program 1 times [2019-11-07 01:07:38,100 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:38,101 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699602527] [2019-11-07 01:07:38,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-07 01:07:38,149 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699602527] [2019-11-07 01:07:38,150 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:38,150 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:38,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966996551] [2019-11-07 01:07:38,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:38,151 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:38,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:38,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:38,152 INFO L87 Difference]: Start difference. First operand 248 states and 352 transitions. Second operand 4 states. [2019-11-07 01:07:38,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:38,218 INFO L93 Difference]: Finished difference Result 479 states and 693 transitions. [2019-11-07 01:07:38,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:07:38,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-07 01:07:38,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:38,223 INFO L225 Difference]: With dead ends: 479 [2019-11-07 01:07:38,223 INFO L226 Difference]: Without dead ends: 269 [2019-11-07 01:07:38,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:38,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-11-07 01:07:38,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2019-11-07 01:07:38,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-07 01:07:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 373 transitions. [2019-11-07 01:07:38,242 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 373 transitions. Word has length 62 [2019-11-07 01:07:38,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:38,243 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 373 transitions. [2019-11-07 01:07:38,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:38,246 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 373 transitions. [2019-11-07 01:07:38,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-07 01:07:38,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:38,247 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:38,248 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:38,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:38,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1503019715, now seen corresponding path program 1 times [2019-11-07 01:07:38,250 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:38,250 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540899498] [2019-11-07 01:07:38,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-07 01:07:38,328 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540899498] [2019-11-07 01:07:38,328 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:38,329 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:38,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137593410] [2019-11-07 01:07:38,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:38,330 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:38,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:38,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:38,330 INFO L87 Difference]: Start difference. First operand 266 states and 373 transitions. Second operand 4 states. [2019-11-07 01:07:38,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:38,394 INFO L93 Difference]: Finished difference Result 486 states and 697 transitions. [2019-11-07 01:07:38,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:38,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-07 01:07:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:38,397 INFO L225 Difference]: With dead ends: 486 [2019-11-07 01:07:38,397 INFO L226 Difference]: Without dead ends: 260 [2019-11-07 01:07:38,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:38,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-07 01:07:38,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2019-11-07 01:07:38,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-07 01:07:38,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 359 transitions. [2019-11-07 01:07:38,410 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 359 transitions. Word has length 63 [2019-11-07 01:07:38,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:38,411 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 359 transitions. [2019-11-07 01:07:38,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:38,411 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 359 transitions. [2019-11-07 01:07:38,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-07 01:07:38,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:38,412 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:07:38,412 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:38,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:38,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1498693946, now seen corresponding path program 1 times [2019-11-07 01:07:38,413 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:38,413 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548900097] [2019-11-07 01:07:38,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-07 01:07:38,478 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548900097] [2019-11-07 01:07:38,478 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:38,478 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:07:38,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924292250] [2019-11-07 01:07:38,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:07:38,479 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:38,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:07:38,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:38,480 INFO L87 Difference]: Start difference. First operand 260 states and 359 transitions. Second operand 5 states. [2019-11-07 01:07:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:38,502 INFO L93 Difference]: Finished difference Result 473 states and 664 transitions. [2019-11-07 01:07:38,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:07:38,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-11-07 01:07:38,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:38,505 INFO L225 Difference]: With dead ends: 473 [2019-11-07 01:07:38,505 INFO L226 Difference]: Without dead ends: 262 [2019-11-07 01:07:38,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:38,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-07 01:07:38,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-11-07 01:07:38,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-07 01:07:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 358 transitions. [2019-11-07 01:07:38,517 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 358 transitions. Word has length 82 [2019-11-07 01:07:38,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:38,517 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 358 transitions. [2019-11-07 01:07:38,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:07:38,518 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 358 transitions. [2019-11-07 01:07:38,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-07 01:07:38,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:38,519 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:07:38,519 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:38,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:38,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1251929143, now seen corresponding path program 1 times [2019-11-07 01:07:38,520 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:38,520 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88132137] [2019-11-07 01:07:38,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-07 01:07:38,588 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88132137] [2019-11-07 01:07:38,589 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:38,589 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:38,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506274948] [2019-11-07 01:07:38,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:38,591 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:38,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:38,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:38,592 INFO L87 Difference]: Start difference. First operand 260 states and 358 transitions. Second operand 4 states. [2019-11-07 01:07:38,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:38,651 INFO L93 Difference]: Finished difference Result 462 states and 662 transitions. [2019-11-07 01:07:38,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:38,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-07 01:07:38,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:38,654 INFO L225 Difference]: With dead ends: 462 [2019-11-07 01:07:38,654 INFO L226 Difference]: Without dead ends: 258 [2019-11-07 01:07:38,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:38,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-07 01:07:38,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2019-11-07 01:07:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-07 01:07:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 354 transitions. [2019-11-07 01:07:38,666 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 354 transitions. Word has length 85 [2019-11-07 01:07:38,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:38,667 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 354 transitions. [2019-11-07 01:07:38,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 354 transitions. [2019-11-07 01:07:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-07 01:07:38,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:38,669 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:07:38,669 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:38,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:38,669 INFO L82 PathProgramCache]: Analyzing trace with hash 599019244, now seen corresponding path program 1 times [2019-11-07 01:07:38,670 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:38,670 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758900101] [2019-11-07 01:07:38,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:38,721 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-07 01:07:38,721 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758900101] [2019-11-07 01:07:38,722 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089540181] [2019-11-07 01:07:38,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:07:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:38,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:07:38,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:07:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-07 01:07:38,954 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:07:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-07 01:07:39,063 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1668737899] [2019-11-07 01:07:39,069 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 101 [2019-11-07 01:07:39,114 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:07:39,115 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:07:39,343 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:07:39,512 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-07 01:07:39,524 INFO L272 AbstractInterpreter]: Visited 56 different actions 205 times. Merged at 16 different actions 45 times. Never widened. Performed 959 root evaluator evaluations with a maximum evaluation depth of 5. Performed 959 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 1 different actions. Largest state had 89 variables. [2019-11-07 01:07:39,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:39,529 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-07 01:07:39,737 INFO L227 lantSequenceWeakener]: Weakened 77 states. On average, predicates are now at 93.62% of their original sizes. [2019-11-07 01:07:39,738 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-07 01:07:40,404 INFO L553 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-11-07 01:07:40,404 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-07 01:07:40,405 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:07:40,406 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [4, 4, 4] total 40 [2019-11-07 01:07:40,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941641783] [2019-11-07 01:07:40,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-07 01:07:40,407 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:40,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-07 01:07:40,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:07:40,408 INFO L87 Difference]: Start difference. First operand 258 states and 354 transitions. Second operand 35 states. [2019-11-07 01:07:40,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 01:07:40,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:07:40,615 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at least one of both input predicates is unknown: 10877#true or 11717#(or (and (<= add_history_type_~var~0 2) (= (+ ~nomsg~0 1) 0) (= add_history_type_~ini_bool~0 0) (<= 0 add_history_type_~tmp___0~0) (<= 1 add_history_type_~var~0) (<= add_history_type_~tmp___0~0 255)) (and (= (+ ~nomsg~0 1) 0) (= add_history_type_~ini_bool~0 0) (<= 0 add_history_type_~tmp___0~0) (= add_history_type_~var~0 0) (<= add_history_type_~tmp___0~0 255))) ([#2{add_history_type_~tmp___0~0 = [0;255]; ~nomsg~0 = [-1;-1]; add_history_type_~ini_bool~0 = [0;0]; add_history_type_~var~0 = [0;0]; }, {add_history_type_~tmp___0~0 = [0;255]; ~nomsg~0 = [-1;-1]; add_history_type_~ini_bool~0 = [0;0]; add_history_type_~var~0 = [1;2]; }]) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$CoverageRelation.isCovered(PredicateUnifier.java:593) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.SdHoareTripleChecker$CheckHelper.check(SdHoareTripleChecker.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.SdHoareTripleChecker.checkCall(SdHoareTripleChecker.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.checkCall(EfficientHoareTripleChecker.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkCall(CachingHoareTripleChecker.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$CallSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:403) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.callSuccessors(AbstractInterpolantAutomaton.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.callSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.callSuccessors(TotalizeNwa.java:260) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.callSuccessors(ComplementDeterministicNwa.java:131) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.callSuccessors(ProductNwa.java:252) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.callSuccessors(ProductNwa.java:244) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addCallsAndSuccessors(NestedWordAutomatonReachableStates.java:1089) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:969) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-07 01:07:40,622 INFO L168 Benchmark]: Toolchain (without parser) took 6160.33 ms. Allocated memory was 142.6 MB in the beginning and 286.3 MB in the end (delta: 143.7 MB). Free memory was 102.9 MB in the beginning and 94.8 MB in the end (delta: 8.1 MB). Peak memory consumption was 151.8 MB. Max. memory is 7.1 GB. [2019-11-07 01:07:40,623 INFO L168 Benchmark]: CDTParser took 1.24 ms. Allocated memory is still 142.6 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 01:07:40,624 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.62 ms. Allocated memory was 142.6 MB in the beginning and 203.4 MB in the end (delta: 60.8 MB). Free memory was 102.7 MB in the beginning and 176.4 MB in the end (delta: -73.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-11-07 01:07:40,625 INFO L168 Benchmark]: Boogie Preprocessor took 76.00 ms. Allocated memory is still 203.4 MB. Free memory was 176.4 MB in the beginning and 173.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-11-07 01:07:40,625 INFO L168 Benchmark]: RCFGBuilder took 919.68 ms. Allocated memory is still 203.4 MB. Free memory was 173.1 MB in the beginning and 118.4 MB in the end (delta: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 7.1 GB. [2019-11-07 01:07:40,626 INFO L168 Benchmark]: TraceAbstraction took 4576.65 ms. Allocated memory was 203.4 MB in the beginning and 286.3 MB in the end (delta: 82.8 MB). Free memory was 117.8 MB in the beginning and 94.8 MB in the end (delta: 23.0 MB). Peak memory consumption was 105.8 MB. Max. memory is 7.1 GB. [2019-11-07 01:07:40,630 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.24 ms. Allocated memory is still 142.6 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 583.62 ms. Allocated memory was 142.6 MB in the beginning and 203.4 MB in the end (delta: 60.8 MB). Free memory was 102.7 MB in the beginning and 176.4 MB in the end (delta: -73.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 76.00 ms. Allocated memory is still 203.4 MB. Free memory was 176.4 MB in the beginning and 173.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 919.68 ms. Allocated memory is still 203.4 MB. Free memory was 173.1 MB in the beginning and 118.4 MB in the end (delta: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4576.65 ms. Allocated memory was 203.4 MB in the beginning and 286.3 MB in the end (delta: 82.8 MB). Free memory was 117.8 MB in the beginning and 94.8 MB in the end (delta: 23.0 MB). Peak memory consumption was 105.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: at least one of both input predicates is unknown: 10877#true or 11717#(or (and (<= add_history_type_~var~0 2) (= (+ ~nomsg~0 1) 0) (= add_history_type_~ini_bool~0 0) (<= 0 add_history_type_~tmp___0~0) (<= 1 add_history_type_~var~0) (<= add_history_type_~tmp___0~0 255)) (and (= (+ ~nomsg~0 1) 0) (= add_history_type_~ini_bool~0 0) (<= 0 add_history_type_~tmp___0~0) (= add_history_type_~var~0 0) (<= add_history_type_~tmp___0~0 255))) ([#2{add_history_type_~tmp___0~0 = [0;255]; ~nomsg~0 = [-1;-1]; add_history_type_~ini_bool~0 = [0;0]; add_history_type_~var~0 = [0;0]; }, {add_history_type_~tmp___0~0 = [0;255]; ~nomsg~0 = [-1;-1]; add_history_type_~ini_bool~0 = [0;0]; add_history_type_~var~0 = [1;2]; }]) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at least one of both input predicates is unknown: 10877#true or 11717#(or (and (<= add_history_type_~var~0 2) (= (+ ~nomsg~0 1) 0) (= add_history_type_~ini_bool~0 0) (<= 0 add_history_type_~tmp___0~0) (<= 1 add_history_type_~var~0) (<= add_history_type_~tmp___0~0 255)) (and (= (+ ~nomsg~0 1) 0) (= add_history_type_~ini_bool~0 0) (<= 0 add_history_type_~tmp___0~0) (= add_history_type_~var~0 0) (<= add_history_type_~tmp___0~0 255))) ([#2{add_history_type_~tmp___0~0 = [0;255]; ~nomsg~0 = [-1;-1]; add_history_type_~ini_bool~0 = [0;0]; add_history_type_~var~0 = [0;0]; }, {add_history_type_~tmp___0~0 = [0;255]; ~nomsg~0 = [-1;-1]; add_history_type_~ini_bool~0 = [0;0]; add_history_type_~var~0 = [1;2]; }]): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$CoverageRelation.isCovered(PredicateUnifier.java:593) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...