/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.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:07:33,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:07:33,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:07:33,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:07:33,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:07:33,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:07:33,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:07:33,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:07:33,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:07:33,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:07:33,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:07:33,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:07:33,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:07:33,064 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:07:33,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:07:33,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:07:33,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:07:33,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:07:33,070 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:07:33,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:07:33,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:07:33,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:07:33,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:07:33,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:07:33,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:07:33,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:07:33,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:07:33,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:07:33,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:07:33,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:07:33,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:07:33,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:07:33,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:07:33,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:07:33,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:07:33,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:07:33,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:07:33,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:07:33,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:07:33,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:07:33,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:07:33,091 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,105 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:07:33,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:07:33,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:07:33,107 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:07:33,107 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:07:33,107 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:07:33,108 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:07:33,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:07:33,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:07:33,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:07:33,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:07:33,109 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:07:33,109 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:07:33,109 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:07:33,109 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:07:33,109 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:07:33,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:07:33,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:07:33,110 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:07:33,110 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:07:33,110 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:07:33,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:07:33,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:07:33,111 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:07:33,111 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:07:33,111 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:07:33,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:07:33,112 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:07:33,112 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,438 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:07:33,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:07:33,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:07:33,456 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:07:33,456 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:07:33,457 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.BOUNDED-10.pals.c [2019-11-07 01:07:33,535 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f1fb3520/7ef2a90102d245bd8e0b4860c1b7eed5/FLAG9c3fe70a4 [2019-11-07 01:07:34,061 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:07:34,063 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-11-07 01:07:34,081 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f1fb3520/7ef2a90102d245bd8e0b4860c1b7eed5/FLAG9c3fe70a4 [2019-11-07 01:07:34,332 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f1fb3520/7ef2a90102d245bd8e0b4860c1b7eed5 [2019-11-07 01:07:34,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:07:34,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:07:34,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:07:34,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:07:34,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:07:34,348 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,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7792b04b 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,351 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,358 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:07:34,418 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:07:34,796 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:07:34,805 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:07:34,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:07:34,889 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:07:34,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:34 WrapperNode [2019-11-07 01:07:34,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:07:34,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:07:34,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:07:34,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:07:34,905 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:34" (1/1) ... [2019-11-07 01:07:34,905 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:34" (1/1) ... [2019-11-07 01:07:34,917 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:34" (1/1) ... [2019-11-07 01:07:34,918 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:34" (1/1) ... [2019-11-07 01:07:34,935 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:34" (1/1) ... [2019-11-07 01:07:34,948 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:34" (1/1) ... [2019-11-07 01:07:34,952 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:34" (1/1) ... [2019-11-07 01:07:34,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:07:34,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:07:34,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:07:34,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:07:34,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:34" (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,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:07:35,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:07:35,013 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-11-07 01:07:35,013 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-11-07 01:07:35,013 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-11-07 01:07:35,014 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-11-07 01:07:35,014 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-11-07 01:07:35,014 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-11-07 01:07:35,014 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-07 01:07:35,014 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-11-07 01:07:35,015 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-11-07 01:07:35,015 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-11-07 01:07:35,015 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-11-07 01:07:35,015 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:07:35,015 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-11-07 01:07:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:07:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:07:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:07:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:07:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:07:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:07:35,017 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:07:35,017 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-11-07 01:07:35,017 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-11-07 01:07:35,017 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-11-07 01:07:35,017 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-11-07 01:07:35,017 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-11-07 01:07:35,017 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:07:35,018 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:07:35,018 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-11-07 01:07:35,018 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-11-07 01:07:35,018 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-11-07 01:07:35,018 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-11-07 01:07:35,018 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:07:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:07:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:07:35,872 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:07:35,872 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-07 01:07:35,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:07:35 BoogieIcfgContainer [2019-11-07 01:07:35,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:07:35,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:07:35,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:07:35,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:07:35,879 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:35,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1e158c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:07:35, skipping insertion in model container [2019-11-07 01:07:35,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:34" (2/3) ... [2019-11-07 01:07:35,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1e158c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:07:35, skipping insertion in model container [2019-11-07 01:07:35,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:07:35" (3/3) ... [2019-11-07 01:07:35,882 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-11-07 01:07:35,893 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:07:35,902 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:07:35,914 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:07:35,944 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:07:35,944 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:07:35,944 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:07:35,944 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:07:35,945 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:07:35,945 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:07:35,945 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:07:35,945 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:07:35,974 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2019-11-07 01:07:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 01:07:35,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:35,983 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:35,986 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:35,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:35,991 INFO L82 PathProgramCache]: Analyzing trace with hash -968101902, now seen corresponding path program 1 times [2019-11-07 01:07:35,999 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:35,999 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926151542] [2019-11-07 01:07:35,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:36,283 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,284 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926151542] [2019-11-07 01:07:36,286 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:36,287 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:36,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554699175] [2019-11-07 01:07:36,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:36,300 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:36,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:36,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:36,321 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2019-11-07 01:07:36,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:36,499 INFO L93 Difference]: Finished difference Result 419 states and 679 transitions. [2019-11-07 01:07:36,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:07:36,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-07 01:07:36,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:36,545 INFO L225 Difference]: With dead ends: 419 [2019-11-07 01:07:36,545 INFO L226 Difference]: Without dead ends: 213 [2019-11-07 01:07:36,559 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,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-07 01:07:36,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-11-07 01:07:36,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-07 01:07:36,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 314 transitions. [2019-11-07 01:07:36,639 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 314 transitions. Word has length 21 [2019-11-07 01:07:36,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:36,640 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 314 transitions. [2019-11-07 01:07:36,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:36,640 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 314 transitions. [2019-11-07 01:07:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-07 01:07:36,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:36,643 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,644 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:36,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:36,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1316040493, now seen corresponding path program 1 times [2019-11-07 01:07:36,644 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:36,645 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605807901] [2019-11-07 01:07:36,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:36,759 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,759 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605807901] [2019-11-07 01:07:36,760 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:36,760 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:36,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064312237] [2019-11-07 01:07:36,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:36,762 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:36,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:36,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:36,763 INFO L87 Difference]: Start difference. First operand 211 states and 314 transitions. Second operand 4 states. [2019-11-07 01:07:36,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:36,871 INFO L93 Difference]: Finished difference Result 429 states and 645 transitions. [2019-11-07 01:07:36,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:07:36,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-07 01:07:36,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:36,879 INFO L225 Difference]: With dead ends: 429 [2019-11-07 01:07:36,879 INFO L226 Difference]: Without dead ends: 227 [2019-11-07 01:07:36,884 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,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-11-07 01:07:36,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-11-07 01:07:36,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-07 01:07:36,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 330 transitions. [2019-11-07 01:07:36,939 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 330 transitions. Word has length 22 [2019-11-07 01:07:36,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:36,940 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 330 transitions. [2019-11-07 01:07:36,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:36,940 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 330 transitions. [2019-11-07 01:07:36,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-07 01:07:36,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:36,943 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:36,943 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:36,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:36,944 INFO L82 PathProgramCache]: Analyzing trace with hash 919864782, now seen corresponding path program 1 times [2019-11-07 01:07:36,947 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:36,947 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696585768] [2019-11-07 01:07:36,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:37,069 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,069 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696585768] [2019-11-07 01:07:37,070 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:37,070 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:37,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407359259] [2019-11-07 01:07:37,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:37,071 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:37,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:37,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:37,072 INFO L87 Difference]: Start difference. First operand 224 states and 330 transitions. Second operand 3 states. [2019-11-07 01:07:37,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:37,114 INFO L93 Difference]: Finished difference Result 461 states and 691 transitions. [2019-11-07 01:07:37,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:37,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-07 01:07:37,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:37,124 INFO L225 Difference]: With dead ends: 461 [2019-11-07 01:07:37,124 INFO L226 Difference]: Without dead ends: 253 [2019-11-07 01:07:37,126 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,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-07 01:07:37,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 226. [2019-11-07 01:07:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-07 01:07:37,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 332 transitions. [2019-11-07 01:07:37,175 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 332 transitions. Word has length 30 [2019-11-07 01:07:37,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:37,176 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 332 transitions. [2019-11-07 01:07:37,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:37,176 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 332 transitions. [2019-11-07 01:07:37,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-07 01:07:37,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:37,179 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,179 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:37,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:37,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1667611779, now seen corresponding path program 1 times [2019-11-07 01:07:37,181 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:37,181 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826624248] [2019-11-07 01:07:37,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:37,261 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,261 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826624248] [2019-11-07 01:07:37,261 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:37,262 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:07:37,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649966860] [2019-11-07 01:07:37,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:07:37,263 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:37,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:07:37,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:37,263 INFO L87 Difference]: Start difference. First operand 226 states and 332 transitions. Second operand 5 states. [2019-11-07 01:07:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:37,310 INFO L93 Difference]: Finished difference Result 438 states and 649 transitions. [2019-11-07 01:07:37,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:07:37,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-07 01:07:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:37,314 INFO L225 Difference]: With dead ends: 438 [2019-11-07 01:07:37,314 INFO L226 Difference]: Without dead ends: 234 [2019-11-07 01:07:37,315 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,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-11-07 01:07:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2019-11-07 01:07:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-07 01:07:37,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 336 transitions. [2019-11-07 01:07:37,336 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 336 transitions. Word has length 38 [2019-11-07 01:07:37,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:37,337 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 336 transitions. [2019-11-07 01:07:37,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:07:37,338 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 336 transitions. [2019-11-07 01:07:37,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-07 01:07:37,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:37,340 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,340 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:37,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:37,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1792772014, now seen corresponding path program 1 times [2019-11-07 01:07:37,344 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:37,344 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050177399] [2019-11-07 01:07:37,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:37,464 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,466 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050177399] [2019-11-07 01:07:37,466 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:37,466 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:37,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605183410] [2019-11-07 01:07:37,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:37,467 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:37,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:37,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:37,468 INFO L87 Difference]: Start difference. First operand 230 states and 336 transitions. Second operand 4 states. [2019-11-07 01:07:37,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:37,501 INFO L93 Difference]: Finished difference Result 399 states and 588 transitions. [2019-11-07 01:07:37,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:37,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-07 01:07:37,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:37,503 INFO L225 Difference]: With dead ends: 399 [2019-11-07 01:07:37,504 INFO L226 Difference]: Without dead ends: 226 [2019-11-07 01:07:37,506 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,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-07 01:07:37,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-11-07 01:07:37,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-07 01:07:37,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 327 transitions. [2019-11-07 01:07:37,525 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 327 transitions. Word has length 39 [2019-11-07 01:07:37,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:37,526 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 327 transitions. [2019-11-07 01:07:37,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:37,526 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 327 transitions. [2019-11-07 01:07:37,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-07 01:07:37,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:37,530 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,530 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:37,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:37,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1839866744, now seen corresponding path program 1 times [2019-11-07 01:07:37,532 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:37,532 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714965861] [2019-11-07 01:07:37,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:37,618 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,618 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714965861] [2019-11-07 01:07:37,619 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:37,619 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:37,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148827686] [2019-11-07 01:07:37,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:37,620 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:37,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:37,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:37,620 INFO L87 Difference]: Start difference. First operand 226 states and 327 transitions. Second operand 4 states. [2019-11-07 01:07:37,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:37,687 INFO L93 Difference]: Finished difference Result 448 states and 658 transitions. [2019-11-07 01:07:37,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:07:37,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-11-07 01:07:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:37,694 INFO L225 Difference]: With dead ends: 448 [2019-11-07 01:07:37,700 INFO L226 Difference]: Without dead ends: 245 [2019-11-07 01:07:37,703 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,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-07 01:07:37,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2019-11-07 01:07:37,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-07 01:07:37,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 346 transitions. [2019-11-07 01:07:37,731 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 346 transitions. Word has length 41 [2019-11-07 01:07:37,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:37,732 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 346 transitions. [2019-11-07 01:07:37,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:37,732 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 346 transitions. [2019-11-07 01:07:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-07 01:07:37,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:37,733 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,733 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:37,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:37,734 INFO L82 PathProgramCache]: Analyzing trace with hash 968772057, now seen corresponding path program 1 times [2019-11-07 01:07:37,734 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:37,734 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708527525] [2019-11-07 01:07:37,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:37,807 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,808 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708527525] [2019-11-07 01:07:37,808 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:37,808 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:37,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491279693] [2019-11-07 01:07:37,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:37,809 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:37,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:37,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:37,811 INFO L87 Difference]: Start difference. First operand 242 states and 346 transitions. Second operand 4 states. [2019-11-07 01:07:37,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:37,867 INFO L93 Difference]: Finished difference Result 468 states and 686 transitions. [2019-11-07 01:07:37,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:07:37,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-11-07 01:07:37,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:37,870 INFO L225 Difference]: With dead ends: 468 [2019-11-07 01:07:37,870 INFO L226 Difference]: Without dead ends: 251 [2019-11-07 01:07:37,872 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,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-07 01:07:37,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2019-11-07 01:07:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-11-07 01:07:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 354 transitions. [2019-11-07 01:07:37,886 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 354 transitions. Word has length 41 [2019-11-07 01:07:37,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:37,887 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 354 transitions. [2019-11-07 01:07:37,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:37,887 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 354 transitions. [2019-11-07 01:07:37,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 01:07:37,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:37,889 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,889 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:37,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:37,889 INFO L82 PathProgramCache]: Analyzing trace with hash -966374096, now seen corresponding path program 1 times [2019-11-07 01:07:37,890 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:37,890 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859888260] [2019-11-07 01:07:37,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:37,975 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:37,975 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859888260] [2019-11-07 01:07:37,976 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:37,976 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:07:37,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773810309] [2019-11-07 01:07:37,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:07:37,978 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:37,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:07:37,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:37,979 INFO L87 Difference]: Start difference. First operand 249 states and 354 transitions. Second operand 5 states. [2019-11-07 01:07:38,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:38,003 INFO L93 Difference]: Finished difference Result 467 states and 673 transitions. [2019-11-07 01:07:38,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:07:38,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-11-07 01:07:38,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:38,006 INFO L225 Difference]: With dead ends: 467 [2019-11-07 01:07:38,006 INFO L226 Difference]: Without dead ends: 251 [2019-11-07 01:07:38,008 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,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-07 01:07:38,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2019-11-07 01:07:38,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-11-07 01:07:38,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 353 transitions. [2019-11-07 01:07:38,025 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 353 transitions. Word has length 59 [2019-11-07 01:07:38,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:38,028 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 353 transitions. [2019-11-07 01:07:38,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:07:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 353 transitions. [2019-11-07 01:07:38,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-07 01:07:38,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:38,029 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,030 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:38,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:38,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1964020213, now seen corresponding path program 1 times [2019-11-07 01:07:38,030 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:38,031 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003966686] [2019-11-07 01:07:38,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:38,092 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,092 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003966686] [2019-11-07 01:07:38,092 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:38,094 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:38,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273240890] [2019-11-07 01:07:38,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:38,096 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:38,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:38,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:38,097 INFO L87 Difference]: Start difference. First operand 249 states and 353 transitions. Second operand 4 states. [2019-11-07 01:07:38,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:38,150 INFO L93 Difference]: Finished difference Result 481 states and 695 transitions. [2019-11-07 01:07:38,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:07:38,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-07 01:07:38,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:38,155 INFO L225 Difference]: With dead ends: 481 [2019-11-07 01:07:38,155 INFO L226 Difference]: Without dead ends: 270 [2019-11-07 01:07:38,157 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,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-07 01:07:38,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2019-11-07 01:07:38,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-11-07 01:07:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 374 transitions. [2019-11-07 01:07:38,173 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 374 transitions. Word has length 62 [2019-11-07 01:07:38,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:38,173 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 374 transitions. [2019-11-07 01:07:38,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:38,176 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 374 transitions. [2019-11-07 01:07:38,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-07 01:07:38,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:38,177 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,177 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:38,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:38,178 INFO L82 PathProgramCache]: Analyzing trace with hash -2021002903, now seen corresponding path program 1 times [2019-11-07 01:07:38,178 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:38,179 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799302258] [2019-11-07 01:07:38,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:38,249 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,250 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799302258] [2019-11-07 01:07:38,250 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:38,250 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:38,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78001278] [2019-11-07 01:07:38,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:38,252 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:38,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:38,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:38,252 INFO L87 Difference]: Start difference. First operand 267 states and 374 transitions. Second operand 4 states. [2019-11-07 01:07:38,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:38,302 INFO L93 Difference]: Finished difference Result 488 states and 699 transitions. [2019-11-07 01:07:38,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:38,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-07 01:07:38,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:38,305 INFO L225 Difference]: With dead ends: 488 [2019-11-07 01:07:38,305 INFO L226 Difference]: Without dead ends: 261 [2019-11-07 01:07:38,306 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,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-07 01:07:38,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2019-11-07 01:07:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-07 01:07:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 360 transitions. [2019-11-07 01:07:38,320 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 360 transitions. Word has length 63 [2019-11-07 01:07:38,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:38,320 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 360 transitions. [2019-11-07 01:07:38,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:38,322 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 360 transitions. [2019-11-07 01:07:38,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-07 01:07:38,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:38,323 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,323 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:38,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:38,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1782318518, now seen corresponding path program 1 times [2019-11-07 01:07:38,324 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:38,324 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010341596] [2019-11-07 01:07:38,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:38,380 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,381 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010341596] [2019-11-07 01:07:38,381 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:38,381 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:07:38,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129157037] [2019-11-07 01:07:38,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:07:38,382 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:38,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:07:38,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:38,382 INFO L87 Difference]: Start difference. First operand 261 states and 360 transitions. Second operand 5 states. [2019-11-07 01:07:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:38,405 INFO L93 Difference]: Finished difference Result 475 states and 666 transitions. [2019-11-07 01:07:38,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:07:38,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-11-07 01:07:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:38,407 INFO L225 Difference]: With dead ends: 475 [2019-11-07 01:07:38,408 INFO L226 Difference]: Without dead ends: 263 [2019-11-07 01:07:38,409 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,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-11-07 01:07:38,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2019-11-07 01:07:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-07 01:07:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 359 transitions. [2019-11-07 01:07:38,419 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 359 transitions. Word has length 82 [2019-11-07 01:07:38,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:38,420 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 359 transitions. [2019-11-07 01:07:38,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:07:38,420 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 359 transitions. [2019-11-07 01:07:38,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-07 01:07:38,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:38,421 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,421 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:38,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:38,422 INFO L82 PathProgramCache]: Analyzing trace with hash 77251503, now seen corresponding path program 1 times [2019-11-07 01:07:38,422 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:38,422 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56594025] [2019-11-07 01:07:38,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:38,469 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,469 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56594025] [2019-11-07 01:07:38,469 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:38,469 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:38,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314414635] [2019-11-07 01:07:38,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:38,470 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:38,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:38,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:38,471 INFO L87 Difference]: Start difference. First operand 261 states and 359 transitions. Second operand 4 states. [2019-11-07 01:07:38,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:38,535 INFO L93 Difference]: Finished difference Result 464 states and 664 transitions. [2019-11-07 01:07:38,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:38,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-07 01:07:38,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:38,538 INFO L225 Difference]: With dead ends: 464 [2019-11-07 01:07:38,538 INFO L226 Difference]: Without dead ends: 259 [2019-11-07 01:07:38,540 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,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-07 01:07:38,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-11-07 01:07:38,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-07 01:07:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 355 transitions. [2019-11-07 01:07:38,551 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 355 transitions. Word has length 85 [2019-11-07 01:07:38,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:38,552 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 355 transitions. [2019-11-07 01:07:38,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:38,552 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 355 transitions. [2019-11-07 01:07:38,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-07 01:07:38,553 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:38,553 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,554 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:38,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:38,554 INFO L82 PathProgramCache]: Analyzing trace with hash -763139322, now seen corresponding path program 1 times [2019-11-07 01:07:38,554 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:38,554 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144495732] [2019-11-07 01:07:38,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:38,640 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,640 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144495732] [2019-11-07 01:07:38,641 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046591560] [2019-11-07 01:07:38,641 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,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:38,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:07:38,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:07:38,888 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,888 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:07:39,014 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,015 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2003312302] [2019-11-07 01:07:39,021 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 101 [2019-11-07 01:07:39,065 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:07:39,066 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:07:39,222 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:07:39,387 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-07 01:07:39,390 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,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:39,400 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-07 01:07:39,665 INFO L227 lantSequenceWeakener]: Weakened 77 states. On average, predicates are now at 93.62% of their original sizes. [2019-11-07 01:07:39,665 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-07 01:07:40,314 INFO L553 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-11-07 01:07:40,314 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-07 01:07:40,315 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:07:40,315 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [4, 4, 4] total 40 [2019-11-07 01:07:40,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121379463] [2019-11-07 01:07:40,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-07 01:07:40,316 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:40,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-07 01:07:40,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:07:40,317 INFO L87 Difference]: Start difference. First operand 259 states and 355 transitions. Second operand 35 states. [2019-11-07 01:07:40,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 01:07:40,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:07:40,525 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: 10919#true or 11712#(or (and (<= add_history_type_~var~0 3) (= add_history_type_~history_id 0) (= (+ ~nomsg~0 1) 0) (= add_history_type_~ini_bool~0 0) (<= 1 add_history_type_~var~0)) (and (<= add_history_type_~var~0 2) (= add_history_type_~history_id 0) (= (+ ~nomsg~0 1) 0) (= add_history_type_~ini_bool~0 0) (<= 0 add_history_type_~var~0))) ([#2{~nomsg~0 = [-1;-1]; add_history_type_~ini_bool~0 = [0;0]; add_history_type_~var~0 = [1;3]; add_history_type_~history_id = [0;0]; }, {~nomsg~0 = [-1;-1]; add_history_type_~ini_bool~0 = [0;0]; add_history_type_~var~0 = [0;2]; add_history_type_~history_id = [0;0]; }]) 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,531 INFO L168 Benchmark]: Toolchain (without parser) took 6188.11 ms. Allocated memory was 143.7 MB in the beginning and 301.5 MB in the end (delta: 157.8 MB). Free memory was 99.6 MB in the beginning and 141.3 MB in the end (delta: -41.8 MB). Peak memory consumption was 116.0 MB. Max. memory is 7.1 GB. [2019-11-07 01:07:40,531 INFO L168 Benchmark]: CDTParser took 1.25 ms. Allocated memory is still 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 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,532 INFO L168 Benchmark]: CACSL2BoogieTranslator took 546.79 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 99.3 MB in the beginning and 174.1 MB in the end (delta: -74.8 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-11-07 01:07:40,533 INFO L168 Benchmark]: Boogie Preprocessor took 68.06 ms. Allocated memory is still 200.8 MB. Free memory was 174.1 MB in the beginning and 171.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-11-07 01:07:40,544 INFO L168 Benchmark]: RCFGBuilder took 915.59 ms. Allocated memory is still 200.8 MB. Free memory was 171.4 MB in the beginning and 115.7 MB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 7.1 GB. [2019-11-07 01:07:40,545 INFO L168 Benchmark]: TraceAbstraction took 4653.40 ms. Allocated memory was 200.8 MB in the beginning and 301.5 MB in the end (delta: 100.7 MB). Free memory was 115.7 MB in the beginning and 141.3 MB in the end (delta: -25.6 MB). Peak memory consumption was 75.0 MB. Max. memory is 7.1 GB. [2019-11-07 01:07:40,565 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.25 ms. Allocated memory is still 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 546.79 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 99.3 MB in the beginning and 174.1 MB in the end (delta: -74.8 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.06 ms. Allocated memory is still 200.8 MB. Free memory was 174.1 MB in the beginning and 171.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 915.59 ms. Allocated memory is still 200.8 MB. Free memory was 171.4 MB in the beginning and 115.7 MB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4653.40 ms. Allocated memory was 200.8 MB in the beginning and 301.5 MB in the end (delta: 100.7 MB). Free memory was 115.7 MB in the beginning and 141.3 MB in the end (delta: -25.6 MB). Peak memory consumption was 75.0 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: 10919#true or 11712#(or (and (<= add_history_type_~var~0 3) (= add_history_type_~history_id 0) (= (+ ~nomsg~0 1) 0) (= add_history_type_~ini_bool~0 0) (<= 1 add_history_type_~var~0)) (and (<= add_history_type_~var~0 2) (= add_history_type_~history_id 0) (= (+ ~nomsg~0 1) 0) (= add_history_type_~ini_bool~0 0) (<= 0 add_history_type_~var~0))) ([#2{~nomsg~0 = [-1;-1]; add_history_type_~ini_bool~0 = [0;0]; add_history_type_~var~0 = [1;3]; add_history_type_~history_id = [0;0]; }, {~nomsg~0 = [-1;-1]; add_history_type_~ini_bool~0 = [0;0]; add_history_type_~var~0 = [0;2]; add_history_type_~history_id = [0;0]; }]) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at least one of both input predicates is unknown: 10919#true or 11712#(or (and (<= add_history_type_~var~0 3) (= add_history_type_~history_id 0) (= (+ ~nomsg~0 1) 0) (= add_history_type_~ini_bool~0 0) (<= 1 add_history_type_~var~0)) (and (<= add_history_type_~var~0 2) (= add_history_type_~history_id 0) (= (+ ~nomsg~0 1) 0) (= add_history_type_~ini_bool~0 0) (<= 0 add_history_type_~var~0))) ([#2{~nomsg~0 = [-1;-1]; add_history_type_~ini_bool~0 = [0;0]; add_history_type_~var~0 = [1;3]; add_history_type_~history_id = [0;0]; }, {~nomsg~0 = [-1;-1]; add_history_type_~ini_bool~0 = [0;0]; add_history_type_~var~0 = [0;2]; add_history_type_~history_id = [0;0]; }]): 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...