/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/mix025_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:55:44,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:55:44,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:55:44,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:55:44,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:55:44,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:55:44,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:55:44,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:55:44,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:55:44,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:55:44,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:55:44,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:55:44,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:55:44,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:55:44,052 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:55:44,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:55:44,054 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:55:44,055 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:55:44,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:55:44,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:55:44,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:55:44,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:55:44,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:55:44,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:55:44,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:55:44,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:55:44,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:55:44,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:55:44,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:55:44,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:55:44,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:55:44,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:55:44,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:55:44,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:55:44,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:55:44,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:55:44,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:55:44,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:55:44,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:55:44,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:55:44,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:55:44,075 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:55:44,089 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:55:44,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:55:44,090 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:55:44,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:55:44,091 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:55:44,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:55:44,091 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:55:44,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:55:44,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:55:44,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:55:44,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:55:44,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:55:44,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:55:44,093 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:55:44,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:55:44,093 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:55:44,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:55:44,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:55:44,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:55:44,095 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:55:44,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:55:44,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:55:44,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:55:44,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:55:44,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:55:44,096 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:55:44,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:55:44,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:55:44,097 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:55:44,097 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:55:44,361 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:55:44,378 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:55:44,382 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:55:44,384 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:55:44,384 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:55:44,385 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.oepc.i [2019-12-18 12:55:44,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0754e2ddc/896580a042674215a267881bc6cc83ee/FLAGbeb117498 [2019-12-18 12:55:45,074 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:55:45,074 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_pso.oepc.i [2019-12-18 12:55:45,099 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0754e2ddc/896580a042674215a267881bc6cc83ee/FLAGbeb117498 [2019-12-18 12:55:45,286 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0754e2ddc/896580a042674215a267881bc6cc83ee [2019-12-18 12:55:45,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:55:45,298 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:55:45,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:55:45,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:55:45,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:55:45,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:55:45" (1/1) ... [2019-12-18 12:55:45,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7db2938f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:45, skipping insertion in model container [2019-12-18 12:55:45,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:55:45" (1/1) ... [2019-12-18 12:55:45,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:55:45,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:55:45,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:55:45,910 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:55:45,999 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:55:46,072 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:55:46,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:46 WrapperNode [2019-12-18 12:55:46,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:55:46,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:55:46,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:55:46,074 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:55:46,083 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:55:46" (1/1) ... [2019-12-18 12:55:46,110 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:55:46" (1/1) ... [2019-12-18 12:55:46,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:55:46,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:55:46,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:55:46,140 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:55:46,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:46" (1/1) ... [2019-12-18 12:55:46,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:46" (1/1) ... [2019-12-18 12:55:46,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:46" (1/1) ... [2019-12-18 12:55:46,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:46" (1/1) ... [2019-12-18 12:55:46,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:46" (1/1) ... [2019-12-18 12:55:46,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:46" (1/1) ... [2019-12-18 12:55:46,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:46" (1/1) ... [2019-12-18 12:55:46,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:55:46,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:55:46,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:55:46,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:55:46,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:46" (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:55:46,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:55:46,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:55:46,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:55:46,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:55:46,258 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:55:46,259 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:55:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:55:46,260 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:55:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:55:46,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:55:46,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:55:46,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:55:46,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:55:46,264 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:55:46,997 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:55:46,998 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:55:46,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:55:46 BoogieIcfgContainer [2019-12-18 12:55:46,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:55:47,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:55:47,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:55:47,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:55:47,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:55:45" (1/3) ... [2019-12-18 12:55:47,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755b8e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:55:47, skipping insertion in model container [2019-12-18 12:55:47,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:46" (2/3) ... [2019-12-18 12:55:47,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755b8e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:55:47, skipping insertion in model container [2019-12-18 12:55:47,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:55:46" (3/3) ... [2019-12-18 12:55:47,008 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_pso.oepc.i [2019-12-18 12:55:47,018 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:55:47,019 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:55:47,027 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:55:47,028 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:55:47,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,072 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,072 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,073 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,073 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,082 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,083 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,091 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,092 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,137 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,139 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,147 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,147 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,148 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,153 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,153 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:47,173 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:55:47,193 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:55:47,193 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:55:47,194 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:55:47,194 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:55:47,194 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:55:47,194 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:55:47,194 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:55:47,194 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:55:47,211 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 12:55:47,213 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 12:55:47,305 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 12:55:47,305 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:55:47,332 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:55:47,362 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 12:55:47,454 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 12:55:47,455 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:55:47,466 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:55:47,486 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:55:47,487 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:55:52,628 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 12:55:52,789 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 12:55:53,027 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-18 12:55:53,028 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-18 12:55:53,031 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-18 12:56:15,138 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-18 12:56:15,140 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-18 12:56:15,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:56:15,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:15,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:56:15,146 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:56:15,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:15,151 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-18 12:56:15,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:15,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652603084] [2019-12-18 12:56:15,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:15,404 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:56:15,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652603084] [2019-12-18 12:56:15,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:15,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:56:15,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449814759] [2019-12-18 12:56:15,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:56:15,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:15,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:56:15,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:56:15,442 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-18 12:56:18,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:18,334 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-18 12:56:18,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:56:18,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:56:18,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:18,984 INFO L225 Difference]: With dead ends: 121140 [2019-12-18 12:56:18,984 INFO L226 Difference]: Without dead ends: 107958 [2019-12-18 12:56:18,986 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:56:25,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-18 12:56:31,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-18 12:56:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-18 12:56:31,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-18 12:56:31,537 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-18 12:56:31,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:31,537 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-18 12:56:31,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:56:31,537 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-18 12:56:31,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:56:31,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:31,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:31,542 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:56:31,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:31,542 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-18 12:56:31,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:31,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297987317] [2019-12-18 12:56:31,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:31,633 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:56:31,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297987317] [2019-12-18 12:56:31,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:31,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:56:31,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658756681] [2019-12-18 12:56:31,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:56:31,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:31,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:56:31,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:56:31,638 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-18 12:56:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:37,617 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-18 12:56:37,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:56:37,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:56:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:38,399 INFO L225 Difference]: With dead ends: 172022 [2019-12-18 12:56:38,399 INFO L226 Difference]: Without dead ends: 171924 [2019-12-18 12:56:38,400 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:56:43,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-18 12:56:47,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-18 12:56:47,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-18 12:56:47,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-18 12:56:47,845 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-18 12:56:47,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:47,845 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-18 12:56:47,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:56:47,846 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-18 12:56:47,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:56:47,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:47,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:47,853 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:56:47,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:47,853 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-18 12:56:47,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:47,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225568967] [2019-12-18 12:56:47,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:47,917 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:56:47,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225568967] [2019-12-18 12:56:47,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:47,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:56:47,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357170019] [2019-12-18 12:56:47,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:56:47,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:47,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:56:47,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:56:47,920 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-18 12:56:48,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:48,064 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-18 12:56:48,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:56:48,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:56:48,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:48,132 INFO L225 Difference]: With dead ends: 33388 [2019-12-18 12:56:48,133 INFO L226 Difference]: Without dead ends: 33388 [2019-12-18 12:56:48,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:56:48,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-18 12:56:53,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-18 12:56:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-18 12:56:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-18 12:56:53,520 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-18 12:56:53,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:53,520 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-18 12:56:53,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:56:53,521 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-18 12:56:53,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:56:53,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:53,523 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:56:53,524 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:56:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:53,524 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-18 12:56:53,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:53,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582149335] [2019-12-18 12:56:53,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:53,592 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:56:53,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582149335] [2019-12-18 12:56:53,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:53,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:56:53,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527278824] [2019-12-18 12:56:53,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:56:53,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:53,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:56:53,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:56:53,595 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-18 12:56:53,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:53,814 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-18 12:56:53,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:56:53,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 12:56:53,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:53,899 INFO L225 Difference]: With dead ends: 52822 [2019-12-18 12:56:53,900 INFO L226 Difference]: Without dead ends: 52822 [2019-12-18 12:56:53,900 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:56:54,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-18 12:56:54,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-18 12:56:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-18 12:56:55,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-18 12:56:55,368 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-18 12:56:55,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:55,369 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-18 12:56:55,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:56:55,370 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-18 12:56:55,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:56:55,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:55,373 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:56:55,373 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:56:55,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:55,373 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-18 12:56:55,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:55,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57778935] [2019-12-18 12:56:55,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:55,444 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:56:55,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57778935] [2019-12-18 12:56:55,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:55,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:56:55,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095612931] [2019-12-18 12:56:55,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:56:55,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:55,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:56:55,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:56:55,446 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-18 12:56:55,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:55,802 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-18 12:56:55,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:56:55,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:56:55,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:55,873 INFO L225 Difference]: With dead ends: 46903 [2019-12-18 12:56:55,873 INFO L226 Difference]: Without dead ends: 46903 [2019-12-18 12:56:55,874 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:56:56,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-18 12:56:56,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-18 12:56:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-18 12:56:56,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-18 12:56:56,807 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-18 12:56:56,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:56,807 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-18 12:56:56,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:56:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-18 12:56:56,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:56:56,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:56,811 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:56:56,811 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:56:56,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:56,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-18 12:56:56,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:56,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350704384] [2019-12-18 12:56:56,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:56,882 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:56:56,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350704384] [2019-12-18 12:56:56,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:56,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:56:56,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453144466] [2019-12-18 12:56:56,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:56:56,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:56,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:56:56,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:56:56,884 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-18 12:56:57,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:57,250 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-18 12:56:57,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:56:57,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:56:57,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:57,329 INFO L225 Difference]: With dead ends: 51478 [2019-12-18 12:56:57,330 INFO L226 Difference]: Without dead ends: 51478 [2019-12-18 12:56:57,330 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:56:57,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-18 12:56:58,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-18 12:56:58,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-18 12:56:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-18 12:56:58,527 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-18 12:56:58,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:58,528 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-18 12:56:58,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:56:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-18 12:56:58,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:56:58,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:58,537 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:56:58,537 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:56:58,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:58,538 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-18 12:56:58,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:58,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14930368] [2019-12-18 12:56:58,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:58,607 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:56:58,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14930368] [2019-12-18 12:56:58,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:58,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:56:58,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874354553] [2019-12-18 12:56:58,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:56:58,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:58,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:56:58,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:56:58,610 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-18 12:56:59,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:59,268 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-18 12:56:59,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:56:59,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:56:59,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:59,369 INFO L225 Difference]: With dead ends: 61264 [2019-12-18 12:56:59,369 INFO L226 Difference]: Without dead ends: 61250 [2019-12-18 12:56:59,370 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:56:59,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-18 12:57:00,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-18 12:57:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-18 12:57:00,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-18 12:57:00,713 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-18 12:57:00,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:00,714 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-18 12:57:00,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:57:00,714 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-18 12:57:00,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:57:00,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:00,722 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:57:00,722 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:57:00,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:00,722 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-18 12:57:00,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:00,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898236726] [2019-12-18 12:57:00,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:00,805 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:57:00,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898236726] [2019-12-18 12:57:00,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:00,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:57:00,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942174481] [2019-12-18 12:57:00,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:57:00,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:00,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:57:00,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:00,807 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-18 12:57:01,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:01,402 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-18 12:57:01,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:57:01,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:57:01,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:01,513 INFO L225 Difference]: With dead ends: 63752 [2019-12-18 12:57:01,513 INFO L226 Difference]: Without dead ends: 63738 [2019-12-18 12:57:01,514 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:57:01,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-18 12:57:02,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-18 12:57:02,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-18 12:57:02,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-18 12:57:02,449 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-18 12:57:02,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:02,449 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-18 12:57:02,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:57:02,449 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-18 12:57:02,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:57:02,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:02,462 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] [2019-12-18 12:57:02,462 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:57:02,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:02,462 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-18 12:57:02,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:02,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111280054] [2019-12-18 12:57:02,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:02,530 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:57:02,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111280054] [2019-12-18 12:57:02,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:02,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:57:02,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253836515] [2019-12-18 12:57:02,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:57:02,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:02,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:57:02,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:57:02,533 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 4 states. [2019-12-18 12:57:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:02,622 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-18 12:57:02,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:57:02,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:57:02,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:02,654 INFO L225 Difference]: With dead ends: 17193 [2019-12-18 12:57:02,654 INFO L226 Difference]: Without dead ends: 17193 [2019-12-18 12:57:02,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:57:02,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-18 12:57:03,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-18 12:57:03,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-18 12:57:03,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-18 12:57:03,255 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-18 12:57:03,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:03,256 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-18 12:57:03,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:57:03,256 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-18 12:57:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 12:57:03,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:03,270 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] [2019-12-18 12:57:03,270 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:57:03,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:03,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-18 12:57:03,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:03,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356034593] [2019-12-18 12:57:03,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:03,335 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:57:03,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356034593] [2019-12-18 12:57:03,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:03,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:57:03,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337850935] [2019-12-18 12:57:03,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:57:03,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:03,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:57:03,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:03,338 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-18 12:57:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:03,673 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-18 12:57:03,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:57:03,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 12:57:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:03,705 INFO L225 Difference]: With dead ends: 21613 [2019-12-18 12:57:03,706 INFO L226 Difference]: Without dead ends: 21613 [2019-12-18 12:57:03,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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:57:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-18 12:57:03,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-18 12:57:03,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-18 12:57:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-18 12:57:04,033 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-18 12:57:04,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:04,034 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-18 12:57:04,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:57:04,034 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-18 12:57:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:57:04,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:04,050 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:57:04,050 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:57:04,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:04,050 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-18 12:57:04,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:04,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457879929] [2019-12-18 12:57:04,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:04,123 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:57:04,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457879929] [2019-12-18 12:57:04,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:04,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:57:04,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246233898] [2019-12-18 12:57:04,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:57:04,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:04,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:57:04,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:04,125 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-18 12:57:04,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:04,509 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-18 12:57:04,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:57:04,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 12:57:04,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:04,544 INFO L225 Difference]: With dead ends: 23624 [2019-12-18 12:57:04,544 INFO L226 Difference]: Without dead ends: 23624 [2019-12-18 12:57:04,545 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:57:04,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-18 12:57:04,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-18 12:57:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-18 12:57:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-18 12:57:04,883 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-18 12:57:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:04,883 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-18 12:57:04,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:57:04,883 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-18 12:57:04,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 12:57:04,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:04,904 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] [2019-12-18 12:57:04,904 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:57:04,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:04,905 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-18 12:57:04,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:04,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519149118] [2019-12-18 12:57:04,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:04,979 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:57:04,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519149118] [2019-12-18 12:57:04,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:04,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:57:04,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039557014] [2019-12-18 12:57:04,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:57:04,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:04,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:57:04,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:57:04,982 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 6 states. [2019-12-18 12:57:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:05,744 INFO L93 Difference]: Finished difference Result 27031 states and 80502 transitions. [2019-12-18 12:57:05,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:57:05,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 12:57:05,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:05,801 INFO L225 Difference]: With dead ends: 27031 [2019-12-18 12:57:05,802 INFO L226 Difference]: Without dead ends: 27031 [2019-12-18 12:57:05,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 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:57:05,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-18 12:57:06,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-18 12:57:06,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-18 12:57:06,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63071 transitions. [2019-12-18 12:57:06,401 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63071 transitions. Word has length 32 [2019-12-18 12:57:06,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:06,402 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63071 transitions. [2019-12-18 12:57:06,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:57:06,402 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63071 transitions. [2019-12-18 12:57:06,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:57:06,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:06,425 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:57:06,425 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:57:06,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:06,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-18 12:57:06,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:06,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451192400] [2019-12-18 12:57:06,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:06,502 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:57:06,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451192400] [2019-12-18 12:57:06,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:06,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:57:06,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020743123] [2019-12-18 12:57:06,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:57:06,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:06,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:57:06,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:57:06,505 INFO L87 Difference]: Start difference. First operand 20764 states and 63071 transitions. Second operand 6 states. [2019-12-18 12:57:07,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:07,192 INFO L93 Difference]: Finished difference Result 26334 states and 78684 transitions. [2019-12-18 12:57:07,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:57:07,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 12:57:07,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:07,234 INFO L225 Difference]: With dead ends: 26334 [2019-12-18 12:57:07,235 INFO L226 Difference]: Without dead ends: 26334 [2019-12-18 12:57:07,236 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:57:07,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26334 states. [2019-12-18 12:57:07,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26334 to 17642. [2019-12-18 12:57:07,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17642 states. [2019-12-18 12:57:07,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17642 states to 17642 states and 53957 transitions. [2019-12-18 12:57:07,578 INFO L78 Accepts]: Start accepts. Automaton has 17642 states and 53957 transitions. Word has length 34 [2019-12-18 12:57:07,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:07,579 INFO L462 AbstractCegarLoop]: Abstraction has 17642 states and 53957 transitions. [2019-12-18 12:57:07,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:57:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 17642 states and 53957 transitions. [2019-12-18 12:57:07,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:57:07,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:07,597 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] [2019-12-18 12:57:07,597 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:57:07,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:07,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-18 12:57:07,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:07,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119859224] [2019-12-18 12:57:07,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:07,652 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:57:07,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119859224] [2019-12-18 12:57:07,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:07,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:57:07,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16195264] [2019-12-18 12:57:07,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:57:07,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:07,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:57:07,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:07,654 INFO L87 Difference]: Start difference. First operand 17642 states and 53957 transitions. Second operand 3 states. [2019-12-18 12:57:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:07,727 INFO L93 Difference]: Finished difference Result 17641 states and 53955 transitions. [2019-12-18 12:57:07,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:57:07,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:57:07,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:07,760 INFO L225 Difference]: With dead ends: 17641 [2019-12-18 12:57:07,760 INFO L226 Difference]: Without dead ends: 17641 [2019-12-18 12:57:07,760 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:57:07,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17641 states. [2019-12-18 12:57:08,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17641 to 17641. [2019-12-18 12:57:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17641 states. [2019-12-18 12:57:08,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17641 states to 17641 states and 53955 transitions. [2019-12-18 12:57:08,037 INFO L78 Accepts]: Start accepts. Automaton has 17641 states and 53955 transitions. Word has length 39 [2019-12-18 12:57:08,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:08,037 INFO L462 AbstractCegarLoop]: Abstraction has 17641 states and 53955 transitions. [2019-12-18 12:57:08,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:57:08,037 INFO L276 IsEmpty]: Start isEmpty. Operand 17641 states and 53955 transitions. [2019-12-18 12:57:08,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:57:08,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:08,056 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] [2019-12-18 12:57:08,056 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:57:08,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:08,057 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-18 12:57:08,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:08,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144546889] [2019-12-18 12:57:08,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:08,153 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:57:08,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144546889] [2019-12-18 12:57:08,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:08,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:57:08,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816486761] [2019-12-18 12:57:08,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:57:08,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:08,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:57:08,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:08,155 INFO L87 Difference]: Start difference. First operand 17641 states and 53955 transitions. Second operand 5 states. [2019-12-18 12:57:08,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:08,748 INFO L93 Difference]: Finished difference Result 25346 states and 76639 transitions. [2019-12-18 12:57:08,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:57:08,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:57:08,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:08,795 INFO L225 Difference]: With dead ends: 25346 [2019-12-18 12:57:08,795 INFO L226 Difference]: Without dead ends: 25346 [2019-12-18 12:57:08,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:57:08,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2019-12-18 12:57:09,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 23560. [2019-12-18 12:57:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23560 states. [2019-12-18 12:57:09,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23560 states to 23560 states and 71751 transitions. [2019-12-18 12:57:09,149 INFO L78 Accepts]: Start accepts. Automaton has 23560 states and 71751 transitions. Word has length 40 [2019-12-18 12:57:09,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:09,149 INFO L462 AbstractCegarLoop]: Abstraction has 23560 states and 71751 transitions. [2019-12-18 12:57:09,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:57:09,149 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 71751 transitions. [2019-12-18 12:57:09,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:57:09,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:09,177 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] [2019-12-18 12:57:09,177 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:57:09,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:09,178 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-18 12:57:09,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:09,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187407578] [2019-12-18 12:57:09,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:09,234 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:57:09,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187407578] [2019-12-18 12:57:09,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:09,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:57:09,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053335343] [2019-12-18 12:57:09,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:57:09,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:09,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:57:09,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:09,236 INFO L87 Difference]: Start difference. First operand 23560 states and 71751 transitions. Second operand 5 states. [2019-12-18 12:57:09,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:09,585 INFO L93 Difference]: Finished difference Result 22175 states and 68518 transitions. [2019-12-18 12:57:09,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:57:09,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:57:09,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:09,624 INFO L225 Difference]: With dead ends: 22175 [2019-12-18 12:57:09,624 INFO L226 Difference]: Without dead ends: 22175 [2019-12-18 12:57:09,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:09,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22175 states. [2019-12-18 12:57:09,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22175 to 21251. [2019-12-18 12:57:09,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21251 states. [2019-12-18 12:57:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21251 states to 21251 states and 66025 transitions. [2019-12-18 12:57:09,939 INFO L78 Accepts]: Start accepts. Automaton has 21251 states and 66025 transitions. Word has length 40 [2019-12-18 12:57:09,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:09,939 INFO L462 AbstractCegarLoop]: Abstraction has 21251 states and 66025 transitions. [2019-12-18 12:57:09,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:57:09,939 INFO L276 IsEmpty]: Start isEmpty. Operand 21251 states and 66025 transitions. [2019-12-18 12:57:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:09,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:09,967 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] [2019-12-18 12:57:09,968 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:57:09,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:09,968 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-18 12:57:09,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:09,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449040403] [2019-12-18 12:57:09,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:10,066 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:57:10,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449040403] [2019-12-18 12:57:10,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:10,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:57:10,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149114913] [2019-12-18 12:57:10,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:57:10,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:10,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:57:10,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:57:10,069 INFO L87 Difference]: Start difference. First operand 21251 states and 66025 transitions. Second operand 7 states. [2019-12-18 12:57:10,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:10,712 INFO L93 Difference]: Finished difference Result 62478 states and 192933 transitions. [2019-12-18 12:57:10,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 12:57:10,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:57:10,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:10,799 INFO L225 Difference]: With dead ends: 62478 [2019-12-18 12:57:10,799 INFO L226 Difference]: Without dead ends: 47634 [2019-12-18 12:57:10,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:57:10,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47634 states. [2019-12-18 12:57:11,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47634 to 25007. [2019-12-18 12:57:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25007 states. [2019-12-18 12:57:11,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25007 states to 25007 states and 78146 transitions. [2019-12-18 12:57:11,366 INFO L78 Accepts]: Start accepts. Automaton has 25007 states and 78146 transitions. Word has length 63 [2019-12-18 12:57:11,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:11,366 INFO L462 AbstractCegarLoop]: Abstraction has 25007 states and 78146 transitions. [2019-12-18 12:57:11,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:57:11,366 INFO L276 IsEmpty]: Start isEmpty. Operand 25007 states and 78146 transitions. [2019-12-18 12:57:11,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:11,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:11,394 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] [2019-12-18 12:57:11,394 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:57:11,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:11,394 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-18 12:57:11,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:11,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236240883] [2019-12-18 12:57:11,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:11,490 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:57:11,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236240883] [2019-12-18 12:57:11,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:11,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:57:11,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875277505] [2019-12-18 12:57:11,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:57:11,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:11,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:57:11,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:57:11,497 INFO L87 Difference]: Start difference. First operand 25007 states and 78146 transitions. Second operand 7 states. [2019-12-18 12:57:12,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:12,026 INFO L93 Difference]: Finished difference Result 68433 states and 210070 transitions. [2019-12-18 12:57:12,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:57:12,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:57:12,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:12,094 INFO L225 Difference]: With dead ends: 68433 [2019-12-18 12:57:12,094 INFO L226 Difference]: Without dead ends: 48478 [2019-12-18 12:57:12,094 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:57:12,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48478 states. [2019-12-18 12:57:12,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48478 to 28798. [2019-12-18 12:57:12,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28798 states. [2019-12-18 12:57:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28798 states to 28798 states and 89643 transitions. [2019-12-18 12:57:13,043 INFO L78 Accepts]: Start accepts. Automaton has 28798 states and 89643 transitions. Word has length 63 [2019-12-18 12:57:13,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:13,044 INFO L462 AbstractCegarLoop]: Abstraction has 28798 states and 89643 transitions. [2019-12-18 12:57:13,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:57:13,044 INFO L276 IsEmpty]: Start isEmpty. Operand 28798 states and 89643 transitions. [2019-12-18 12:57:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:13,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:13,075 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] [2019-12-18 12:57:13,075 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:57:13,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:13,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-18 12:57:13,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:13,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47150071] [2019-12-18 12:57:13,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:13,154 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:57:13,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47150071] [2019-12-18 12:57:13,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:13,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:57:13,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741232509] [2019-12-18 12:57:13,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:57:13,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:13,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:57:13,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:57:13,156 INFO L87 Difference]: Start difference. First operand 28798 states and 89643 transitions. Second operand 7 states. [2019-12-18 12:57:13,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:13,671 INFO L93 Difference]: Finished difference Result 59843 states and 183697 transitions. [2019-12-18 12:57:13,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:57:13,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:57:13,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:13,749 INFO L225 Difference]: With dead ends: 59843 [2019-12-18 12:57:13,749 INFO L226 Difference]: Without dead ends: 52762 [2019-12-18 12:57:13,749 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:57:13,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52762 states. [2019-12-18 12:57:14,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52762 to 29106. [2019-12-18 12:57:14,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29106 states. [2019-12-18 12:57:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29106 states to 29106 states and 90594 transitions. [2019-12-18 12:57:14,371 INFO L78 Accepts]: Start accepts. Automaton has 29106 states and 90594 transitions. Word has length 63 [2019-12-18 12:57:14,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:14,371 INFO L462 AbstractCegarLoop]: Abstraction has 29106 states and 90594 transitions. [2019-12-18 12:57:14,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:57:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 29106 states and 90594 transitions. [2019-12-18 12:57:14,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:14,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:14,401 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] [2019-12-18 12:57:14,401 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:57:14,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:14,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-18 12:57:14,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:14,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073048339] [2019-12-18 12:57:14,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:14,457 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:57:14,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073048339] [2019-12-18 12:57:14,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:14,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:57:14,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066525059] [2019-12-18 12:57:14,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:57:14,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:14,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:57:14,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:14,459 INFO L87 Difference]: Start difference. First operand 29106 states and 90594 transitions. Second operand 3 states. [2019-12-18 12:57:14,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:14,626 INFO L93 Difference]: Finished difference Result 35624 states and 109784 transitions. [2019-12-18 12:57:14,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:57:14,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-18 12:57:14,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:14,673 INFO L225 Difference]: With dead ends: 35624 [2019-12-18 12:57:14,674 INFO L226 Difference]: Without dead ends: 35624 [2019-12-18 12:57:14,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:57:14,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35624 states. [2019-12-18 12:57:15,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35624 to 31022. [2019-12-18 12:57:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31022 states. [2019-12-18 12:57:15,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31022 states to 31022 states and 96384 transitions. [2019-12-18 12:57:15,515 INFO L78 Accepts]: Start accepts. Automaton has 31022 states and 96384 transitions. Word has length 63 [2019-12-18 12:57:15,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:15,515 INFO L462 AbstractCegarLoop]: Abstraction has 31022 states and 96384 transitions. [2019-12-18 12:57:15,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:57:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 31022 states and 96384 transitions. [2019-12-18 12:57:15,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:57:15,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:15,549 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] [2019-12-18 12:57:15,550 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:57:15,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:15,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1820548391, now seen corresponding path program 1 times [2019-12-18 12:57:15,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:15,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860387966] [2019-12-18 12:57:15,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:15,749 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:57:15,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860387966] [2019-12-18 12:57:15,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:15,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 12:57:15,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462927613] [2019-12-18 12:57:15,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:57:15,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:15,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:57:15,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:57:15,752 INFO L87 Difference]: Start difference. First operand 31022 states and 96384 transitions. Second operand 11 states. [2019-12-18 12:57:19,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:19,774 INFO L93 Difference]: Finished difference Result 59312 states and 180291 transitions. [2019-12-18 12:57:19,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 12:57:19,774 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-18 12:57:19,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:19,865 INFO L225 Difference]: With dead ends: 59312 [2019-12-18 12:57:19,866 INFO L226 Difference]: Without dead ends: 58925 [2019-12-18 12:57:19,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=301, Invalid=1505, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 12:57:20,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58925 states. [2019-12-18 12:57:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58925 to 36682. [2019-12-18 12:57:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36682 states. [2019-12-18 12:57:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36682 states to 36682 states and 113249 transitions. [2019-12-18 12:57:20,653 INFO L78 Accepts]: Start accepts. Automaton has 36682 states and 113249 transitions. Word has length 64 [2019-12-18 12:57:20,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:20,653 INFO L462 AbstractCegarLoop]: Abstraction has 36682 states and 113249 transitions. [2019-12-18 12:57:20,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:57:20,653 INFO L276 IsEmpty]: Start isEmpty. Operand 36682 states and 113249 transitions. [2019-12-18 12:57:20,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:57:20,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:20,699 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] [2019-12-18 12:57:20,699 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:57:20,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:20,699 INFO L82 PathProgramCache]: Analyzing trace with hash -772692697, now seen corresponding path program 2 times [2019-12-18 12:57:20,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:20,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982560087] [2019-12-18 12:57:20,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:21,223 WARN L192 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-18 12:57:21,379 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:57:21,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982560087] [2019-12-18 12:57:21,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:21,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:57:21,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369263210] [2019-12-18 12:57:21,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:57:21,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:21,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:57:21,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:57:21,386 INFO L87 Difference]: Start difference. First operand 36682 states and 113249 transitions. Second operand 10 states. [2019-12-18 12:57:23,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:23,369 INFO L93 Difference]: Finished difference Result 58108 states and 177520 transitions. [2019-12-18 12:57:23,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:57:23,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-18 12:57:23,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:23,454 INFO L225 Difference]: With dead ends: 58108 [2019-12-18 12:57:23,454 INFO L226 Difference]: Without dead ends: 57888 [2019-12-18 12:57:23,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:57:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57888 states. [2019-12-18 12:57:24,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57888 to 43232. [2019-12-18 12:57:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43232 states. [2019-12-18 12:57:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43232 states to 43232 states and 133417 transitions. [2019-12-18 12:57:24,324 INFO L78 Accepts]: Start accepts. Automaton has 43232 states and 133417 transitions. Word has length 64 [2019-12-18 12:57:24,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:24,324 INFO L462 AbstractCegarLoop]: Abstraction has 43232 states and 133417 transitions. [2019-12-18 12:57:24,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:57:24,324 INFO L276 IsEmpty]: Start isEmpty. Operand 43232 states and 133417 transitions. [2019-12-18 12:57:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:57:24,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:24,377 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] [2019-12-18 12:57:24,377 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:57:24,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:24,377 INFO L82 PathProgramCache]: Analyzing trace with hash 98843029, now seen corresponding path program 3 times [2019-12-18 12:57:24,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:24,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158052633] [2019-12-18 12:57:24,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:24,635 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:57:24,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158052633] [2019-12-18 12:57:24,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:24,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 12:57:24,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751699321] [2019-12-18 12:57:24,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:57:24,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:24,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:57:24,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:57:24,640 INFO L87 Difference]: Start difference. First operand 43232 states and 133417 transitions. Second operand 11 states. [2019-12-18 12:57:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:27,102 INFO L93 Difference]: Finished difference Result 63181 states and 191919 transitions. [2019-12-18 12:57:27,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 12:57:27,102 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-18 12:57:27,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:27,609 INFO L225 Difference]: With dead ends: 63181 [2019-12-18 12:57:27,609 INFO L226 Difference]: Without dead ends: 62929 [2019-12-18 12:57:27,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2019-12-18 12:57:27,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62929 states. [2019-12-18 12:57:28,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62929 to 42799. [2019-12-18 12:57:28,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42799 states. [2019-12-18 12:57:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42799 states to 42799 states and 132114 transitions. [2019-12-18 12:57:28,359 INFO L78 Accepts]: Start accepts. Automaton has 42799 states and 132114 transitions. Word has length 64 [2019-12-18 12:57:28,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:28,359 INFO L462 AbstractCegarLoop]: Abstraction has 42799 states and 132114 transitions. [2019-12-18 12:57:28,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:57:28,360 INFO L276 IsEmpty]: Start isEmpty. Operand 42799 states and 132114 transitions. [2019-12-18 12:57:28,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:57:28,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:28,407 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] [2019-12-18 12:57:28,407 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:57:28,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:28,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1550075121, now seen corresponding path program 4 times [2019-12-18 12:57:28,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:28,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032964251] [2019-12-18 12:57:28,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:28,482 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:57:28,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032964251] [2019-12-18 12:57:28,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:28,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:57:28,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412083130] [2019-12-18 12:57:28,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:57:28,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:28,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:57:28,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:28,484 INFO L87 Difference]: Start difference. First operand 42799 states and 132114 transitions. Second operand 3 states. [2019-12-18 12:57:28,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:28,597 INFO L93 Difference]: Finished difference Result 32991 states and 100832 transitions. [2019-12-18 12:57:28,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:57:28,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:57:28,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:28,639 INFO L225 Difference]: With dead ends: 32991 [2019-12-18 12:57:28,640 INFO L226 Difference]: Without dead ends: 32991 [2019-12-18 12:57:28,640 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:57:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32991 states. [2019-12-18 12:57:29,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32991 to 31051. [2019-12-18 12:57:29,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31051 states. [2019-12-18 12:57:29,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31051 states to 31051 states and 94720 transitions. [2019-12-18 12:57:29,102 INFO L78 Accepts]: Start accepts. Automaton has 31051 states and 94720 transitions. Word has length 64 [2019-12-18 12:57:29,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:29,102 INFO L462 AbstractCegarLoop]: Abstraction has 31051 states and 94720 transitions. [2019-12-18 12:57:29,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:57:29,102 INFO L276 IsEmpty]: Start isEmpty. Operand 31051 states and 94720 transitions. [2019-12-18 12:57:29,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:57:29,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:29,135 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:57:29,135 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:57:29,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:29,135 INFO L82 PathProgramCache]: Analyzing trace with hash -625357365, now seen corresponding path program 1 times [2019-12-18 12:57:29,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:29,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150808685] [2019-12-18 12:57:29,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:29,231 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:57:29,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150808685] [2019-12-18 12:57:29,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:29,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:57:29,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986458254] [2019-12-18 12:57:29,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:57:29,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:29,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:57:29,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:57:29,233 INFO L87 Difference]: Start difference. First operand 31051 states and 94720 transitions. Second operand 8 states. [2019-12-18 12:57:31,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:31,275 INFO L93 Difference]: Finished difference Result 44493 states and 133657 transitions. [2019-12-18 12:57:31,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 12:57:31,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 12:57:31,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:31,667 INFO L225 Difference]: With dead ends: 44493 [2019-12-18 12:57:31,667 INFO L226 Difference]: Without dead ends: 44493 [2019-12-18 12:57:31,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 12:57:31,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44493 states. [2019-12-18 12:57:32,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44493 to 31970. [2019-12-18 12:57:32,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31970 states. [2019-12-18 12:57:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31970 states to 31970 states and 97551 transitions. [2019-12-18 12:57:32,214 INFO L78 Accepts]: Start accepts. Automaton has 31970 states and 97551 transitions. Word has length 65 [2019-12-18 12:57:32,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:32,214 INFO L462 AbstractCegarLoop]: Abstraction has 31970 states and 97551 transitions. [2019-12-18 12:57:32,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:57:32,214 INFO L276 IsEmpty]: Start isEmpty. Operand 31970 states and 97551 transitions. [2019-12-18 12:57:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:57:32,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:32,255 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:57:32,255 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:57:32,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:32,255 INFO L82 PathProgramCache]: Analyzing trace with hash 946511855, now seen corresponding path program 2 times [2019-12-18 12:57:32,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:32,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122808790] [2019-12-18 12:57:32,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:32,507 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:57:32,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122808790] [2019-12-18 12:57:32,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:32,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:57:32,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057516267] [2019-12-18 12:57:32,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:57:32,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:32,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:57:32,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:57:32,510 INFO L87 Difference]: Start difference. First operand 31970 states and 97551 transitions. Second operand 10 states. [2019-12-18 12:57:33,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:33,748 INFO L93 Difference]: Finished difference Result 45537 states and 138337 transitions. [2019-12-18 12:57:33,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:57:33,748 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-18 12:57:33,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:33,797 INFO L225 Difference]: With dead ends: 45537 [2019-12-18 12:57:33,797 INFO L226 Difference]: Without dead ends: 36312 [2019-12-18 12:57:33,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:57:33,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36312 states. [2019-12-18 12:57:34,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36312 to 32394. [2019-12-18 12:57:34,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32394 states. [2019-12-18 12:57:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32394 states to 32394 states and 98668 transitions. [2019-12-18 12:57:34,299 INFO L78 Accepts]: Start accepts. Automaton has 32394 states and 98668 transitions. Word has length 65 [2019-12-18 12:57:34,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:34,299 INFO L462 AbstractCegarLoop]: Abstraction has 32394 states and 98668 transitions. [2019-12-18 12:57:34,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:57:34,299 INFO L276 IsEmpty]: Start isEmpty. Operand 32394 states and 98668 transitions. [2019-12-18 12:57:34,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:57:34,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:34,333 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:57:34,333 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:34,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:34,333 INFO L82 PathProgramCache]: Analyzing trace with hash 459691905, now seen corresponding path program 3 times [2019-12-18 12:57:34,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:34,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704177186] [2019-12-18 12:57:34,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:34,540 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:57:34,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704177186] [2019-12-18 12:57:34,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:34,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:57:34,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657255478] [2019-12-18 12:57:34,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:57:34,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:34,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:57:34,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:57:34,542 INFO L87 Difference]: Start difference. First operand 32394 states and 98668 transitions. Second operand 11 states. [2019-12-18 12:57:35,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:35,938 INFO L93 Difference]: Finished difference Result 46332 states and 139358 transitions. [2019-12-18 12:57:35,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:57:35,939 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 12:57:35,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:35,993 INFO L225 Difference]: With dead ends: 46332 [2019-12-18 12:57:35,994 INFO L226 Difference]: Without dead ends: 39314 [2019-12-18 12:57:35,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:57:36,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39314 states. [2019-12-18 12:57:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39314 to 32631. [2019-12-18 12:57:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32631 states. [2019-12-18 12:57:36,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32631 states to 32631 states and 99015 transitions. [2019-12-18 12:57:36,903 INFO L78 Accepts]: Start accepts. Automaton has 32631 states and 99015 transitions. Word has length 65 [2019-12-18 12:57:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:36,903 INFO L462 AbstractCegarLoop]: Abstraction has 32631 states and 99015 transitions. [2019-12-18 12:57:36,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:57:36,904 INFO L276 IsEmpty]: Start isEmpty. Operand 32631 states and 99015 transitions. [2019-12-18 12:57:36,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:57:36,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:36,945 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:57:36,945 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:36,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:36,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1007435361, now seen corresponding path program 4 times [2019-12-18 12:57:36,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:36,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27850475] [2019-12-18 12:57:36,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:37,120 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:57:37,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27850475] [2019-12-18 12:57:37,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:37,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:57:37,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921149781] [2019-12-18 12:57:37,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:57:37,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:37,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:57:37,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:57:37,122 INFO L87 Difference]: Start difference. First operand 32631 states and 99015 transitions. Second operand 11 states. [2019-12-18 12:57:38,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:38,494 INFO L93 Difference]: Finished difference Result 72715 states and 220843 transitions. [2019-12-18 12:57:38,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 12:57:38,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 12:57:38,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:38,608 INFO L225 Difference]: With dead ends: 72715 [2019-12-18 12:57:38,608 INFO L226 Difference]: Without dead ends: 67449 [2019-12-18 12:57:38,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 12:57:38,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67449 states. [2019-12-18 12:57:39,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67449 to 37021. [2019-12-18 12:57:39,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37021 states. [2019-12-18 12:57:39,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37021 states to 37021 states and 112078 transitions. [2019-12-18 12:57:39,447 INFO L78 Accepts]: Start accepts. Automaton has 37021 states and 112078 transitions. Word has length 65 [2019-12-18 12:57:39,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:39,447 INFO L462 AbstractCegarLoop]: Abstraction has 37021 states and 112078 transitions. [2019-12-18 12:57:39,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:57:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 37021 states and 112078 transitions. [2019-12-18 12:57:39,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:57:39,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:39,490 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:57:39,490 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:39,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:39,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1275313811, now seen corresponding path program 5 times [2019-12-18 12:57:39,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:39,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309931345] [2019-12-18 12:57:39,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:39,933 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:57:39,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309931345] [2019-12-18 12:57:39,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:39,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 12:57:39,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640061696] [2019-12-18 12:57:39,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 12:57:39,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:39,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 12:57:39,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:57:39,936 INFO L87 Difference]: Start difference. First operand 37021 states and 112078 transitions. Second operand 19 states. [2019-12-18 12:57:47,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:47,910 INFO L93 Difference]: Finished difference Result 50267 states and 150918 transitions. [2019-12-18 12:57:47,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-12-18 12:57:47,911 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2019-12-18 12:57:47,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:47,979 INFO L225 Difference]: With dead ends: 50267 [2019-12-18 12:57:47,979 INFO L226 Difference]: Without dead ends: 50213 [2019-12-18 12:57:47,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1948 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=730, Invalid=5750, Unknown=0, NotChecked=0, Total=6480 [2019-12-18 12:57:48,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50213 states. [2019-12-18 12:57:48,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50213 to 37325. [2019-12-18 12:57:48,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37325 states. [2019-12-18 12:57:48,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37325 states to 37325 states and 113065 transitions. [2019-12-18 12:57:48,646 INFO L78 Accepts]: Start accepts. Automaton has 37325 states and 113065 transitions. Word has length 65 [2019-12-18 12:57:48,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:48,647 INFO L462 AbstractCegarLoop]: Abstraction has 37325 states and 113065 transitions. [2019-12-18 12:57:48,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 12:57:48,647 INFO L276 IsEmpty]: Start isEmpty. Operand 37325 states and 113065 transitions. [2019-12-18 12:57:48,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:57:48,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:48,686 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:57:48,686 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:48,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:48,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1126220307, now seen corresponding path program 6 times [2019-12-18 12:57:48,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:48,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766848665] [2019-12-18 12:57:48,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:48,868 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:57:48,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766848665] [2019-12-18 12:57:48,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:48,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:57:48,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183504314] [2019-12-18 12:57:48,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:57:48,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:48,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:57:48,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:57:48,870 INFO L87 Difference]: Start difference. First operand 37325 states and 113065 transitions. Second operand 11 states. [2019-12-18 12:57:49,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:49,966 INFO L93 Difference]: Finished difference Result 68295 states and 205842 transitions. [2019-12-18 12:57:49,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:57:49,966 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 12:57:49,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:50,045 INFO L225 Difference]: With dead ends: 68295 [2019-12-18 12:57:50,046 INFO L226 Difference]: Without dead ends: 57686 [2019-12-18 12:57:50,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:57:50,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57686 states. [2019-12-18 12:57:50,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57686 to 31391. [2019-12-18 12:57:50,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31391 states. [2019-12-18 12:57:51,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31391 states to 31391 states and 95118 transitions. [2019-12-18 12:57:51,020 INFO L78 Accepts]: Start accepts. Automaton has 31391 states and 95118 transitions. Word has length 65 [2019-12-18 12:57:51,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:51,020 INFO L462 AbstractCegarLoop]: Abstraction has 31391 states and 95118 transitions. [2019-12-18 12:57:51,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:57:51,020 INFO L276 IsEmpty]: Start isEmpty. Operand 31391 states and 95118 transitions. [2019-12-18 12:57:51,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:57:51,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:51,054 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:57:51,054 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:51,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:51,054 INFO L82 PathProgramCache]: Analyzing trace with hash 720302319, now seen corresponding path program 7 times [2019-12-18 12:57:51,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:51,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947201996] [2019-12-18 12:57:51,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:51,213 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:57:51,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947201996] [2019-12-18 12:57:51,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:51,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:57:51,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739018901] [2019-12-18 12:57:51,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:57:51,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:51,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:57:51,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:57:51,215 INFO L87 Difference]: Start difference. First operand 31391 states and 95118 transitions. Second operand 11 states. [2019-12-18 12:57:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:52,404 INFO L93 Difference]: Finished difference Result 34500 states and 103592 transitions. [2019-12-18 12:57:52,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 12:57:52,404 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 12:57:52,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:52,451 INFO L225 Difference]: With dead ends: 34500 [2019-12-18 12:57:52,452 INFO L226 Difference]: Without dead ends: 33496 [2019-12-18 12:57:52,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:57:52,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33496 states. [2019-12-18 12:57:52,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33496 to 30991. [2019-12-18 12:57:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30991 states. [2019-12-18 12:57:52,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30991 states to 30991 states and 93967 transitions. [2019-12-18 12:57:52,939 INFO L78 Accepts]: Start accepts. Automaton has 30991 states and 93967 transitions. Word has length 65 [2019-12-18 12:57:52,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:52,939 INFO L462 AbstractCegarLoop]: Abstraction has 30991 states and 93967 transitions. [2019-12-18 12:57:52,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:57:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 30991 states and 93967 transitions. [2019-12-18 12:57:52,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:57:52,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:52,971 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:57:52,971 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:52,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:52,972 INFO L82 PathProgramCache]: Analyzing trace with hash 491693849, now seen corresponding path program 8 times [2019-12-18 12:57:52,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:52,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831073374] [2019-12-18 12:57:52,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:53,023 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:57:53,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831073374] [2019-12-18 12:57:53,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:53,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:57:53,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888009456] [2019-12-18 12:57:53,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:57:53,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:53,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:57:53,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:53,025 INFO L87 Difference]: Start difference. First operand 30991 states and 93967 transitions. Second operand 3 states. [2019-12-18 12:57:53,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:53,159 INFO L93 Difference]: Finished difference Result 30990 states and 93965 transitions. [2019-12-18 12:57:53,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:57:53,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:57:53,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:53,209 INFO L225 Difference]: With dead ends: 30990 [2019-12-18 12:57:53,209 INFO L226 Difference]: Without dead ends: 30990 [2019-12-18 12:57:53,209 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:57:53,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30990 states. [2019-12-18 12:57:53,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30990 to 23130. [2019-12-18 12:57:53,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23130 states. [2019-12-18 12:57:53,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23130 states to 23130 states and 70864 transitions. [2019-12-18 12:57:53,660 INFO L78 Accepts]: Start accepts. Automaton has 23130 states and 70864 transitions. Word has length 65 [2019-12-18 12:57:53,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:53,661 INFO L462 AbstractCegarLoop]: Abstraction has 23130 states and 70864 transitions. [2019-12-18 12:57:53,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:57:53,661 INFO L276 IsEmpty]: Start isEmpty. Operand 23130 states and 70864 transitions. [2019-12-18 12:57:53,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:57:53,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:53,690 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, 1] [2019-12-18 12:57:53,691 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:53,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:53,691 INFO L82 PathProgramCache]: Analyzing trace with hash -952881413, now seen corresponding path program 1 times [2019-12-18 12:57:53,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:53,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450466323] [2019-12-18 12:57:53,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:53,860 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:57:53,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450466323] [2019-12-18 12:57:53,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:53,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:57:53,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107230439] [2019-12-18 12:57:53,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:57:53,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:53,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:57:53,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:57:53,862 INFO L87 Difference]: Start difference. First operand 23130 states and 70864 transitions. Second operand 12 states. [2019-12-18 12:57:55,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:55,243 INFO L93 Difference]: Finished difference Result 39325 states and 120628 transitions. [2019-12-18 12:57:55,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:57:55,244 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 12:57:55,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:55,299 INFO L225 Difference]: With dead ends: 39325 [2019-12-18 12:57:55,300 INFO L226 Difference]: Without dead ends: 38850 [2019-12-18 12:57:55,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:57:55,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38850 states. [2019-12-18 12:57:55,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38850 to 22862. [2019-12-18 12:57:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22862 states. [2019-12-18 12:57:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22862 states to 22862 states and 70176 transitions. [2019-12-18 12:57:55,782 INFO L78 Accepts]: Start accepts. Automaton has 22862 states and 70176 transitions. Word has length 66 [2019-12-18 12:57:55,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:55,782 INFO L462 AbstractCegarLoop]: Abstraction has 22862 states and 70176 transitions. [2019-12-18 12:57:55,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:57:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 22862 states and 70176 transitions. [2019-12-18 12:57:55,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:57:55,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:55,808 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, 1] [2019-12-18 12:57:55,808 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:55,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:55,808 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 2 times [2019-12-18 12:57:55,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:55,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551892813] [2019-12-18 12:57:55,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:57:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:57:55,920 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:57:55,920 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:57:55,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t663~0.base_22| 4)) (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_380 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t663~0.base_22|)) (= v_~z$r_buff0_thd2~0_184 0) (= v_~__unbuffered_cnt~0_128 0) (= v_~y~0_48 0) (= v_~z$mem_tmp~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$r_buff1_thd0~0_296 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= v_~z$w_buff1_used~0_500 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t663~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t663~0.base_22|) |v_ULTIMATE.start_main_~#t663~0.offset_16| 0)) |v_#memory_int_19|) (= v_~z$r_buff0_thd0~0_197 0) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_43) (= 0 v_~__unbuffered_p0_EAX~0_233) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t663~0.base_22|) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff1_thd3~0_396) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_37) (= |v_ULTIMATE.start_main_~#t663~0.offset_16| 0) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff0_thd3~0_379) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= 0 v_~x~0_133) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t663~0.base_22| 1)) (= v_~z~0_182 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t665~0.base=|v_ULTIMATE.start_main_~#t665~0.base_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, ULTIMATE.start_main_~#t665~0.offset=|v_ULTIMATE.start_main_~#t665~0.offset_14|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_37, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ULTIMATE.start_main_~#t663~0.base=|v_ULTIMATE.start_main_~#t663~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ULTIMATE.start_main_~#t664~0.base=|v_ULTIMATE.start_main_~#t664~0.base_19|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_379, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ~x~0=v_~x~0_133, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_296, ULTIMATE.start_main_~#t664~0.offset=|v_ULTIMATE.start_main_~#t664~0.offset_14|, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_184, ULTIMATE.start_main_~#t663~0.offset=|v_ULTIMATE.start_main_~#t663~0.offset_16|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_380} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t665~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t665~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t663~0.base, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ULTIMATE.start_main_~#t664~0.base, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t664~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t663~0.offset, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:57:55,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23) (= v_~x~0_9 v_~__unbuffered_p0_EAX~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:57:55,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t664~0.base_11|) (= |v_ULTIMATE.start_main_~#t664~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t664~0.base_11| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t664~0.base_11| 4)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t664~0.base_11|) 0) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t664~0.base_11| 1) |v_#valid_31|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t664~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t664~0.base_11|) |v_ULTIMATE.start_main_~#t664~0.offset_10| 1)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t664~0.base=|v_ULTIMATE.start_main_~#t664~0.base_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t664~0.offset=|v_ULTIMATE.start_main_~#t664~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t664~0.base, #length, ULTIMATE.start_main_~#t664~0.offset] because there is no mapped edge [2019-12-18 12:57:55,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t665~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t665~0.base_12|) |v_ULTIMATE.start_main_~#t665~0.offset_10| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t665~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t665~0.offset_10|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t665~0.base_12| 1)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t665~0.base_12|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t665~0.base_12|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t665~0.base_12| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t665~0.base=|v_ULTIMATE.start_main_~#t665~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t665~0.offset=|v_ULTIMATE.start_main_~#t665~0.offset_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t665~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t665~0.offset, #length] because there is no mapped edge [2019-12-18 12:57:55,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1402876772 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1402876772 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite10_Out1402876772| |P1Thread1of1ForFork2_#t~ite9_Out1402876772|))) (or (and (= ~z~0_In1402876772 |P1Thread1of1ForFork2_#t~ite9_Out1402876772|) (or .cse0 .cse1) .cse2) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out1402876772| ~z$w_buff1~0_In1402876772) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1402876772, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1402876772, ~z$w_buff1~0=~z$w_buff1~0_In1402876772, ~z~0=~z~0_In1402876772} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1402876772|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1402876772, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1402876772|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1402876772, ~z$w_buff1~0=~z$w_buff1~0_In1402876772, ~z~0=~z~0_In1402876772} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:57:55,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1299842775 256)))) (or (and .cse0 (= ~z$w_buff1~0_In1299842775 |P2Thread1of1ForFork0_#t~ite23_Out1299842775|) (= |P2Thread1of1ForFork0_#t~ite24_Out1299842775| |P2Thread1of1ForFork0_#t~ite23_Out1299842775|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1299842775 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1299842775 256) 0)) (and (= (mod ~z$w_buff1_used~0_In1299842775 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In1299842775 256) 0)))) (and (= |P2Thread1of1ForFork0_#t~ite24_Out1299842775| ~z$w_buff1~0_In1299842775) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In1299842775| |P2Thread1of1ForFork0_#t~ite23_Out1299842775|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1299842775, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1299842775, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1299842775|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1299842775, ~z$w_buff1~0=~z$w_buff1~0_In1299842775, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1299842775, ~weak$$choice2~0=~weak$$choice2~0_In1299842775} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1299842775, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1299842775|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1299842775, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1299842775|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1299842775, ~z$w_buff1~0=~z$w_buff1~0_In1299842775, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1299842775, ~weak$$choice2~0=~weak$$choice2~0_In1299842775} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 12:57:55,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1696680686 256))) (.cse5 (= 0 (mod ~z$w_buff0_used~0_In-1696680686 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1696680686 256))) (.cse6 (= (mod ~z$r_buff0_thd3~0_In-1696680686 256) 0)) (.cse4 (= |P2Thread1of1ForFork0_#t~ite29_Out-1696680686| |P2Thread1of1ForFork0_#t~ite30_Out-1696680686|)) (.cse3 (= (mod ~weak$$choice2~0_In-1696680686 256) 0))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-1696680686| 0) (or (not .cse2) .cse1) (= |P2Thread1of1ForFork0_#t~ite29_Out-1696680686| |P2Thread1of1ForFork0_#t~ite28_Out-1696680686|) .cse3 .cse4 (not .cse5))) (and (= |P2Thread1of1ForFork0_#t~ite28_In-1696680686| |P2Thread1of1ForFork0_#t~ite28_Out-1696680686|) (or (and (not .cse3) (= |P2Thread1of1ForFork0_#t~ite30_Out-1696680686| ~z$w_buff1_used~0_In-1696680686) (= |P2Thread1of1ForFork0_#t~ite29_Out-1696680686| |P2Thread1of1ForFork0_#t~ite29_In-1696680686|)) (and (or (and .cse6 .cse0) .cse5 (and .cse2 .cse6)) (= |P2Thread1of1ForFork0_#t~ite29_Out-1696680686| ~z$w_buff1_used~0_In-1696680686) .cse4 .cse3))))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In-1696680686|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1696680686, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1696680686, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1696680686, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1696680686, ~weak$$choice2~0=~weak$$choice2~0_In-1696680686, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1696680686|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1696680686|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1696680686, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1696680686, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1696680686, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1696680686, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1696680686|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1696680686|, ~weak$$choice2~0=~weak$$choice2~0_In-1696680686} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:57:55,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0)) (= v_~z$r_buff0_thd3~0_373 v_~z$r_buff0_thd3~0_372)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_373, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_372, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:57:55,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 12:57:55,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-222646292 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-222646292 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out-222646292| |P2Thread1of1ForFork0_#t~ite39_Out-222646292|))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-222646292| ~z$w_buff1~0_In-222646292) (not .cse0) (not .cse1) .cse2) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-222646292| ~z~0_In-222646292) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-222646292, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-222646292, ~z$w_buff1~0=~z$w_buff1~0_In-222646292, ~z~0=~z~0_In-222646292} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-222646292|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-222646292|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-222646292, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-222646292, ~z$w_buff1~0=~z$w_buff1~0_In-222646292, ~z~0=~z~0_In-222646292} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:57:55,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In221946809 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In221946809 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out221946809| ~z$w_buff0_used~0_In221946809) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out221946809| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In221946809, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In221946809} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In221946809, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out221946809|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In221946809} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:57:55,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-832657926 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-832657926 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-832657926 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-832657926 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-832657926|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-832657926 |P2Thread1of1ForFork0_#t~ite41_Out-832657926|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-832657926, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-832657926, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-832657926, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-832657926} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-832657926, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-832657926, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-832657926, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-832657926, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-832657926|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:57:55,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-916517680 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-916517680 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-916517680|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-916517680| ~z$r_buff0_thd3~0_In-916517680)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-916517680, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-916517680} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-916517680, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-916517680, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-916517680|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:57:55,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-2057155690 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-2057155690 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-2057155690 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-2057155690 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In-2057155690 |P2Thread1of1ForFork0_#t~ite43_Out-2057155690|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork0_#t~ite43_Out-2057155690| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2057155690, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2057155690, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2057155690, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2057155690} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-2057155690|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2057155690, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2057155690, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2057155690, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2057155690} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:57:55,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= v_~z$r_buff1_thd3~0_306 |v_P2Thread1of1ForFork0_#t~ite43_56|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:57:55,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1151939890 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1151939890 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-1151939890| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-1151939890| ~z$w_buff0_used~0_In-1151939890)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1151939890, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1151939890} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1151939890|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1151939890, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1151939890} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:57:55,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1694945734 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1694945734 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1694945734 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-1694945734 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out-1694945734| ~z$w_buff1_used~0_In-1694945734) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite6_Out-1694945734| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1694945734, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1694945734, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1694945734, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1694945734} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1694945734, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1694945734|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1694945734, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1694945734, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1694945734} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:57:55,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1880098780 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1880098780 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-1880098780) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In-1880098780 ~z$r_buff0_thd1~0_Out-1880098780)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1880098780, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1880098780} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1880098780, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1880098780|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1880098780} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:57:55,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1895892577 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1895892577 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-1895892577 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1895892577 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1895892577| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1895892577| ~z$r_buff1_thd1~0_In-1895892577) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1895892577, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1895892577, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1895892577, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1895892577} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1895892577|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1895892577, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1895892577, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1895892577, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1895892577} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:57:55,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:57:55,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1750799436 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1750799436 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1750799436|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1750799436| ~z$w_buff0_used~0_In1750799436)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1750799436, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1750799436} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1750799436, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1750799436|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1750799436} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:57:55,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In-793355286 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-793355286 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-793355286 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-793355286 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-793355286 |P1Thread1of1ForFork2_#t~ite12_Out-793355286|)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-793355286| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-793355286, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-793355286, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-793355286, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-793355286} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-793355286, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-793355286, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-793355286, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-793355286|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-793355286} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:57:55,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In437405289 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In437405289 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out437405289|) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In437405289 |P1Thread1of1ForFork2_#t~ite13_Out437405289|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In437405289, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In437405289} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In437405289, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out437405289|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In437405289} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:57:55,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In943335717 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In943335717 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In943335717 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In943335717 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out943335717| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out943335717| ~z$r_buff1_thd2~0_In943335717) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In943335717, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In943335717, ~z$w_buff1_used~0=~z$w_buff1_used~0_In943335717, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In943335717} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In943335717, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In943335717, ~z$w_buff1_used~0=~z$w_buff1_used~0_In943335717, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out943335717|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In943335717} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:57:55,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_186, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:57:55,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:57:55,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-54969468 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-54969468 256)))) (or (and (= ~z~0_In-54969468 |ULTIMATE.start_main_#t~ite47_Out-54969468|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In-54969468 |ULTIMATE.start_main_#t~ite47_Out-54969468|) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-54969468, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-54969468, ~z$w_buff1~0=~z$w_buff1~0_In-54969468, ~z~0=~z~0_In-54969468} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-54969468, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-54969468|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-54969468, ~z$w_buff1~0=~z$w_buff1~0_In-54969468, ~z~0=~z~0_In-54969468} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:57:55,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-18 12:57:55,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In577010673 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In577010673 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In577010673 |ULTIMATE.start_main_#t~ite49_Out577010673|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out577010673|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In577010673, ~z$w_buff0_used~0=~z$w_buff0_used~0_In577010673} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In577010673, ~z$w_buff0_used~0=~z$w_buff0_used~0_In577010673, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out577010673|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:57:55,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-2033851894 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2033851894 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-2033851894 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-2033851894 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-2033851894 |ULTIMATE.start_main_#t~ite50_Out-2033851894|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out-2033851894| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2033851894, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2033851894, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2033851894, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2033851894} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-2033851894|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2033851894, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2033851894, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2033851894, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2033851894} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:57:55,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1885600430 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1885600430 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1885600430 |ULTIMATE.start_main_#t~ite51_Out-1885600430|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-1885600430| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1885600430, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1885600430} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1885600430, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1885600430|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1885600430} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:57:55,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1960359188 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1960359188 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1960359188 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1960359188 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1960359188| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out-1960359188| ~z$r_buff1_thd0~0_In-1960359188) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1960359188, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1960359188, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1960359188, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1960359188} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1960359188|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1960359188, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1960359188, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1960359188, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1960359188} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:57:55,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_25 2) (= 2 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~z$r_buff1_thd0~0_219 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 0 v_~__unbuffered_p0_EAX~0_178)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_219, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:57:56,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:57:56 BasicIcfg [2019-12-18 12:57:56,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:57:56,050 INFO L168 Benchmark]: Toolchain (without parser) took 130753.34 ms. Allocated memory was 136.3 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 98.2 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 12:57:56,051 INFO L168 Benchmark]: CDTParser took 2.42 ms. Allocated memory is still 136.3 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 12:57:56,051 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.39 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 97.8 MB in the beginning and 153.8 MB in the end (delta: -56.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-12-18 12:57:56,052 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.93 ms. Allocated memory is still 200.8 MB. Free memory was 153.8 MB in the beginning and 151.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:57:56,052 INFO L168 Benchmark]: Boogie Preprocessor took 43.12 ms. Allocated memory is still 200.8 MB. Free memory was 151.1 MB in the beginning and 149.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:57:56,053 INFO L168 Benchmark]: RCFGBuilder took 816.32 ms. Allocated memory is still 200.8 MB. Free memory was 149.0 MB in the beginning and 98.6 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-18 12:57:56,053 INFO L168 Benchmark]: TraceAbstraction took 129048.19 ms. Allocated memory was 200.8 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 98.6 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 12:57:56,056 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.42 ms. Allocated memory is still 136.3 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.39 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 97.8 MB in the beginning and 153.8 MB in the end (delta: -56.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.93 ms. Allocated memory is still 200.8 MB. Free memory was 153.8 MB in the beginning and 151.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.12 ms. Allocated memory is still 200.8 MB. Free memory was 151.1 MB in the beginning and 149.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 816.32 ms. Allocated memory is still 200.8 MB. Free memory was 149.0 MB in the beginning and 98.6 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 129048.19 ms. Allocated memory was 200.8 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 98.6 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7047 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t663, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t664, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t665, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 128.7s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 46.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8677 SDtfs, 11138 SDslu, 34464 SDs, 0 SdLazy, 25216 SolverSat, 496 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 521 GetRequests, 57 SyntacticMatches, 28 SemanticMatches, 436 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3607 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 48.0s AutomataMinimizationTime, 33 MinimizatonAttempts, 348031 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1543 NumberOfCodeBlocks, 1543 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1444 ConstructedInterpolants, 0 QuantifiedInterpolants, 357599 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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 proved your program to be incorrect! Received shutdown request...