/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:34:38,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:34:38,072 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:34:38,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:34:38,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:34:38,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:34:38,095 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:34:38,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:34:38,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:34:38,113 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:34:38,115 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:34:38,117 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:34:38,117 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:34:38,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:34:38,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:34:38,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:34:38,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:34:38,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:34:38,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:34:38,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:34:38,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:34:38,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:34:38,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:34:38,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:34:38,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:34:38,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:34:38,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:34:38,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:34:38,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:34:38,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:34:38,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:34:38,148 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:34:38,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:34:38,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:34:38,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:34:38,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:34:38,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:34:38,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:34:38,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:34:38,153 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:34:38,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:34:38,155 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-12-18 12:34:38,187 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:34:38,190 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:34:38,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:34:38,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:34:38,191 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:34:38,192 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:34:38,192 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:34:38,192 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:34:38,192 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:34:38,192 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:34:38,194 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:34:38,194 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:34:38,194 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:34:38,194 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:34:38,194 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:34:38,195 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:34:38,195 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:34:38,195 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:34:38,195 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:34:38,195 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:34:38,195 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:34:38,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:34:38,196 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:34:38,196 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:34:38,197 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:34:38,197 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:34:38,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:34:38,197 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:34:38,197 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:34:38,197 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:34:38,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:34:38,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:34:38,501 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:34:38,503 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:34:38,503 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:34:38,504 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_rmo.oepc.i [2019-12-18 12:34:38,582 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dfed9f70/5eee8c30c140423a936e706af6ff11f4/FLAGf7d282a1f [2019-12-18 12:34:39,109 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:34:39,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_rmo.oepc.i [2019-12-18 12:34:39,125 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dfed9f70/5eee8c30c140423a936e706af6ff11f4/FLAGf7d282a1f [2019-12-18 12:34:39,393 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dfed9f70/5eee8c30c140423a936e706af6ff11f4 [2019-12-18 12:34:39,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:34:39,403 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:34:39,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:34:39,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:34:39,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:34:39,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:34:39" (1/1) ... [2019-12-18 12:34:39,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65a8b86a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:39, skipping insertion in model container [2019-12-18 12:34:39,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:34:39" (1/1) ... [2019-12-18 12:34:39,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:34:39,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:34:40,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:34:40,027 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:34:40,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:34:40,188 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:34:40,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:40 WrapperNode [2019-12-18 12:34:40,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:34:40,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:34:40,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:34:40,190 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:34:40,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:40" (1/1) ... [2019-12-18 12:34:40,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:40" (1/1) ... [2019-12-18 12:34:40,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:34:40,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:34:40,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:34:40,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:34:40,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:40" (1/1) ... [2019-12-18 12:34:40,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:40" (1/1) ... [2019-12-18 12:34:40,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:40" (1/1) ... [2019-12-18 12:34:40,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:40" (1/1) ... [2019-12-18 12:34:40,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:40" (1/1) ... [2019-12-18 12:34:40,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:40" (1/1) ... [2019-12-18 12:34:40,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:40" (1/1) ... [2019-12-18 12:34:40,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:34:40,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:34:40,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:34:40,309 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:34:40,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:40" (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-12-18 12:34:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:34:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:34:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:34:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:34:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:34:40,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:34:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:34:40,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:34:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:34:40,373 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:34:40,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:34:40,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:34:40,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:34:40,375 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:34:41,142 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:34:41,142 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:34:41,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:34:41 BoogieIcfgContainer [2019-12-18 12:34:41,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:34:41,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:34:41,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:34:41,152 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:34:41,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:34:39" (1/3) ... [2019-12-18 12:34:41,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffcd405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:34:41, skipping insertion in model container [2019-12-18 12:34:41,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:34:40" (2/3) ... [2019-12-18 12:34:41,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffcd405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:34:41, skipping insertion in model container [2019-12-18 12:34:41,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:34:41" (3/3) ... [2019-12-18 12:34:41,159 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_rmo.oepc.i [2019-12-18 12:34:41,170 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:34:41,170 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:34:41,186 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:34:41,187 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:34:41,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,231 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,231 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,232 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,232 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,233 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,241 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,241 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,267 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,267 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,295 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,297 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,304 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,304 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,305 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,307 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,307 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:34:41,330 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:34:41,348 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:34:41,348 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:34:41,348 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:34:41,348 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:34:41,348 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:34:41,348 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:34:41,348 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:34:41,349 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:34:41,366 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 12:34:41,368 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 12:34:41,460 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 12:34:41,461 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:34:41,481 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:34:41,510 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 12:34:41,557 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 12:34:41,557 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:34:41,566 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:34:41,588 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:34:41,589 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:34:46,712 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-12-18 12:34:46,814 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-12-18 12:34:47,026 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 12:34:47,147 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 12:34:47,176 INFO L206 etLargeBlockEncoding]: Checked pairs total: 89688 [2019-12-18 12:34:47,176 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 12:34:47,180 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-18 12:35:02,874 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106864 states. [2019-12-18 12:35:02,876 INFO L276 IsEmpty]: Start isEmpty. Operand 106864 states. [2019-12-18 12:35:02,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:35:02,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:02,882 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:35:02,883 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:02,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:02,892 INFO L82 PathProgramCache]: Analyzing trace with hash 921701, now seen corresponding path program 1 times [2019-12-18 12:35:02,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:02,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068670306] [2019-12-18 12:35:02,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:03,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:03,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068670306] [2019-12-18 12:35:03,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:03,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:35:03,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709773486] [2019-12-18 12:35:03,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:35:03,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:03,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:35:03,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:03,153 INFO L87 Difference]: Start difference. First operand 106864 states. Second operand 3 states. [2019-12-18 12:35:05,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:05,651 INFO L93 Difference]: Finished difference Result 106034 states and 453004 transitions. [2019-12-18 12:35:05,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:35:05,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:35:05,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:06,204 INFO L225 Difference]: With dead ends: 106034 [2019-12-18 12:35:06,204 INFO L226 Difference]: Without dead ends: 99950 [2019-12-18 12:35:06,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-18 12:35:13,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99950 states. [2019-12-18 12:35:16,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99950 to 99950. [2019-12-18 12:35:16,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99950 states. [2019-12-18 12:35:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99950 states to 99950 states and 426445 transitions. [2019-12-18 12:35:16,504 INFO L78 Accepts]: Start accepts. Automaton has 99950 states and 426445 transitions. Word has length 3 [2019-12-18 12:35:16,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:16,504 INFO L462 AbstractCegarLoop]: Abstraction has 99950 states and 426445 transitions. [2019-12-18 12:35:16,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:35:16,505 INFO L276 IsEmpty]: Start isEmpty. Operand 99950 states and 426445 transitions. [2019-12-18 12:35:16,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:35:16,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:16,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:16,509 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:16,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:16,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1680645281, now seen corresponding path program 1 times [2019-12-18 12:35:16,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:16,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139833230] [2019-12-18 12:35:16,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:16,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139833230] [2019-12-18 12:35:16,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:16,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:35:16,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670767487] [2019-12-18 12:35:16,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:35:16,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:16,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:35:16,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:35:16,642 INFO L87 Difference]: Start difference. First operand 99950 states and 426445 transitions. Second operand 4 states. [2019-12-18 12:35:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:21,731 INFO L93 Difference]: Finished difference Result 159384 states and 652094 transitions. [2019-12-18 12:35:21,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:35:21,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:35:21,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:22,360 INFO L225 Difference]: With dead ends: 159384 [2019-12-18 12:35:22,360 INFO L226 Difference]: Without dead ends: 159335 [2019-12-18 12:35:22,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-18 12:35:27,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159335 states. [2019-12-18 12:35:30,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159335 to 143879. [2019-12-18 12:35:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143879 states. [2019-12-18 12:35:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143879 states to 143879 states and 597281 transitions. [2019-12-18 12:35:31,450 INFO L78 Accepts]: Start accepts. Automaton has 143879 states and 597281 transitions. Word has length 11 [2019-12-18 12:35:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:31,450 INFO L462 AbstractCegarLoop]: Abstraction has 143879 states and 597281 transitions. [2019-12-18 12:35:31,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:35:31,451 INFO L276 IsEmpty]: Start isEmpty. Operand 143879 states and 597281 transitions. [2019-12-18 12:35:31,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:35:31,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:31,457 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:31,457 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:31,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:31,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1535099311, now seen corresponding path program 1 times [2019-12-18 12:35:31,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:31,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653629221] [2019-12-18 12:35:31,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:31,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:31,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653629221] [2019-12-18 12:35:31,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:31,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:35:31,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501638722] [2019-12-18 12:35:31,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:35:31,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:31,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:35:31,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:35:31,577 INFO L87 Difference]: Start difference. First operand 143879 states and 597281 transitions. Second operand 4 states. [2019-12-18 12:35:38,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:38,306 INFO L93 Difference]: Finished difference Result 202801 states and 822791 transitions. [2019-12-18 12:35:38,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:35:38,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 12:35:38,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:38,917 INFO L225 Difference]: With dead ends: 202801 [2019-12-18 12:35:38,918 INFO L226 Difference]: Without dead ends: 202745 [2019-12-18 12:35:38,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-18 12:35:44,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202745 states. [2019-12-18 12:35:47,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202745 to 170256. [2019-12-18 12:35:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170256 states. [2019-12-18 12:35:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170256 states to 170256 states and 703222 transitions. [2019-12-18 12:35:48,123 INFO L78 Accepts]: Start accepts. Automaton has 170256 states and 703222 transitions. Word has length 13 [2019-12-18 12:35:48,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:48,124 INFO L462 AbstractCegarLoop]: Abstraction has 170256 states and 703222 transitions. [2019-12-18 12:35:48,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:35:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 170256 states and 703222 transitions. [2019-12-18 12:35:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:35:48,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:48,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:48,135 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:48,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:48,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1228744872, now seen corresponding path program 1 times [2019-12-18 12:35:48,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:48,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483607672] [2019-12-18 12:35:48,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:48,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483607672] [2019-12-18 12:35:48,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:48,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:35:48,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015227350] [2019-12-18 12:35:48,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:35:48,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:48,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:35:48,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:35:48,212 INFO L87 Difference]: Start difference. First operand 170256 states and 703222 transitions. Second operand 4 states. [2019-12-18 12:35:54,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:54,542 INFO L93 Difference]: Finished difference Result 214467 states and 881100 transitions. [2019-12-18 12:35:54,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:35:54,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:35:54,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:55,184 INFO L225 Difference]: With dead ends: 214467 [2019-12-18 12:35:55,184 INFO L226 Difference]: Without dead ends: 214467 [2019-12-18 12:35:55,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-18 12:36:00,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214467 states. [2019-12-18 12:36:09,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214467 to 183252. [2019-12-18 12:36:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183252 states. [2019-12-18 12:36:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183252 states to 183252 states and 757164 transitions. [2019-12-18 12:36:10,890 INFO L78 Accepts]: Start accepts. Automaton has 183252 states and 757164 transitions. Word has length 16 [2019-12-18 12:36:10,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:10,890 INFO L462 AbstractCegarLoop]: Abstraction has 183252 states and 757164 transitions. [2019-12-18 12:36:10,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:36:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand 183252 states and 757164 transitions. [2019-12-18 12:36:10,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:36:10,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:10,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:10,902 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:10,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:10,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1228651655, now seen corresponding path program 1 times [2019-12-18 12:36:10,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:10,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142559319] [2019-12-18 12:36:10,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:36:10,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142559319] [2019-12-18 12:36:10,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:10,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:36:10,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651365389] [2019-12-18 12:36:10,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:36:10,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:10,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:36:10,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:36:10,976 INFO L87 Difference]: Start difference. First operand 183252 states and 757164 transitions. Second operand 4 states. [2019-12-18 12:36:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:13,633 INFO L93 Difference]: Finished difference Result 223450 states and 919042 transitions. [2019-12-18 12:36:13,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:36:13,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:36:13,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:14,340 INFO L225 Difference]: With dead ends: 223450 [2019-12-18 12:36:14,340 INFO L226 Difference]: Without dead ends: 223450 [2019-12-18 12:36:14,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-18 12:36:26,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223450 states. [2019-12-18 12:36:29,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223450 to 182620. [2019-12-18 12:36:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182620 states. [2019-12-18 12:36:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182620 states to 182620 states and 754482 transitions. [2019-12-18 12:36:30,504 INFO L78 Accepts]: Start accepts. Automaton has 182620 states and 754482 transitions. Word has length 16 [2019-12-18 12:36:30,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:30,504 INFO L462 AbstractCegarLoop]: Abstraction has 182620 states and 754482 transitions. [2019-12-18 12:36:30,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:36:30,505 INFO L276 IsEmpty]: Start isEmpty. Operand 182620 states and 754482 transitions. [2019-12-18 12:36:30,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 12:36:30,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:30,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:30,520 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:30,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:30,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1477868963, now seen corresponding path program 1 times [2019-12-18 12:36:30,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:30,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413589776] [2019-12-18 12:36:30,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:36:30,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413589776] [2019-12-18 12:36:30,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:30,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:36:30,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905325246] [2019-12-18 12:36:30,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:36:30,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:30,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:36:30,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:36:30,581 INFO L87 Difference]: Start difference. First operand 182620 states and 754482 transitions. Second operand 3 states. [2019-12-18 12:36:32,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:32,656 INFO L93 Difference]: Finished difference Result 182256 states and 753055 transitions. [2019-12-18 12:36:32,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:36:32,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 12:36:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:33,211 INFO L225 Difference]: With dead ends: 182256 [2019-12-18 12:36:33,211 INFO L226 Difference]: Without dead ends: 182256 [2019-12-18 12:36:33,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-18 12:36:44,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182256 states. [2019-12-18 12:36:47,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182256 to 182256. [2019-12-18 12:36:47,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182256 states. [2019-12-18 12:36:48,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182256 states to 182256 states and 753055 transitions. [2019-12-18 12:36:48,951 INFO L78 Accepts]: Start accepts. Automaton has 182256 states and 753055 transitions. Word has length 18 [2019-12-18 12:36:48,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:48,952 INFO L462 AbstractCegarLoop]: Abstraction has 182256 states and 753055 transitions. [2019-12-18 12:36:48,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:36:48,952 INFO L276 IsEmpty]: Start isEmpty. Operand 182256 states and 753055 transitions. [2019-12-18 12:36:48,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 12:36:48,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:48,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:48,969 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:48,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:48,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1719186322, now seen corresponding path program 1 times [2019-12-18 12:36:48,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:48,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703319659] [2019-12-18 12:36:48,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:49,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:36:49,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703319659] [2019-12-18 12:36:49,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:49,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:36:49,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969222025] [2019-12-18 12:36:49,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:36:49,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:49,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:36:49,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:36:49,027 INFO L87 Difference]: Start difference. First operand 182256 states and 753055 transitions. Second operand 3 states. [2019-12-18 12:36:49,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:49,855 INFO L93 Difference]: Finished difference Result 171684 states and 701366 transitions. [2019-12-18 12:36:49,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:36:49,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 12:36:49,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:50,317 INFO L225 Difference]: With dead ends: 171684 [2019-12-18 12:36:50,317 INFO L226 Difference]: Without dead ends: 171684 [2019-12-18 12:36:50,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:37:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171684 states. [2019-12-18 12:37:03,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171684 to 168552. [2019-12-18 12:37:03,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168552 states. [2019-12-18 12:37:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168552 states to 168552 states and 689782 transitions. [2019-12-18 12:37:04,342 INFO L78 Accepts]: Start accepts. Automaton has 168552 states and 689782 transitions. Word has length 19 [2019-12-18 12:37:04,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:37:04,342 INFO L462 AbstractCegarLoop]: Abstraction has 168552 states and 689782 transitions. [2019-12-18 12:37:04,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:37:04,343 INFO L276 IsEmpty]: Start isEmpty. Operand 168552 states and 689782 transitions. [2019-12-18 12:37:04,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 12:37:04,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:37:04,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:37:04,355 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:37:04,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:37:04,355 INFO L82 PathProgramCache]: Analyzing trace with hash 2011667091, now seen corresponding path program 1 times [2019-12-18 12:37:04,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:37:04,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677454006] [2019-12-18 12:37:04,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:37:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:37:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:37:04,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677454006] [2019-12-18 12:37:04,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:37:04,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:37:04,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880379420] [2019-12-18 12:37:04,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:37:04,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:37:04,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:37:04,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:37:04,452 INFO L87 Difference]: Start difference. First operand 168552 states and 689782 transitions. Second operand 5 states. [2019-12-18 12:37:07,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:37:07,199 INFO L93 Difference]: Finished difference Result 249455 states and 1001464 transitions. [2019-12-18 12:37:07,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:37:07,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 12:37:07,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:37:15,292 INFO L225 Difference]: With dead ends: 249455 [2019-12-18 12:37:15,292 INFO L226 Difference]: Without dead ends: 249364 [2019-12-18 12:37:15,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:37:20,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249364 states. [2019-12-18 12:37:23,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249364 to 180285. [2019-12-18 12:37:23,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180285 states. [2019-12-18 12:37:24,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180285 states to 180285 states and 737390 transitions. [2019-12-18 12:37:24,411 INFO L78 Accepts]: Start accepts. Automaton has 180285 states and 737390 transitions. Word has length 19 [2019-12-18 12:37:24,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:37:24,411 INFO L462 AbstractCegarLoop]: Abstraction has 180285 states and 737390 transitions. [2019-12-18 12:37:24,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:37:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand 180285 states and 737390 transitions. [2019-12-18 12:37:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 12:37:24,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:37:24,424 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:37:24,424 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:37:24,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:37:24,424 INFO L82 PathProgramCache]: Analyzing trace with hash -397421843, now seen corresponding path program 1 times [2019-12-18 12:37:24,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:37:24,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824341679] [2019-12-18 12:37:24,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:37:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:37:24,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:37:24,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824341679] [2019-12-18 12:37:24,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:37:24,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:37:24,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000133860] [2019-12-18 12:37:24,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:37:24,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:37:24,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:37:24,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:37:24,502 INFO L87 Difference]: Start difference. First operand 180285 states and 737390 transitions. Second operand 4 states. [2019-12-18 12:37:25,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:37:25,883 INFO L93 Difference]: Finished difference Result 49433 states and 168883 transitions. [2019-12-18 12:37:25,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:37:25,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 12:37:25,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:37:25,956 INFO L225 Difference]: With dead ends: 49433 [2019-12-18 12:37:25,956 INFO L226 Difference]: Without dead ends: 37972 [2019-12-18 12:37:25,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-18 12:37:26,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37972 states. [2019-12-18 12:37:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37972 to 37867. [2019-12-18 12:37:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37867 states. [2019-12-18 12:37:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37867 states to 37867 states and 122078 transitions. [2019-12-18 12:37:26,583 INFO L78 Accepts]: Start accepts. Automaton has 37867 states and 122078 transitions. Word has length 19 [2019-12-18 12:37:26,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:37:26,583 INFO L462 AbstractCegarLoop]: Abstraction has 37867 states and 122078 transitions. [2019-12-18 12:37:26,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:37:26,583 INFO L276 IsEmpty]: Start isEmpty. Operand 37867 states and 122078 transitions. [2019-12-18 12:37:26,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:37:26,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:37:26,589 INFO L411 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-12-18 12:37:26,589 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:37:26,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:37:26,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1838789338, now seen corresponding path program 1 times [2019-12-18 12:37:26,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:37:26,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986541418] [2019-12-18 12:37:26,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:37:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:37:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:37:26,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986541418] [2019-12-18 12:37:26,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:37:26,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:37:26,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88863076] [2019-12-18 12:37:26,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:37:26,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:37:26,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:37:26,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:37:26,659 INFO L87 Difference]: Start difference. First operand 37867 states and 122078 transitions. Second operand 5 states. [2019-12-18 12:37:27,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:37:27,271 INFO L93 Difference]: Finished difference Result 56067 states and 178279 transitions. [2019-12-18 12:37:27,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:37:27,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:37:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:37:27,359 INFO L225 Difference]: With dead ends: 56067 [2019-12-18 12:37:27,359 INFO L226 Difference]: Without dead ends: 56011 [2019-12-18 12:37:27,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:37:27,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56011 states. [2019-12-18 12:37:30,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56011 to 41085. [2019-12-18 12:37:30,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41085 states. [2019-12-18 12:37:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41085 states to 41085 states and 132295 transitions. [2019-12-18 12:37:30,654 INFO L78 Accepts]: Start accepts. Automaton has 41085 states and 132295 transitions. Word has length 22 [2019-12-18 12:37:30,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:37:30,654 INFO L462 AbstractCegarLoop]: Abstraction has 41085 states and 132295 transitions. [2019-12-18 12:37:30,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:37:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 41085 states and 132295 transitions. [2019-12-18 12:37:30,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:37:30,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:37:30,661 INFO L411 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-12-18 12:37:30,661 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:37:30,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:37:30,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1838882555, now seen corresponding path program 1 times [2019-12-18 12:37:30,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:37:30,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874768311] [2019-12-18 12:37:30,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:37:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:37:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:37:30,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874768311] [2019-12-18 12:37:30,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:37:30,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:37:30,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008856712] [2019-12-18 12:37:30,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:37:30,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:37:30,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:37:30,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:37:30,726 INFO L87 Difference]: Start difference. First operand 41085 states and 132295 transitions. Second operand 5 states. [2019-12-18 12:37:31,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:37:31,446 INFO L93 Difference]: Finished difference Result 56578 states and 179826 transitions. [2019-12-18 12:37:31,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:37:31,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:37:31,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:37:31,571 INFO L225 Difference]: With dead ends: 56578 [2019-12-18 12:37:31,571 INFO L226 Difference]: Without dead ends: 56522 [2019-12-18 12:37:31,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:37:31,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56522 states. [2019-12-18 12:37:32,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56522 to 38683. [2019-12-18 12:37:32,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38683 states. [2019-12-18 12:37:32,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38683 states to 38683 states and 124370 transitions. [2019-12-18 12:37:32,706 INFO L78 Accepts]: Start accepts. Automaton has 38683 states and 124370 transitions. Word has length 22 [2019-12-18 12:37:32,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:37:32,706 INFO L462 AbstractCegarLoop]: Abstraction has 38683 states and 124370 transitions. [2019-12-18 12:37:32,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:37:32,707 INFO L276 IsEmpty]: Start isEmpty. Operand 38683 states and 124370 transitions. [2019-12-18 12:37:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:37:32,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:37:32,719 INFO L411 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] [2019-12-18 12:37:32,719 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:37:32,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:37:32,720 INFO L82 PathProgramCache]: Analyzing trace with hash 270212897, now seen corresponding path program 1 times [2019-12-18 12:37:32,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:37:32,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015036060] [2019-12-18 12:37:32,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:37:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:37:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:37:32,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015036060] [2019-12-18 12:37:32,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:37:32,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:37:32,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403160807] [2019-12-18 12:37:32,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:37:32,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:37:32,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:37:32,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:37:32,756 INFO L87 Difference]: Start difference. First operand 38683 states and 124370 transitions. Second operand 3 states. [2019-12-18 12:37:33,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:37:33,010 INFO L93 Difference]: Finished difference Result 59121 states and 189037 transitions. [2019-12-18 12:37:33,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:37:33,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:37:33,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:37:33,109 INFO L225 Difference]: With dead ends: 59121 [2019-12-18 12:37:33,109 INFO L226 Difference]: Without dead ends: 59121 [2019-12-18 12:37:33,110 INFO L631 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-12-18 12:37:33,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59121 states. [2019-12-18 12:37:34,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59121 to 45711. [2019-12-18 12:37:34,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45711 states. [2019-12-18 12:37:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45711 states to 45711 states and 147221 transitions. [2019-12-18 12:37:34,506 INFO L78 Accepts]: Start accepts. Automaton has 45711 states and 147221 transitions. Word has length 27 [2019-12-18 12:37:34,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:37:34,507 INFO L462 AbstractCegarLoop]: Abstraction has 45711 states and 147221 transitions. [2019-12-18 12:37:34,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:37:34,507 INFO L276 IsEmpty]: Start isEmpty. Operand 45711 states and 147221 transitions. [2019-12-18 12:37:34,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:37:34,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:37:34,522 INFO L411 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] [2019-12-18 12:37:34,522 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:37:34,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:37:34,523 INFO L82 PathProgramCache]: Analyzing trace with hash 2064759266, now seen corresponding path program 1 times [2019-12-18 12:37:34,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:37:34,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461900363] [2019-12-18 12:37:34,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:37:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:37:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:37:34,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461900363] [2019-12-18 12:37:34,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:37:34,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:37:34,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413521161] [2019-12-18 12:37:34,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:37:34,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:37:34,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:37:34,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:37:34,555 INFO L87 Difference]: Start difference. First operand 45711 states and 147221 transitions. Second operand 3 states. [2019-12-18 12:37:34,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:37:34,821 INFO L93 Difference]: Finished difference Result 59121 states and 184317 transitions. [2019-12-18 12:37:34,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:37:34,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:37:34,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:37:34,921 INFO L225 Difference]: With dead ends: 59121 [2019-12-18 12:37:34,922 INFO L226 Difference]: Without dead ends: 59121 [2019-12-18 12:37:34,922 INFO L631 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-12-18 12:37:35,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59121 states. [2019-12-18 12:37:35,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59121 to 45711. [2019-12-18 12:37:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45711 states. [2019-12-18 12:37:35,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45711 states to 45711 states and 142501 transitions. [2019-12-18 12:37:35,737 INFO L78 Accepts]: Start accepts. Automaton has 45711 states and 142501 transitions. Word has length 27 [2019-12-18 12:37:35,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:37:35,738 INFO L462 AbstractCegarLoop]: Abstraction has 45711 states and 142501 transitions. [2019-12-18 12:37:35,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:37:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 45711 states and 142501 transitions. [2019-12-18 12:37:36,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:37:36,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:37:36,115 INFO L411 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] [2019-12-18 12:37:36,115 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:37:36,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:37:36,116 INFO L82 PathProgramCache]: Analyzing trace with hash 2010439622, now seen corresponding path program 1 times [2019-12-18 12:37:36,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:37:36,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857818867] [2019-12-18 12:37:36,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:37:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:37:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:37:36,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857818867] [2019-12-18 12:37:36,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:37:36,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:37:36,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800204639] [2019-12-18 12:37:36,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:37:36,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:37:36,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:37:36,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:37:36,164 INFO L87 Difference]: Start difference. First operand 45711 states and 142501 transitions. Second operand 5 states. [2019-12-18 12:37:36,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:37:36,624 INFO L93 Difference]: Finished difference Result 56372 states and 173835 transitions. [2019-12-18 12:37:36,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:37:36,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 12:37:36,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:37:36,704 INFO L225 Difference]: With dead ends: 56372 [2019-12-18 12:37:36,705 INFO L226 Difference]: Without dead ends: 56196 [2019-12-18 12:37:36,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:37:36,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56196 states. [2019-12-18 12:37:37,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56196 to 47904. [2019-12-18 12:37:37,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47904 states. [2019-12-18 12:37:37,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47904 states to 47904 states and 149182 transitions. [2019-12-18 12:37:37,491 INFO L78 Accepts]: Start accepts. Automaton has 47904 states and 149182 transitions. Word has length 27 [2019-12-18 12:37:37,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:37:37,491 INFO L462 AbstractCegarLoop]: Abstraction has 47904 states and 149182 transitions. [2019-12-18 12:37:37,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:37:37,491 INFO L276 IsEmpty]: Start isEmpty. Operand 47904 states and 149182 transitions. [2019-12-18 12:37:37,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:37:37,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:37:37,507 INFO L411 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] [2019-12-18 12:37:37,507 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:37:37,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:37:37,508 INFO L82 PathProgramCache]: Analyzing trace with hash 773295241, now seen corresponding path program 1 times [2019-12-18 12:37:37,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:37:37,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918920317] [2019-12-18 12:37:37,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:37:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:37:37,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:37:37,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918920317] [2019-12-18 12:37:37,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:37:37,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:37:37,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180246293] [2019-12-18 12:37:37,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:37:37,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:37:37,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:37:37,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:37:37,588 INFO L87 Difference]: Start difference. First operand 47904 states and 149182 transitions. Second operand 5 states. [2019-12-18 12:37:38,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:37:38,217 INFO L93 Difference]: Finished difference Result 58142 states and 179062 transitions. [2019-12-18 12:37:38,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:37:38,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 12:37:38,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:37:38,729 INFO L225 Difference]: With dead ends: 58142 [2019-12-18 12:37:38,729 INFO L226 Difference]: Without dead ends: 57958 [2019-12-18 12:37:38,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:37:39,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57958 states. [2019-12-18 12:37:39,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57958 to 47592. [2019-12-18 12:37:39,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47592 states. [2019-12-18 12:37:39,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47592 states to 47592 states and 148093 transitions. [2019-12-18 12:37:39,557 INFO L78 Accepts]: Start accepts. Automaton has 47592 states and 148093 transitions. Word has length 28 [2019-12-18 12:37:39,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:37:39,557 INFO L462 AbstractCegarLoop]: Abstraction has 47592 states and 148093 transitions. [2019-12-18 12:37:39,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:37:39,557 INFO L276 IsEmpty]: Start isEmpty. Operand 47592 states and 148093 transitions. [2019-12-18 12:37:39,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 12:37:39,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:37:39,572 INFO L411 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] [2019-12-18 12:37:39,572 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:37:39,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:37:39,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1820575072, now seen corresponding path program 1 times [2019-12-18 12:37:39,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:37:39,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844661399] [2019-12-18 12:37:39,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:37:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:37:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:37:39,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844661399] [2019-12-18 12:37:39,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:37:39,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:37:39,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16742934] [2019-12-18 12:37:39,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:37:39,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:37:39,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:37:39,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:37:39,649 INFO L87 Difference]: Start difference. First operand 47592 states and 148093 transitions. Second operand 5 states. [2019-12-18 12:37:39,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:37:39,790 INFO L93 Difference]: Finished difference Result 21069 states and 62976 transitions. [2019-12-18 12:37:39,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:37:39,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 12:37:39,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:37:39,830 INFO L225 Difference]: With dead ends: 21069 [2019-12-18 12:37:39,831 INFO L226 Difference]: Without dead ends: 18454 [2019-12-18 12:37:39,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:37:39,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18454 states. [2019-12-18 12:37:40,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18454 to 17375. [2019-12-18 12:37:40,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17375 states. [2019-12-18 12:37:40,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17375 states to 17375 states and 51733 transitions. [2019-12-18 12:37:40,212 INFO L78 Accepts]: Start accepts. Automaton has 17375 states and 51733 transitions. Word has length 30 [2019-12-18 12:37:40,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:37:40,214 INFO L462 AbstractCegarLoop]: Abstraction has 17375 states and 51733 transitions. [2019-12-18 12:37:40,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:37:40,214 INFO L276 IsEmpty]: Start isEmpty. Operand 17375 states and 51733 transitions. [2019-12-18 12:37:40,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:37:40,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:37:40,233 INFO L411 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] [2019-12-18 12:37:40,233 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:37:40,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:37:40,233 INFO L82 PathProgramCache]: Analyzing trace with hash -809721720, now seen corresponding path program 1 times [2019-12-18 12:37:40,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:37:40,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8435258] [2019-12-18 12:37:40,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:37:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:37:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:37:40,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8435258] [2019-12-18 12:37:40,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:37:40,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:37:40,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401986222] [2019-12-18 12:37:40,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:37:40,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:37:40,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:37:40,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:37:40,349 INFO L87 Difference]: Start difference. First operand 17375 states and 51733 transitions. Second operand 6 states. [2019-12-18 12:37:41,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:37:41,108 INFO L93 Difference]: Finished difference Result 22016 states and 64715 transitions. [2019-12-18 12:37:41,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:37:41,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 12:37:41,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:37:41,145 INFO L225 Difference]: With dead ends: 22016 [2019-12-18 12:37:41,145 INFO L226 Difference]: Without dead ends: 21702 [2019-12-18 12:37:41,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:37:41,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21702 states. [2019-12-18 12:37:41,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21702 to 17450. [2019-12-18 12:37:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17450 states. [2019-12-18 12:37:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17450 states to 17450 states and 51962 transitions. [2019-12-18 12:37:41,423 INFO L78 Accepts]: Start accepts. Automaton has 17450 states and 51962 transitions. Word has length 33 [2019-12-18 12:37:41,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:37:41,423 INFO L462 AbstractCegarLoop]: Abstraction has 17450 states and 51962 transitions. [2019-12-18 12:37:41,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:37:41,423 INFO L276 IsEmpty]: Start isEmpty. Operand 17450 states and 51962 transitions. [2019-12-18 12:37:41,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:37:41,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:37:41,438 INFO L411 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] [2019-12-18 12:37:41,438 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:37:41,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:37:41,439 INFO L82 PathProgramCache]: Analyzing trace with hash -752360441, now seen corresponding path program 1 times [2019-12-18 12:37:41,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:37:41,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112104288] [2019-12-18 12:37:41,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:37:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:37:41,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:37:41,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112104288] [2019-12-18 12:37:41,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:37:41,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:37:41,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426522239] [2019-12-18 12:37:41,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:37:41,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:37:41,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:37:41,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:37:41,502 INFO L87 Difference]: Start difference. First operand 17450 states and 51962 transitions. Second operand 6 states. [2019-12-18 12:37:42,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:37:42,173 INFO L93 Difference]: Finished difference Result 21180 states and 62232 transitions. [2019-12-18 12:37:42,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:37:42,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 12:37:42,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:37:42,203 INFO L225 Difference]: With dead ends: 21180 [2019-12-18 12:37:42,203 INFO L226 Difference]: Without dead ends: 20805 [2019-12-18 12:37:42,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:37:42,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20805 states. [2019-12-18 12:37:42,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20805 to 16323. [2019-12-18 12:37:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16323 states. [2019-12-18 12:37:42,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16323 states to 16323 states and 48617 transitions. [2019-12-18 12:37:42,465 INFO L78 Accepts]: Start accepts. Automaton has 16323 states and 48617 transitions. Word has length 34 [2019-12-18 12:37:42,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:37:42,466 INFO L462 AbstractCegarLoop]: Abstraction has 16323 states and 48617 transitions. [2019-12-18 12:37:42,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:37:42,466 INFO L276 IsEmpty]: Start isEmpty. Operand 16323 states and 48617 transitions. [2019-12-18 12:37:42,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 12:37:42,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:37:42,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:37:42,485 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:37:42,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:37:42,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1200265194, now seen corresponding path program 1 times [2019-12-18 12:37:42,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:37:42,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836714214] [2019-12-18 12:37:42,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:37:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:37:42,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:37:42,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836714214] [2019-12-18 12:37:42,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:37:42,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:37:42,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235213249] [2019-12-18 12:37:42,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:37:42,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:37:42,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:37:42,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:37:42,554 INFO L87 Difference]: Start difference. First operand 16323 states and 48617 transitions. Second operand 5 states. [2019-12-18 12:37:43,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:37:43,120 INFO L93 Difference]: Finished difference Result 24319 states and 71696 transitions. [2019-12-18 12:37:43,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:37:43,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 12:37:43,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:37:43,153 INFO L225 Difference]: With dead ends: 24319 [2019-12-18 12:37:43,153 INFO L226 Difference]: Without dead ends: 24319 [2019-12-18 12:37:43,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:37:43,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24319 states. [2019-12-18 12:37:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24319 to 19422. [2019-12-18 12:37:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19422 states. [2019-12-18 12:37:43,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19422 states to 19422 states and 57992 transitions. [2019-12-18 12:37:43,449 INFO L78 Accepts]: Start accepts. Automaton has 19422 states and 57992 transitions. Word has length 41 [2019-12-18 12:37:43,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:37:43,450 INFO L462 AbstractCegarLoop]: Abstraction has 19422 states and 57992 transitions. [2019-12-18 12:37:43,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:37:43,450 INFO L276 IsEmpty]: Start isEmpty. Operand 19422 states and 57992 transitions. [2019-12-18 12:37:43,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 12:37:43,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:37:43,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:37:43,610 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:37:43,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:37:43,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1472692188, now seen corresponding path program 2 times [2019-12-18 12:37:43,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:37:43,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451397089] [2019-12-18 12:37:43,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:37:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:37:43,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:37:43,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451397089] [2019-12-18 12:37:43,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:37:43,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:37:43,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440038928] [2019-12-18 12:37:43,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:37:43,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:37:43,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:37:43,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:37:43,702 INFO L87 Difference]: Start difference. First operand 19422 states and 57992 transitions. Second operand 6 states. [2019-12-18 12:37:43,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:37:43,809 INFO L93 Difference]: Finished difference Result 18083 states and 55096 transitions. [2019-12-18 12:37:43,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:37:43,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 12:37:43,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:37:43,836 INFO L225 Difference]: With dead ends: 18083 [2019-12-18 12:37:43,836 INFO L226 Difference]: Without dead ends: 17937 [2019-12-18 12:37:43,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:37:43,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17937 states. [2019-12-18 12:37:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17937 to 16477. [2019-12-18 12:37:44,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16477 states. [2019-12-18 12:37:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16477 states to 16477 states and 50618 transitions. [2019-12-18 12:37:44,078 INFO L78 Accepts]: Start accepts. Automaton has 16477 states and 50618 transitions. Word has length 41 [2019-12-18 12:37:44,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:37:44,078 INFO L462 AbstractCegarLoop]: Abstraction has 16477 states and 50618 transitions. [2019-12-18 12:37:44,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:37:44,078 INFO L276 IsEmpty]: Start isEmpty. Operand 16477 states and 50618 transitions. [2019-12-18 12:37:44,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:37:44,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:37:44,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:37:44,095 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:37:44,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:37:44,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1424537019, now seen corresponding path program 1 times [2019-12-18 12:37:44,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:37:44,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423354019] [2019-12-18 12:37:44,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:37:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:37:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:37:44,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423354019] [2019-12-18 12:37:44,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:37:44,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:37:44,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796523033] [2019-12-18 12:37:44,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:37:44,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:37:44,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:37:44,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:37:44,177 INFO L87 Difference]: Start difference. First operand 16477 states and 50618 transitions. Second operand 7 states. [2019-12-18 12:37:44,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:37:44,613 INFO L93 Difference]: Finished difference Result 46623 states and 141791 transitions. [2019-12-18 12:37:44,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:37:44,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:37:44,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:37:44,662 INFO L225 Difference]: With dead ends: 46623 [2019-12-18 12:37:44,663 INFO L226 Difference]: Without dead ends: 34445 [2019-12-18 12:37:44,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:37:44,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34445 states. [2019-12-18 12:37:45,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34445 to 19495. [2019-12-18 12:37:45,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19495 states. [2019-12-18 12:37:45,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19495 states to 19495 states and 59561 transitions. [2019-12-18 12:37:45,089 INFO L78 Accepts]: Start accepts. Automaton has 19495 states and 59561 transitions. Word has length 65 [2019-12-18 12:37:45,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:37:45,089 INFO L462 AbstractCegarLoop]: Abstraction has 19495 states and 59561 transitions. [2019-12-18 12:37:45,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:37:45,089 INFO L276 IsEmpty]: Start isEmpty. Operand 19495 states and 59561 transitions. [2019-12-18 12:37:45,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:37:45,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:37:45,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:37:45,109 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:37:45,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:37:45,109 INFO L82 PathProgramCache]: Analyzing trace with hash 292633507, now seen corresponding path program 2 times [2019-12-18 12:37:45,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:37:45,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454849492] [2019-12-18 12:37:45,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:37:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:37:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:37:45,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454849492] [2019-12-18 12:37:45,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:37:45,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:37:45,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416767845] [2019-12-18 12:37:45,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:37:45,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:37:45,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:37:45,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:37:45,196 INFO L87 Difference]: Start difference. First operand 19495 states and 59561 transitions. Second operand 8 states. [2019-12-18 12:37:46,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:37:46,605 INFO L93 Difference]: Finished difference Result 73574 states and 223403 transitions. [2019-12-18 12:37:46,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:37:46,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 12:37:46,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:37:46,681 INFO L225 Difference]: With dead ends: 73574 [2019-12-18 12:37:46,681 INFO L226 Difference]: Without dead ends: 53643 [2019-12-18 12:37:46,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:37:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53643 states. [2019-12-18 12:37:47,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53643 to 23727. [2019-12-18 12:37:47,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23727 states. [2019-12-18 12:37:47,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23727 states to 23727 states and 72403 transitions. [2019-12-18 12:37:47,271 INFO L78 Accepts]: Start accepts. Automaton has 23727 states and 72403 transitions. Word has length 65 [2019-12-18 12:37:47,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:37:47,271 INFO L462 AbstractCegarLoop]: Abstraction has 23727 states and 72403 transitions. [2019-12-18 12:37:47,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:37:47,271 INFO L276 IsEmpty]: Start isEmpty. Operand 23727 states and 72403 transitions. [2019-12-18 12:37:47,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:37:47,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:37:47,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:37:47,302 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:37:47,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:37:47,303 INFO L82 PathProgramCache]: Analyzing trace with hash 45765331, now seen corresponding path program 3 times [2019-12-18 12:37:47,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:37:47,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203339024] [2019-12-18 12:37:47,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:37:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:37:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:37:47,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203339024] [2019-12-18 12:37:47,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:37:47,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:37:47,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201624633] [2019-12-18 12:37:47,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:37:47,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:37:47,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:37:47,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:37:47,429 INFO L87 Difference]: Start difference. First operand 23727 states and 72403 transitions. Second operand 9 states. [2019-12-18 12:37:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:37:49,051 INFO L93 Difference]: Finished difference Result 89263 states and 268455 transitions. [2019-12-18 12:37:49,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:37:49,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:37:49,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:37:49,182 INFO L225 Difference]: With dead ends: 89263 [2019-12-18 12:37:49,182 INFO L226 Difference]: Without dead ends: 85572 [2019-12-18 12:37:49,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:37:49,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85572 states. [2019-12-18 12:37:50,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85572 to 24167. [2019-12-18 12:37:50,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24167 states. [2019-12-18 12:37:50,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24167 states to 24167 states and 73738 transitions. [2019-12-18 12:37:50,334 INFO L78 Accepts]: Start accepts. Automaton has 24167 states and 73738 transitions. Word has length 65 [2019-12-18 12:37:50,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:37:50,335 INFO L462 AbstractCegarLoop]: Abstraction has 24167 states and 73738 transitions. [2019-12-18 12:37:50,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:37:50,335 INFO L276 IsEmpty]: Start isEmpty. Operand 24167 states and 73738 transitions. [2019-12-18 12:37:50,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:37:50,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:37:50,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:37:50,365 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:37:50,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:37:50,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1660891443, now seen corresponding path program 4 times [2019-12-18 12:37:50,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:37:50,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319767824] [2019-12-18 12:37:50,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:37:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:37:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:37:50,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319767824] [2019-12-18 12:37:50,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:37:50,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:37:50,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925536426] [2019-12-18 12:37:50,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:37:50,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:37:50,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:37:50,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:37:50,472 INFO L87 Difference]: Start difference. First operand 24167 states and 73738 transitions. Second operand 9 states. [2019-12-18 12:37:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:37:51,759 INFO L93 Difference]: Finished difference Result 69954 states and 211071 transitions. [2019-12-18 12:37:51,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:37:51,759 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:37:51,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:37:51,852 INFO L225 Difference]: With dead ends: 69954 [2019-12-18 12:37:51,852 INFO L226 Difference]: Without dead ends: 67627 [2019-12-18 12:37:51,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:37:52,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67627 states. [2019-12-18 12:37:52,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67627 to 23943. [2019-12-18 12:37:52,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23943 states. [2019-12-18 12:37:52,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23943 states to 23943 states and 73242 transitions. [2019-12-18 12:37:52,552 INFO L78 Accepts]: Start accepts. Automaton has 23943 states and 73242 transitions. Word has length 65 [2019-12-18 12:37:52,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:37:52,553 INFO L462 AbstractCegarLoop]: Abstraction has 23943 states and 73242 transitions. [2019-12-18 12:37:52,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:37:52,553 INFO L276 IsEmpty]: Start isEmpty. Operand 23943 states and 73242 transitions. [2019-12-18 12:37:52,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:37:52,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:37:52,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:37:52,580 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:37:52,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:37:52,581 INFO L82 PathProgramCache]: Analyzing trace with hash 937822065, now seen corresponding path program 5 times [2019-12-18 12:37:52,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:37:52,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593256568] [2019-12-18 12:37:52,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:37:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:37:52,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:37:52,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593256568] [2019-12-18 12:37:52,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:37:52,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:37:52,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221369340] [2019-12-18 12:37:52,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:37:52,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:37:52,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:37:52,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:37:52,857 INFO L87 Difference]: Start difference. First operand 23943 states and 73242 transitions. Second operand 7 states. [2019-12-18 12:37:53,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:37:53,418 INFO L93 Difference]: Finished difference Result 48405 states and 145646 transitions. [2019-12-18 12:37:53,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:37:53,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:37:53,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:37:53,490 INFO L225 Difference]: With dead ends: 48405 [2019-12-18 12:37:53,491 INFO L226 Difference]: Without dead ends: 40914 [2019-12-18 12:37:53,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:37:53,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40914 states. [2019-12-18 12:37:53,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40914 to 24279. [2019-12-18 12:37:53,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24279 states. [2019-12-18 12:37:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24279 states to 24279 states and 74224 transitions. [2019-12-18 12:37:53,974 INFO L78 Accepts]: Start accepts. Automaton has 24279 states and 74224 transitions. Word has length 65 [2019-12-18 12:37:53,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:37:53,974 INFO L462 AbstractCegarLoop]: Abstraction has 24279 states and 74224 transitions. [2019-12-18 12:37:53,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:37:53,974 INFO L276 IsEmpty]: Start isEmpty. Operand 24279 states and 74224 transitions. [2019-12-18 12:37:53,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:37:53,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:37:53,998 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:37:53,998 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:37:53,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:37:53,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1903736173, now seen corresponding path program 6 times [2019-12-18 12:37:53,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:37:53,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451063601] [2019-12-18 12:37:53,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:37:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:37:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:37:54,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451063601] [2019-12-18 12:37:54,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:37:54,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:37:54,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020250167] [2019-12-18 12:37:54,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:37:54,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:37:54,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:37:54,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:37:54,049 INFO L87 Difference]: Start difference. First operand 24279 states and 74224 transitions. Second operand 3 states. Received shutdown request... [2019-12-18 12:37:54,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:37:54,178 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 12:37:54,185 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 12:37:54,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:37:54 BasicIcfg [2019-12-18 12:37:54,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:37:54,187 INFO L168 Benchmark]: Toolchain (without parser) took 194784.65 ms. Allocated memory was 144.7 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 101.1 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 12:37:54,187 INFO L168 Benchmark]: CDTParser took 1.48 ms. Allocated memory is still 144.7 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 12:37:54,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 785.24 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 155.2 MB in the end (delta: -54.5 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-18 12:37:54,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.57 ms. Allocated memory is still 202.4 MB. Free memory was 155.2 MB in the beginning and 153.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:37:54,193 INFO L168 Benchmark]: Boogie Preprocessor took 41.44 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 150.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:37:54,194 INFO L168 Benchmark]: RCFGBuilder took 835.26 ms. Allocated memory is still 202.4 MB. Free memory was 150.3 MB in the beginning and 99.8 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-18 12:37:54,194 INFO L168 Benchmark]: TraceAbstraction took 193039.04 ms. Allocated memory was 202.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 99.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 12:37:54,200 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.48 ms. Allocated memory is still 144.7 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 785.24 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 155.2 MB in the end (delta: -54.5 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.57 ms. Allocated memory is still 202.4 MB. Free memory was 155.2 MB in the beginning and 153.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.44 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 150.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 835.26 ms. Allocated memory is still 202.4 MB. Free memory was 150.3 MB in the beginning and 99.8 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 193039.04 ms. Allocated memory was 202.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 99.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 7082 VarBasedMoverChecksPositive, 219 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 89688 CheckedPairsTotal, 119 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (24279states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (20750 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (24279states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (20750 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: TIMEOUT, OverallTime: 192.8s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 54.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5709 SDtfs, 7070 SDslu, 13915 SDs, 0 SdLazy, 6281 SolverSat, 331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 42 SyntacticMatches, 9 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183252occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 113.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 453309 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 856 NumberOfCodeBlocks, 856 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 830 ConstructedInterpolants, 0 QuantifiedInterpolants, 112398 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown