/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix032_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:45:58,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:45:58,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:45:58,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:45:58,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:45:58,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:45:58,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:45:58,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:45:58,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:45:58,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:45:58,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:45:58,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:45:58,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:45:58,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:45:58,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:45:58,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:45:58,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:45:58,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:45:58,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:45:58,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:45:58,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:45:58,054 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:45:58,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:45:58,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:45:58,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:45:58,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:45:58,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:45:58,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:45:58,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:45:58,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:45:58,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:45:58,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:45:58,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:45:58,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:45:58,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:45:58,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:45:58,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:45:58,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:45:58,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:45:58,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:45:58,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:45:58,070 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:45:58,085 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:45:58,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:45:58,086 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:45:58,087 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:45:58,087 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:45:58,087 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:45:58,087 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:45:58,087 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:45:58,088 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:45:58,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:45:58,088 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:45:58,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:45:58,088 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:45:58,089 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:45:58,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:45:58,089 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:45:58,089 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:45:58,089 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:45:58,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:45:58,090 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:45:58,090 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:45:58,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:45:58,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:45:58,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:45:58,091 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:45:58,091 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:45:58,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:45:58,091 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:45:58,092 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:45:58,092 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:45:58,092 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:45:58,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:45:58,360 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:45:58,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:45:58,365 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:45:58,366 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:45:58,366 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_tso.oepc.i [2019-12-27 16:45:58,447 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1aabef40/05f1fb4842144e128c4690173cb5344f/FLAG54e90aedb [2019-12-27 16:45:58,993 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:45:58,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_tso.oepc.i [2019-12-27 16:45:59,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1aabef40/05f1fb4842144e128c4690173cb5344f/FLAG54e90aedb [2019-12-27 16:45:59,335 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1aabef40/05f1fb4842144e128c4690173cb5344f [2019-12-27 16:45:59,343 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:45:59,345 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:45:59,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:45:59,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:45:59,349 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:45:59,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:45:59" (1/1) ... [2019-12-27 16:45:59,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4419eb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:59, skipping insertion in model container [2019-12-27 16:45:59,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:45:59" (1/1) ... [2019-12-27 16:45:59,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:45:59,413 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:45:59,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:45:59,935 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:46:00,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:46:00,091 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:46:00,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:46:00 WrapperNode [2019-12-27 16:46:00,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:46:00,093 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:46:00,093 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:46:00,093 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:46:00,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:46:00" (1/1) ... [2019-12-27 16:46:00,123 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:46:00" (1/1) ... [2019-12-27 16:46:00,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:46:00,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:46:00,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:46:00,163 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:46:00,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:46:00" (1/1) ... [2019-12-27 16:46:00,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:46:00" (1/1) ... [2019-12-27 16:46:00,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:46:00" (1/1) ... [2019-12-27 16:46:00,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:46:00" (1/1) ... [2019-12-27 16:46:00,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:46:00" (1/1) ... [2019-12-27 16:46:00,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:46:00" (1/1) ... [2019-12-27 16:46:00,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:46:00" (1/1) ... [2019-12-27 16:46:00,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:46:00,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:46:00,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:46:00,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:46:00,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:46:00" (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-27 16:46:00,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:46:00,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:46:00,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:46:00,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:46:00,270 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:46:00,270 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:46:00,270 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:46:00,270 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:46:00,271 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:46:00,271 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:46:00,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:46:00,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:46:00,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:46:00,274 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:46:01,062 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:46:01,063 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:46:01,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:46:01 BoogieIcfgContainer [2019-12-27 16:46:01,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:46:01,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:46:01,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:46:01,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:46:01,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:45:59" (1/3) ... [2019-12-27 16:46:01,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d6670f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:46:01, skipping insertion in model container [2019-12-27 16:46:01,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:46:00" (2/3) ... [2019-12-27 16:46:01,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d6670f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:46:01, skipping insertion in model container [2019-12-27 16:46:01,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:46:01" (3/3) ... [2019-12-27 16:46:01,073 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_tso.oepc.i [2019-12-27 16:46:01,083 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:46:01,084 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:46:01,091 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:46:01,092 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:46:01,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,132 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,133 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,133 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,134 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,134 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,142 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,142 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,168 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,168 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,194 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,194 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,200 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,202 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,208 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,209 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,209 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:46:01,223 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:46:01,243 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:46:01,243 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:46:01,244 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:46:01,244 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:46:01,244 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:46:01,244 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:46:01,244 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:46:01,244 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:46:01,261 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-27 16:46:01,263 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 16:46:01,375 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 16:46:01,375 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:46:01,397 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:46:01,426 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 16:46:01,518 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 16:46:01,518 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:46:01,528 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:46:01,550 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 16:46:01,551 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:46:07,185 WARN L192 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 16:46:07,309 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 16:46:07,353 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83556 [2019-12-27 16:46:07,353 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 16:46:07,357 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 105 transitions [2019-12-27 16:46:30,825 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129602 states. [2019-12-27 16:46:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 129602 states. [2019-12-27 16:46:30,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:46:30,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:30,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:46:30,833 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-27 16:46:30,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:30,838 INFO L82 PathProgramCache]: Analyzing trace with hash 923865, now seen corresponding path program 1 times [2019-12-27 16:46:30,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:30,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427655692] [2019-12-27 16:46:30,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:31,057 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-27 16:46:31,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427655692] [2019-12-27 16:46:31,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:31,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:46:31,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [650887316] [2019-12-27 16:46:31,062 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:31,066 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:31,078 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:46:31,079 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:31,083 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:46:31,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:46:31,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:31,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:46:31,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:46:31,102 INFO L87 Difference]: Start difference. First operand 129602 states. Second operand 3 states. [2019-12-27 16:46:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:34,730 INFO L93 Difference]: Finished difference Result 128376 states and 546782 transitions. [2019-12-27 16:46:34,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:46:34,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:46:34,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:35,373 INFO L225 Difference]: With dead ends: 128376 [2019-12-27 16:46:35,373 INFO L226 Difference]: Without dead ends: 120914 [2019-12-27 16:46:35,375 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-27 16:46:40,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120914 states. [2019-12-27 16:46:43,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120914 to 120914. [2019-12-27 16:46:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120914 states. [2019-12-27 16:46:44,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120914 states to 120914 states and 514358 transitions. [2019-12-27 16:46:44,285 INFO L78 Accepts]: Start accepts. Automaton has 120914 states and 514358 transitions. Word has length 3 [2019-12-27 16:46:44,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:44,286 INFO L462 AbstractCegarLoop]: Abstraction has 120914 states and 514358 transitions. [2019-12-27 16:46:44,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:46:44,286 INFO L276 IsEmpty]: Start isEmpty. Operand 120914 states and 514358 transitions. [2019-12-27 16:46:44,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:46:44,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:44,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:46:44,291 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-27 16:46:44,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:44,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2102120012, now seen corresponding path program 1 times [2019-12-27 16:46:44,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:44,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397265812] [2019-12-27 16:46:44,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:44,394 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-27 16:46:44,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397265812] [2019-12-27 16:46:44,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:44,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:46:44,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [984041581] [2019-12-27 16:46:44,395 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:44,397 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:44,399 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:46:44,399 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:44,400 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:46:44,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:46:44,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:44,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:46:44,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:46:44,402 INFO L87 Difference]: Start difference. First operand 120914 states and 514358 transitions. Second operand 4 states. [2019-12-27 16:46:50,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:50,195 INFO L93 Difference]: Finished difference Result 187704 states and 768206 transitions. [2019-12-27 16:46:50,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:46:50,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:46:50,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:51,578 INFO L225 Difference]: With dead ends: 187704 [2019-12-27 16:46:51,578 INFO L226 Difference]: Without dead ends: 187655 [2019-12-27 16:46:51,580 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-27 16:47:02,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187655 states. [2019-12-27 16:47:05,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187655 to 171775. [2019-12-27 16:47:05,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171775 states. [2019-12-27 16:47:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171775 states to 171775 states and 711726 transitions. [2019-12-27 16:47:06,878 INFO L78 Accepts]: Start accepts. Automaton has 171775 states and 711726 transitions. Word has length 11 [2019-12-27 16:47:06,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:06,878 INFO L462 AbstractCegarLoop]: Abstraction has 171775 states and 711726 transitions. [2019-12-27 16:47:06,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:47:06,878 INFO L276 IsEmpty]: Start isEmpty. Operand 171775 states and 711726 transitions. [2019-12-27 16:47:06,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:47:06,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:06,884 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:06,885 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-27 16:47:06,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:06,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1617299066, now seen corresponding path program 1 times [2019-12-27 16:47:06,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:06,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102138477] [2019-12-27 16:47:06,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:06,952 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-27 16:47:06,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102138477] [2019-12-27 16:47:06,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:06,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:47:06,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [786414909] [2019-12-27 16:47:06,954 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:06,955 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:06,957 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:47:06,957 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:06,958 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:47:06,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:47:06,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:06,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:47:06,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:47:06,959 INFO L87 Difference]: Start difference. First operand 171775 states and 711726 transitions. Second operand 3 states. [2019-12-27 16:47:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:07,133 INFO L93 Difference]: Finished difference Result 36261 states and 117727 transitions. [2019-12-27 16:47:07,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:47:07,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:47:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:07,214 INFO L225 Difference]: With dead ends: 36261 [2019-12-27 16:47:07,215 INFO L226 Difference]: Without dead ends: 36261 [2019-12-27 16:47:07,215 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-27 16:47:07,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36261 states. [2019-12-27 16:47:08,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36261 to 36261. [2019-12-27 16:47:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36261 states. [2019-12-27 16:47:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36261 states to 36261 states and 117727 transitions. [2019-12-27 16:47:08,101 INFO L78 Accepts]: Start accepts. Automaton has 36261 states and 117727 transitions. Word has length 13 [2019-12-27 16:47:08,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:08,101 INFO L462 AbstractCegarLoop]: Abstraction has 36261 states and 117727 transitions. [2019-12-27 16:47:08,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:47:08,101 INFO L276 IsEmpty]: Start isEmpty. Operand 36261 states and 117727 transitions. [2019-12-27 16:47:08,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:47:08,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:08,105 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:08,105 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-27 16:47:08,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:08,105 INFO L82 PathProgramCache]: Analyzing trace with hash 947448332, now seen corresponding path program 1 times [2019-12-27 16:47:08,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:08,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138613515] [2019-12-27 16:47:08,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:08,195 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-27 16:47:08,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138613515] [2019-12-27 16:47:08,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:08,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:47:08,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [786471068] [2019-12-27 16:47:08,196 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:10,543 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:10,547 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:47:10,547 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:10,548 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:47:10,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:47:10,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:10,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:47:10,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:47:10,549 INFO L87 Difference]: Start difference. First operand 36261 states and 117727 transitions. Second operand 5 states. [2019-12-27 16:47:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:11,175 INFO L93 Difference]: Finished difference Result 50300 states and 161544 transitions. [2019-12-27 16:47:11,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:47:11,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 16:47:11,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:11,263 INFO L225 Difference]: With dead ends: 50300 [2019-12-27 16:47:11,263 INFO L226 Difference]: Without dead ends: 50300 [2019-12-27 16:47:11,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:47:11,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50300 states. [2019-12-27 16:47:12,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50300 to 43029. [2019-12-27 16:47:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43029 states. [2019-12-27 16:47:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43029 states to 43029 states and 139308 transitions. [2019-12-27 16:47:12,164 INFO L78 Accepts]: Start accepts. Automaton has 43029 states and 139308 transitions. Word has length 16 [2019-12-27 16:47:12,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:12,165 INFO L462 AbstractCegarLoop]: Abstraction has 43029 states and 139308 transitions. [2019-12-27 16:47:12,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:47:12,166 INFO L276 IsEmpty]: Start isEmpty. Operand 43029 states and 139308 transitions. [2019-12-27 16:47:12,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:47:12,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:12,175 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-27 16:47:12,176 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-27 16:47:12,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:12,176 INFO L82 PathProgramCache]: Analyzing trace with hash -282717849, now seen corresponding path program 1 times [2019-12-27 16:47:12,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:12,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213085417] [2019-12-27 16:47:12,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:12,279 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-27 16:47:12,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213085417] [2019-12-27 16:47:12,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:12,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:47:12,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1132229689] [2019-12-27 16:47:12,280 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:12,284 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:12,292 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 16:47:12,292 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:12,334 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:47:12,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:47:12,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:12,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:47:12,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:47:12,336 INFO L87 Difference]: Start difference. First operand 43029 states and 139308 transitions. Second operand 7 states. [2019-12-27 16:47:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:13,344 INFO L93 Difference]: Finished difference Result 64122 states and 202692 transitions. [2019-12-27 16:47:13,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:47:13,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 16:47:13,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:13,457 INFO L225 Difference]: With dead ends: 64122 [2019-12-27 16:47:13,457 INFO L226 Difference]: Without dead ends: 64115 [2019-12-27 16:47:13,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:47:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64115 states. [2019-12-27 16:47:14,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64115 to 42953. [2019-12-27 16:47:14,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-27 16:47:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 138310 transitions. [2019-12-27 16:47:14,665 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 138310 transitions. Word has length 22 [2019-12-27 16:47:14,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:14,666 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 138310 transitions. [2019-12-27 16:47:14,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:47:14,666 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 138310 transitions. [2019-12-27 16:47:14,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:47:14,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:14,680 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-27 16:47:14,680 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-27 16:47:14,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:14,680 INFO L82 PathProgramCache]: Analyzing trace with hash -71664384, now seen corresponding path program 1 times [2019-12-27 16:47:14,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:14,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147808896] [2019-12-27 16:47:14,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:14,748 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-27 16:47:14,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147808896] [2019-12-27 16:47:14,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:14,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:47:14,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2012154785] [2019-12-27 16:47:14,749 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:14,753 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:14,763 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 16:47:14,763 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:14,777 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:47:14,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:47:14,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:14,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:47:14,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:47:14,778 INFO L87 Difference]: Start difference. First operand 42953 states and 138310 transitions. Second operand 5 states. [2019-12-27 16:47:14,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:14,878 INFO L93 Difference]: Finished difference Result 17024 states and 51836 transitions. [2019-12-27 16:47:14,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:47:14,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 16:47:14,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:14,909 INFO L225 Difference]: With dead ends: 17024 [2019-12-27 16:47:14,909 INFO L226 Difference]: Without dead ends: 17024 [2019-12-27 16:47:14,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-27 16:47:14,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17024 states. [2019-12-27 16:47:15,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17024 to 16731. [2019-12-27 16:47:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16731 states. [2019-12-27 16:47:15,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16731 states to 16731 states and 51000 transitions. [2019-12-27 16:47:15,175 INFO L78 Accepts]: Start accepts. Automaton has 16731 states and 51000 transitions. Word has length 25 [2019-12-27 16:47:15,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:15,176 INFO L462 AbstractCegarLoop]: Abstraction has 16731 states and 51000 transitions. [2019-12-27 16:47:15,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:47:15,176 INFO L276 IsEmpty]: Start isEmpty. Operand 16731 states and 51000 transitions. [2019-12-27 16:47:15,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:47:15,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:15,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:15,188 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-27 16:47:15,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:15,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1418175430, now seen corresponding path program 1 times [2019-12-27 16:47:15,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:15,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901830943] [2019-12-27 16:47:15,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:15,267 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-27 16:47:15,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901830943] [2019-12-27 16:47:15,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:15,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:47:15,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [991333802] [2019-12-27 16:47:15,268 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:15,272 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:15,278 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:47:15,278 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:15,279 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:47:15,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:47:15,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:15,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:47:15,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:47:15,280 INFO L87 Difference]: Start difference. First operand 16731 states and 51000 transitions. Second operand 3 states. [2019-12-27 16:47:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:15,422 INFO L93 Difference]: Finished difference Result 24375 states and 72822 transitions. [2019-12-27 16:47:15,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:47:15,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:47:15,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:15,469 INFO L225 Difference]: With dead ends: 24375 [2019-12-27 16:47:15,469 INFO L226 Difference]: Without dead ends: 24375 [2019-12-27 16:47:15,469 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-27 16:47:15,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24375 states. [2019-12-27 16:47:15,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24375 to 18589. [2019-12-27 16:47:15,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18589 states. [2019-12-27 16:47:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18589 states to 18589 states and 56096 transitions. [2019-12-27 16:47:15,966 INFO L78 Accepts]: Start accepts. Automaton has 18589 states and 56096 transitions. Word has length 27 [2019-12-27 16:47:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:15,966 INFO L462 AbstractCegarLoop]: Abstraction has 18589 states and 56096 transitions. [2019-12-27 16:47:15,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:47:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 18589 states and 56096 transitions. [2019-12-27 16:47:15,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:47:15,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:15,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:15,979 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-27 16:47:15,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:15,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1834697800, now seen corresponding path program 1 times [2019-12-27 16:47:15,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:15,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75295302] [2019-12-27 16:47:15,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:16,056 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-27 16:47:16,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75295302] [2019-12-27 16:47:16,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:16,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:47:16,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [108065992] [2019-12-27 16:47:16,057 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:16,061 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:16,066 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:47:16,066 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:16,067 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:47:16,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:47:16,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:16,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:47:16,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:47:16,068 INFO L87 Difference]: Start difference. First operand 18589 states and 56096 transitions. Second operand 6 states. [2019-12-27 16:47:16,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:16,610 INFO L93 Difference]: Finished difference Result 26038 states and 76681 transitions. [2019-12-27 16:47:16,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:47:16,610 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 16:47:16,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:16,659 INFO L225 Difference]: With dead ends: 26038 [2019-12-27 16:47:16,659 INFO L226 Difference]: Without dead ends: 26038 [2019-12-27 16:47:16,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:47:16,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26038 states. [2019-12-27 16:47:17,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26038 to 21331. [2019-12-27 16:47:17,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21331 states. [2019-12-27 16:47:17,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21331 states to 21331 states and 64000 transitions. [2019-12-27 16:47:17,062 INFO L78 Accepts]: Start accepts. Automaton has 21331 states and 64000 transitions. Word has length 27 [2019-12-27 16:47:17,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:17,063 INFO L462 AbstractCegarLoop]: Abstraction has 21331 states and 64000 transitions. [2019-12-27 16:47:17,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:47:17,063 INFO L276 IsEmpty]: Start isEmpty. Operand 21331 states and 64000 transitions. [2019-12-27 16:47:17,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:47:17,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:17,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:17,084 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-27 16:47:17,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:17,085 INFO L82 PathProgramCache]: Analyzing trace with hash -2065332723, now seen corresponding path program 1 times [2019-12-27 16:47:17,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:17,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870391309] [2019-12-27 16:47:17,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:17,187 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-27 16:47:17,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870391309] [2019-12-27 16:47:17,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:17,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:47:17,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1055418740] [2019-12-27 16:47:17,188 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:17,194 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:17,206 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 16:47:17,206 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:17,224 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:47:17,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:47:17,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:17,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:47:17,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:47:17,226 INFO L87 Difference]: Start difference. First operand 21331 states and 64000 transitions. Second operand 8 states. [2019-12-27 16:47:18,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:18,397 INFO L93 Difference]: Finished difference Result 28794 states and 84449 transitions. [2019-12-27 16:47:18,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:47:18,398 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 16:47:18,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:18,437 INFO L225 Difference]: With dead ends: 28794 [2019-12-27 16:47:18,437 INFO L226 Difference]: Without dead ends: 28794 [2019-12-27 16:47:18,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:47:18,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28794 states. [2019-12-27 16:47:18,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28794 to 19492. [2019-12-27 16:47:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19492 states. [2019-12-27 16:47:18,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19492 states to 19492 states and 58703 transitions. [2019-12-27 16:47:18,793 INFO L78 Accepts]: Start accepts. Automaton has 19492 states and 58703 transitions. Word has length 33 [2019-12-27 16:47:18,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:18,793 INFO L462 AbstractCegarLoop]: Abstraction has 19492 states and 58703 transitions. [2019-12-27 16:47:18,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:47:18,794 INFO L276 IsEmpty]: Start isEmpty. Operand 19492 states and 58703 transitions. [2019-12-27 16:47:18,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:47:18,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:18,819 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-27 16:47:18,819 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-27 16:47:18,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:18,820 INFO L82 PathProgramCache]: Analyzing trace with hash 603828080, now seen corresponding path program 1 times [2019-12-27 16:47:18,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:18,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517535509] [2019-12-27 16:47:18,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:18,877 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-27 16:47:18,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517535509] [2019-12-27 16:47:18,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:18,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:47:18,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [681627219] [2019-12-27 16:47:18,879 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:18,886 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:18,945 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 355 transitions. [2019-12-27 16:47:18,945 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:18,979 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:47:18,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:47:18,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:18,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:47:18,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:47:18,980 INFO L87 Difference]: Start difference. First operand 19492 states and 58703 transitions. Second operand 6 states. [2019-12-27 16:47:19,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:19,292 INFO L93 Difference]: Finished difference Result 33180 states and 100186 transitions. [2019-12-27 16:47:19,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:47:19,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-27 16:47:19,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:19,330 INFO L225 Difference]: With dead ends: 33180 [2019-12-27 16:47:19,330 INFO L226 Difference]: Without dead ends: 16657 [2019-12-27 16:47:19,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:47:19,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16657 states. [2019-12-27 16:47:19,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16657 to 16583. [2019-12-27 16:47:19,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16583 states. [2019-12-27 16:47:19,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16583 states to 16583 states and 49025 transitions. [2019-12-27 16:47:19,736 INFO L78 Accepts]: Start accepts. Automaton has 16583 states and 49025 transitions. Word has length 39 [2019-12-27 16:47:19,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:19,736 INFO L462 AbstractCegarLoop]: Abstraction has 16583 states and 49025 transitions. [2019-12-27 16:47:19,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:47:19,737 INFO L276 IsEmpty]: Start isEmpty. Operand 16583 states and 49025 transitions. [2019-12-27 16:47:19,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:47:19,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:19,765 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-27 16:47:19,765 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-27 16:47:19,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:19,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1247651138, now seen corresponding path program 2 times [2019-12-27 16:47:19,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:19,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937092428] [2019-12-27 16:47:19,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:19,864 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-27 16:47:19,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937092428] [2019-12-27 16:47:19,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:19,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:47:19,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1762372630] [2019-12-27 16:47:19,865 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:19,873 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:19,933 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 351 transitions. [2019-12-27 16:47:19,933 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:19,935 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:47:19,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:47:19,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:19,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:47:19,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:47:19,936 INFO L87 Difference]: Start difference. First operand 16583 states and 49025 transitions. Second operand 3 states. [2019-12-27 16:47:20,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:20,031 INFO L93 Difference]: Finished difference Result 16582 states and 49023 transitions. [2019-12-27 16:47:20,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:47:20,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 16:47:20,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:20,069 INFO L225 Difference]: With dead ends: 16582 [2019-12-27 16:47:20,069 INFO L226 Difference]: Without dead ends: 16582 [2019-12-27 16:47:20,069 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-27 16:47:20,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16582 states. [2019-12-27 16:47:20,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16582 to 16582. [2019-12-27 16:47:20,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16582 states. [2019-12-27 16:47:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16582 states to 16582 states and 49023 transitions. [2019-12-27 16:47:20,497 INFO L78 Accepts]: Start accepts. Automaton has 16582 states and 49023 transitions. Word has length 39 [2019-12-27 16:47:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:20,497 INFO L462 AbstractCegarLoop]: Abstraction has 16582 states and 49023 transitions. [2019-12-27 16:47:20,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:47:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 16582 states and 49023 transitions. [2019-12-27 16:47:20,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:47:20,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:20,523 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-27 16:47:20,523 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-27 16:47:20,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:20,523 INFO L82 PathProgramCache]: Analyzing trace with hash -2020108147, now seen corresponding path program 1 times [2019-12-27 16:47:20,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:20,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715209498] [2019-12-27 16:47:20,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:20,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-27 16:47:20,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715209498] [2019-12-27 16:47:20,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:20,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:47:20,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1184875232] [2019-12-27 16:47:20,636 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:20,644 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:20,676 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 122 transitions. [2019-12-27 16:47:20,676 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:20,687 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:47:20,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:47:20,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:20,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:47:20,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:47:20,689 INFO L87 Difference]: Start difference. First operand 16582 states and 49023 transitions. Second operand 5 states. [2019-12-27 16:47:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:21,055 INFO L93 Difference]: Finished difference Result 31293 states and 93283 transitions. [2019-12-27 16:47:21,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:47:21,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 16:47:21,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:21,086 INFO L225 Difference]: With dead ends: 31293 [2019-12-27 16:47:21,086 INFO L226 Difference]: Without dead ends: 16903 [2019-12-27 16:47:21,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:47:21,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16903 states. [2019-12-27 16:47:21,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16903 to 11605. [2019-12-27 16:47:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11605 states. [2019-12-27 16:47:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11605 states to 11605 states and 33387 transitions. [2019-12-27 16:47:21,329 INFO L78 Accepts]: Start accepts. Automaton has 11605 states and 33387 transitions. Word has length 40 [2019-12-27 16:47:21,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:21,329 INFO L462 AbstractCegarLoop]: Abstraction has 11605 states and 33387 transitions. [2019-12-27 16:47:21,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:47:21,329 INFO L276 IsEmpty]: Start isEmpty. Operand 11605 states and 33387 transitions. [2019-12-27 16:47:21,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:47:21,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:21,340 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-27 16:47:21,340 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-27 16:47:21,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:21,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1707989501, now seen corresponding path program 2 times [2019-12-27 16:47:21,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:21,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745853347] [2019-12-27 16:47:21,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:21,396 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-27 16:47:21,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745853347] [2019-12-27 16:47:21,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:21,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:47:21,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1183728774] [2019-12-27 16:47:21,397 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:21,405 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:21,500 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 423 transitions. [2019-12-27 16:47:21,500 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:21,535 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:47:21,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:47:21,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:21,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:47:21,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:47:21,536 INFO L87 Difference]: Start difference. First operand 11605 states and 33387 transitions. Second operand 7 states. [2019-12-27 16:47:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:21,612 INFO L93 Difference]: Finished difference Result 10656 states and 31273 transitions. [2019-12-27 16:47:21,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:47:21,612 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 16:47:21,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:21,628 INFO L225 Difference]: With dead ends: 10656 [2019-12-27 16:47:21,628 INFO L226 Difference]: Without dead ends: 7573 [2019-12-27 16:47:21,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:47:21,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7573 states. [2019-12-27 16:47:21,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7573 to 7573. [2019-12-27 16:47:21,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7573 states. [2019-12-27 16:47:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7573 states to 7573 states and 24358 transitions. [2019-12-27 16:47:21,852 INFO L78 Accepts]: Start accepts. Automaton has 7573 states and 24358 transitions. Word has length 40 [2019-12-27 16:47:21,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:21,852 INFO L462 AbstractCegarLoop]: Abstraction has 7573 states and 24358 transitions. [2019-12-27 16:47:21,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:47:21,853 INFO L276 IsEmpty]: Start isEmpty. Operand 7573 states and 24358 transitions. [2019-12-27 16:47:21,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:47:21,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:21,865 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-27 16:47:21,865 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-27 16:47:21,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:21,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1827713058, now seen corresponding path program 1 times [2019-12-27 16:47:21,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:21,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97881588] [2019-12-27 16:47:21,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:21,929 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-27 16:47:21,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97881588] [2019-12-27 16:47:21,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:21,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:47:21,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [952203619] [2019-12-27 16:47:21,930 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:21,952 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:22,188 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 301 states and 548 transitions. [2019-12-27 16:47:22,188 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:22,200 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:47:22,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:47:22,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:22,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:47:22,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:47:22,201 INFO L87 Difference]: Start difference. First operand 7573 states and 24358 transitions. Second operand 3 states. [2019-12-27 16:47:22,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:22,283 INFO L93 Difference]: Finished difference Result 10082 states and 31704 transitions. [2019-12-27 16:47:22,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:47:22,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 16:47:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:22,305 INFO L225 Difference]: With dead ends: 10082 [2019-12-27 16:47:22,305 INFO L226 Difference]: Without dead ends: 10082 [2019-12-27 16:47:22,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:47:22,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10082 states. [2019-12-27 16:47:22,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10082 to 7729. [2019-12-27 16:47:22,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7729 states. [2019-12-27 16:47:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7729 states to 7729 states and 24514 transitions. [2019-12-27 16:47:22,517 INFO L78 Accepts]: Start accepts. Automaton has 7729 states and 24514 transitions. Word has length 64 [2019-12-27 16:47:22,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:22,518 INFO L462 AbstractCegarLoop]: Abstraction has 7729 states and 24514 transitions. [2019-12-27 16:47:22,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:47:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 7729 states and 24514 transitions. [2019-12-27 16:47:22,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:47:22,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:22,527 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-27 16:47:22,527 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-27 16:47:22,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:22,528 INFO L82 PathProgramCache]: Analyzing trace with hash 572197328, now seen corresponding path program 1 times [2019-12-27 16:47:22,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:22,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37580576] [2019-12-27 16:47:22,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:22,617 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-27 16:47:22,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37580576] [2019-12-27 16:47:22,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:22,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:47:22,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [52704609] [2019-12-27 16:47:22,618 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:22,639 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:22,878 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 301 states and 548 transitions. [2019-12-27 16:47:22,879 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:23,227 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 16:47:23,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 16:47:23,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:23,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 16:47:23,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:47:23,229 INFO L87 Difference]: Start difference. First operand 7729 states and 24514 transitions. Second operand 15 states. [2019-12-27 16:47:25,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:25,477 INFO L93 Difference]: Finished difference Result 25820 states and 78978 transitions. [2019-12-27 16:47:25,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 16:47:25,477 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 64 [2019-12-27 16:47:25,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:25,506 INFO L225 Difference]: With dead ends: 25820 [2019-12-27 16:47:25,506 INFO L226 Difference]: Without dead ends: 19646 [2019-12-27 16:47:25,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=875, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 16:47:25,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19646 states. [2019-12-27 16:47:25,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19646 to 9445. [2019-12-27 16:47:25,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2019-12-27 16:47:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 29808 transitions. [2019-12-27 16:47:25,756 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 29808 transitions. Word has length 64 [2019-12-27 16:47:25,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:25,756 INFO L462 AbstractCegarLoop]: Abstraction has 9445 states and 29808 transitions. [2019-12-27 16:47:25,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 16:47:25,756 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 29808 transitions. [2019-12-27 16:47:25,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:47:25,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:25,767 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-27 16:47:25,767 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-27 16:47:25,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:25,767 INFO L82 PathProgramCache]: Analyzing trace with hash -22937850, now seen corresponding path program 2 times [2019-12-27 16:47:25,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:25,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240338595] [2019-12-27 16:47:25,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:25,861 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-27 16:47:25,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240338595] [2019-12-27 16:47:25,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:25,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:47:25,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [909116668] [2019-12-27 16:47:25,862 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:25,882 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:26,062 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 206 states and 348 transitions. [2019-12-27 16:47:26,063 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:26,251 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 16:47:26,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:47:26,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:26,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:47:26,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:47:26,252 INFO L87 Difference]: Start difference. First operand 9445 states and 29808 transitions. Second operand 14 states. [2019-12-27 16:47:28,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:28,422 INFO L93 Difference]: Finished difference Result 24845 states and 77092 transitions. [2019-12-27 16:47:28,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 16:47:28,423 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2019-12-27 16:47:28,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:28,448 INFO L225 Difference]: With dead ends: 24845 [2019-12-27 16:47:28,448 INFO L226 Difference]: Without dead ends: 17631 [2019-12-27 16:47:28,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2019-12-27 16:47:28,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17631 states. [2019-12-27 16:47:28,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17631 to 11056. [2019-12-27 16:47:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11056 states. [2019-12-27 16:47:28,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11056 states to 11056 states and 34695 transitions. [2019-12-27 16:47:28,766 INFO L78 Accepts]: Start accepts. Automaton has 11056 states and 34695 transitions. Word has length 64 [2019-12-27 16:47:28,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:28,766 INFO L462 AbstractCegarLoop]: Abstraction has 11056 states and 34695 transitions. [2019-12-27 16:47:28,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:47:28,766 INFO L276 IsEmpty]: Start isEmpty. Operand 11056 states and 34695 transitions. [2019-12-27 16:47:28,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:47:28,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:28,779 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-27 16:47:28,779 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-27 16:47:28,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:28,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1388618928, now seen corresponding path program 3 times [2019-12-27 16:47:28,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:28,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689430749] [2019-12-27 16:47:28,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:28,899 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-27 16:47:28,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689430749] [2019-12-27 16:47:28,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:28,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:47:28,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1097791030] [2019-12-27 16:47:28,900 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:28,920 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:29,044 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 245 transitions. [2019-12-27 16:47:29,044 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:29,139 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:47:29,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:47:29,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:29,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:47:29,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:47:29,140 INFO L87 Difference]: Start difference. First operand 11056 states and 34695 transitions. Second operand 13 states. [2019-12-27 16:47:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:31,888 INFO L93 Difference]: Finished difference Result 33680 states and 103747 transitions. [2019-12-27 16:47:31,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 16:47:31,889 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 16:47:31,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:31,936 INFO L225 Difference]: With dead ends: 33680 [2019-12-27 16:47:31,936 INFO L226 Difference]: Without dead ends: 31192 [2019-12-27 16:47:31,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=505, Invalid=1945, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 16:47:32,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31192 states. [2019-12-27 16:47:32,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31192 to 10916. [2019-12-27 16:47:32,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10916 states. [2019-12-27 16:47:32,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10916 states to 10916 states and 34289 transitions. [2019-12-27 16:47:32,251 INFO L78 Accepts]: Start accepts. Automaton has 10916 states and 34289 transitions. Word has length 64 [2019-12-27 16:47:32,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:32,251 INFO L462 AbstractCegarLoop]: Abstraction has 10916 states and 34289 transitions. [2019-12-27 16:47:32,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:47:32,251 INFO L276 IsEmpty]: Start isEmpty. Operand 10916 states and 34289 transitions. [2019-12-27 16:47:32,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:47:32,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:32,262 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-27 16:47:32,262 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-27 16:47:32,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:32,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1911526292, now seen corresponding path program 4 times [2019-12-27 16:47:32,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:32,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016385761] [2019-12-27 16:47:32,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:32,330 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-27 16:47:32,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016385761] [2019-12-27 16:47:32,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:32,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:47:32,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1563424689] [2019-12-27 16:47:32,331 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:32,352 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:32,847 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 305 states and 558 transitions. [2019-12-27 16:47:32,848 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:32,862 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:47:32,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:47:32,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:32,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:47:32,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:47:32,864 INFO L87 Difference]: Start difference. First operand 10916 states and 34289 transitions. Second operand 3 states. [2019-12-27 16:47:33,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:33,002 INFO L93 Difference]: Finished difference Result 12632 states and 39593 transitions. [2019-12-27 16:47:33,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:47:33,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 16:47:33,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:33,036 INFO L225 Difference]: With dead ends: 12632 [2019-12-27 16:47:33,036 INFO L226 Difference]: Without dead ends: 12632 [2019-12-27 16:47:33,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:47:33,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12632 states. [2019-12-27 16:47:33,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12632 to 11384. [2019-12-27 16:47:33,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11384 states. [2019-12-27 16:47:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11384 states to 11384 states and 35849 transitions. [2019-12-27 16:47:33,429 INFO L78 Accepts]: Start accepts. Automaton has 11384 states and 35849 transitions. Word has length 64 [2019-12-27 16:47:33,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:33,429 INFO L462 AbstractCegarLoop]: Abstraction has 11384 states and 35849 transitions. [2019-12-27 16:47:33,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:47:33,430 INFO L276 IsEmpty]: Start isEmpty. Operand 11384 states and 35849 transitions. [2019-12-27 16:47:33,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:33,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:33,449 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-27 16:47:33,450 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-27 16:47:33,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:33,450 INFO L82 PathProgramCache]: Analyzing trace with hash -2140458066, now seen corresponding path program 1 times [2019-12-27 16:47:33,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:33,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003686195] [2019-12-27 16:47:33,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:33,565 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-27 16:47:33,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003686195] [2019-12-27 16:47:33,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:33,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:47:33,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1064523184] [2019-12-27 16:47:33,567 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:33,589 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:33,762 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 264 transitions. [2019-12-27 16:47:33,763 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:33,945 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 16:47:33,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:47:33,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:33,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:47:33,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:47:33,946 INFO L87 Difference]: Start difference. First operand 11384 states and 35849 transitions. Second operand 13 states. [2019-12-27 16:47:38,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:38,309 INFO L93 Difference]: Finished difference Result 56068 states and 173510 transitions. [2019-12-27 16:47:38,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-27 16:47:38,310 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 16:47:38,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:38,373 INFO L225 Difference]: With dead ends: 56068 [2019-12-27 16:47:38,373 INFO L226 Difference]: Without dead ends: 44689 [2019-12-27 16:47:38,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=595, Invalid=2597, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 16:47:38,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44689 states. [2019-12-27 16:47:38,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44689 to 14995. [2019-12-27 16:47:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14995 states. [2019-12-27 16:47:38,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14995 states to 14995 states and 47906 transitions. [2019-12-27 16:47:38,829 INFO L78 Accepts]: Start accepts. Automaton has 14995 states and 47906 transitions. Word has length 65 [2019-12-27 16:47:38,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:38,829 INFO L462 AbstractCegarLoop]: Abstraction has 14995 states and 47906 transitions. [2019-12-27 16:47:38,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:47:38,829 INFO L276 IsEmpty]: Start isEmpty. Operand 14995 states and 47906 transitions. [2019-12-27 16:47:38,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:38,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:38,848 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-27 16:47:38,848 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-27 16:47:38,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:38,849 INFO L82 PathProgramCache]: Analyzing trace with hash -281745782, now seen corresponding path program 2 times [2019-12-27 16:47:38,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:38,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063331968] [2019-12-27 16:47:38,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:38,987 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-27 16:47:38,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063331968] [2019-12-27 16:47:38,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:38,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:47:38,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1868691560] [2019-12-27 16:47:38,989 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:39,016 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:39,169 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 270 transitions. [2019-12-27 16:47:39,170 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:39,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:39,423 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:47:39,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 16:47:39,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:39,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 16:47:39,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:47:39,424 INFO L87 Difference]: Start difference. First operand 14995 states and 47906 transitions. Second operand 16 states. [2019-12-27 16:47:49,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:49,021 INFO L93 Difference]: Finished difference Result 68761 states and 211276 transitions. [2019-12-27 16:47:49,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-12-27 16:47:49,022 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2019-12-27 16:47:49,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:49,118 INFO L225 Difference]: With dead ends: 68761 [2019-12-27 16:47:49,118 INFO L226 Difference]: Without dead ends: 58612 [2019-12-27 16:47:49,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5123 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1963, Invalid=11377, Unknown=0, NotChecked=0, Total=13340 [2019-12-27 16:47:49,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58612 states. [2019-12-27 16:47:49,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58612 to 14575. [2019-12-27 16:47:49,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14575 states. [2019-12-27 16:47:49,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14575 states to 14575 states and 46485 transitions. [2019-12-27 16:47:49,735 INFO L78 Accepts]: Start accepts. Automaton has 14575 states and 46485 transitions. Word has length 65 [2019-12-27 16:47:49,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:49,735 INFO L462 AbstractCegarLoop]: Abstraction has 14575 states and 46485 transitions. [2019-12-27 16:47:49,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 16:47:49,735 INFO L276 IsEmpty]: Start isEmpty. Operand 14575 states and 46485 transitions. [2019-12-27 16:47:49,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:49,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:49,753 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-27 16:47:49,754 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-27 16:47:49,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:49,754 INFO L82 PathProgramCache]: Analyzing trace with hash 597443054, now seen corresponding path program 3 times [2019-12-27 16:47:49,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:49,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066903162] [2019-12-27 16:47:49,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:49,869 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-27 16:47:49,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066903162] [2019-12-27 16:47:49,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:49,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:47:49,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [124776753] [2019-12-27 16:47:49,870 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:49,891 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:50,223 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 282 transitions. [2019-12-27 16:47:50,223 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:50,297 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:47:50,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:47:50,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:50,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:47:50,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:47:50,299 INFO L87 Difference]: Start difference. First operand 14575 states and 46485 transitions. Second operand 11 states. [2019-12-27 16:47:51,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:51,420 INFO L93 Difference]: Finished difference Result 39752 states and 121974 transitions. [2019-12-27 16:47:51,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 16:47:51,421 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 16:47:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:51,470 INFO L225 Difference]: With dead ends: 39752 [2019-12-27 16:47:51,470 INFO L226 Difference]: Without dead ends: 35992 [2019-12-27 16:47:51,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-27 16:47:51,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35992 states. [2019-12-27 16:47:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35992 to 14470. [2019-12-27 16:47:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14470 states. [2019-12-27 16:47:51,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14470 states to 14470 states and 46039 transitions. [2019-12-27 16:47:51,856 INFO L78 Accepts]: Start accepts. Automaton has 14470 states and 46039 transitions. Word has length 65 [2019-12-27 16:47:51,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:51,856 INFO L462 AbstractCegarLoop]: Abstraction has 14470 states and 46039 transitions. [2019-12-27 16:47:51,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:47:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 14470 states and 46039 transitions. [2019-12-27 16:47:51,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:51,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:51,876 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-27 16:47:51,876 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-27 16:47:51,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:51,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1262085647, now seen corresponding path program 1 times [2019-12-27 16:47:51,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:51,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079947664] [2019-12-27 16:47:51,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:51,951 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-27 16:47:51,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079947664] [2019-12-27 16:47:51,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:51,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:47:51,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1873597733] [2019-12-27 16:47:51,953 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:51,973 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:52,306 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 502 transitions. [2019-12-27 16:47:52,306 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:52,315 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:47:52,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:47:52,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:52,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:47:52,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:47:52,316 INFO L87 Difference]: Start difference. First operand 14470 states and 46039 transitions. Second operand 4 states. [2019-12-27 16:47:52,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:52,419 INFO L93 Difference]: Finished difference Result 14314 states and 45415 transitions. [2019-12-27 16:47:52,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:47:52,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 16:47:52,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:52,439 INFO L225 Difference]: With dead ends: 14314 [2019-12-27 16:47:52,439 INFO L226 Difference]: Without dead ends: 14314 [2019-12-27 16:47:52,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:47:52,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14314 states. [2019-12-27 16:47:52,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14314 to 13846. [2019-12-27 16:47:52,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13846 states. [2019-12-27 16:47:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13846 states to 13846 states and 43855 transitions. [2019-12-27 16:47:52,672 INFO L78 Accepts]: Start accepts. Automaton has 13846 states and 43855 transitions. Word has length 65 [2019-12-27 16:47:52,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:52,672 INFO L462 AbstractCegarLoop]: Abstraction has 13846 states and 43855 transitions. [2019-12-27 16:47:52,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:47:52,672 INFO L276 IsEmpty]: Start isEmpty. Operand 13846 states and 43855 transitions. [2019-12-27 16:47:52,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:52,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:52,693 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-27 16:47:52,693 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-27 16:47:52,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:52,694 INFO L82 PathProgramCache]: Analyzing trace with hash 837718325, now seen corresponding path program 1 times [2019-12-27 16:47:52,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:52,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308581988] [2019-12-27 16:47:52,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:52,828 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-27 16:47:52,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308581988] [2019-12-27 16:47:52,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:52,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:47:52,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [466020564] [2019-12-27 16:47:52,829 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:52,849 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:53,037 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 377 transitions. [2019-12-27 16:47:53,037 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:53,075 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:47:53,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:47:53,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:53,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:47:53,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:47:53,077 INFO L87 Difference]: Start difference. First operand 13846 states and 43855 transitions. Second operand 6 states. [2019-12-27 16:47:53,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:53,392 INFO L93 Difference]: Finished difference Result 17655 states and 53961 transitions. [2019-12-27 16:47:53,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:47:53,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 16:47:53,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:53,417 INFO L225 Difference]: With dead ends: 17655 [2019-12-27 16:47:53,417 INFO L226 Difference]: Without dead ends: 17655 [2019-12-27 16:47:53,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:47:53,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17655 states. [2019-12-27 16:47:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17655 to 12045. [2019-12-27 16:47:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12045 states. [2019-12-27 16:47:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12045 states to 12045 states and 37284 transitions. [2019-12-27 16:47:53,655 INFO L78 Accepts]: Start accepts. Automaton has 12045 states and 37284 transitions. Word has length 65 [2019-12-27 16:47:53,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:53,655 INFO L462 AbstractCegarLoop]: Abstraction has 12045 states and 37284 transitions. [2019-12-27 16:47:53,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:47:53,655 INFO L276 IsEmpty]: Start isEmpty. Operand 12045 states and 37284 transitions. [2019-12-27 16:47:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:47:53,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:53,669 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-27 16:47:53,669 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-27 16:47:53,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:53,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1324094588, now seen corresponding path program 1 times [2019-12-27 16:47:53,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:53,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37656947] [2019-12-27 16:47:53,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:53,875 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-27 16:47:53,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37656947] [2019-12-27 16:47:53,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:53,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:47:53,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1801583401] [2019-12-27 16:47:53,876 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:53,909 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:54,133 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 333 transitions. [2019-12-27 16:47:54,133 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:54,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:54,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:54,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:54,635 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 16:47:54,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 16:47:54,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:54,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 16:47:54,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:47:54,637 INFO L87 Difference]: Start difference. First operand 12045 states and 37284 transitions. Second operand 18 states. [2019-12-27 16:47:57,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:57,191 INFO L93 Difference]: Finished difference Result 20238 states and 61434 transitions. [2019-12-27 16:47:57,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:47:57,191 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-27 16:47:57,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:57,214 INFO L225 Difference]: With dead ends: 20238 [2019-12-27 16:47:57,214 INFO L226 Difference]: Without dead ends: 15362 [2019-12-27 16:47:57,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2019-12-27 16:47:57,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15362 states. [2019-12-27 16:47:57,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15362 to 12603. [2019-12-27 16:47:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12603 states. [2019-12-27 16:47:57,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12603 states to 12603 states and 38819 transitions. [2019-12-27 16:47:57,525 INFO L78 Accepts]: Start accepts. Automaton has 12603 states and 38819 transitions. Word has length 66 [2019-12-27 16:47:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:57,526 INFO L462 AbstractCegarLoop]: Abstraction has 12603 states and 38819 transitions. [2019-12-27 16:47:57,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 16:47:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 12603 states and 38819 transitions. [2019-12-27 16:47:57,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:47:57,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:57,540 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-27 16:47:57,540 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-27 16:47:57,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:57,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1320774952, now seen corresponding path program 2 times [2019-12-27 16:47:57,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:57,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567139966] [2019-12-27 16:47:57,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:57,786 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-27 16:47:57,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567139966] [2019-12-27 16:47:57,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:57,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:47:57,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [900968423] [2019-12-27 16:47:57,788 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:57,824 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:58,134 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 340 transitions. [2019-12-27 16:47:58,134 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:58,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:58,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:58,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:58,649 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 16:47:58,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 16:47:58,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:58,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 16:47:58,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:47:58,651 INFO L87 Difference]: Start difference. First operand 12603 states and 38819 transitions. Second operand 18 states. [2019-12-27 16:48:02,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:02,173 INFO L93 Difference]: Finished difference Result 22730 states and 68515 transitions. [2019-12-27 16:48:02,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 16:48:02,173 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-27 16:48:02,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:02,204 INFO L225 Difference]: With dead ends: 22730 [2019-12-27 16:48:02,204 INFO L226 Difference]: Without dead ends: 19110 [2019-12-27 16:48:02,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=180, Invalid=876, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 16:48:02,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19110 states. [2019-12-27 16:48:02,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19110 to 12995. [2019-12-27 16:48:02,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12995 states. [2019-12-27 16:48:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12995 states to 12995 states and 39751 transitions. [2019-12-27 16:48:02,472 INFO L78 Accepts]: Start accepts. Automaton has 12995 states and 39751 transitions. Word has length 66 [2019-12-27 16:48:02,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:02,472 INFO L462 AbstractCegarLoop]: Abstraction has 12995 states and 39751 transitions. [2019-12-27 16:48:02,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 16:48:02,472 INFO L276 IsEmpty]: Start isEmpty. Operand 12995 states and 39751 transitions. [2019-12-27 16:48:02,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:48:02,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:02,486 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-27 16:48:02,487 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-27 16:48:02,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:02,487 INFO L82 PathProgramCache]: Analyzing trace with hash -961619660, now seen corresponding path program 3 times [2019-12-27 16:48:02,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:02,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804531485] [2019-12-27 16:48:02,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:02,676 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-27 16:48:02,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804531485] [2019-12-27 16:48:02,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:02,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:48:02,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [839138055] [2019-12-27 16:48:02,677 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:02,697 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:03,199 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 253 states and 481 transitions. [2019-12-27 16:48:03,199 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:03,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:03,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:03,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:03,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:04,095 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 16:48:04,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 16:48:04,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:04,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 16:48:04,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-12-27 16:48:04,096 INFO L87 Difference]: Start difference. First operand 12995 states and 39751 transitions. Second operand 21 states. [2019-12-27 16:48:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:07,035 INFO L93 Difference]: Finished difference Result 19366 states and 57882 transitions. [2019-12-27 16:48:07,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 16:48:07,036 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2019-12-27 16:48:07,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:07,058 INFO L225 Difference]: With dead ends: 19366 [2019-12-27 16:48:07,058 INFO L226 Difference]: Without dead ends: 15974 [2019-12-27 16:48:07,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2019-12-27 16:48:07,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15974 states. [2019-12-27 16:48:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15974 to 12707. [2019-12-27 16:48:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12707 states. [2019-12-27 16:48:07,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12707 states to 12707 states and 38911 transitions. [2019-12-27 16:48:07,282 INFO L78 Accepts]: Start accepts. Automaton has 12707 states and 38911 transitions. Word has length 66 [2019-12-27 16:48:07,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:07,282 INFO L462 AbstractCegarLoop]: Abstraction has 12707 states and 38911 transitions. [2019-12-27 16:48:07,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 16:48:07,282 INFO L276 IsEmpty]: Start isEmpty. Operand 12707 states and 38911 transitions. [2019-12-27 16:48:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:48:07,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:07,295 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-27 16:48:07,296 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-27 16:48:07,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:07,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1444762494, now seen corresponding path program 4 times [2019-12-27 16:48:07,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:07,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856611940] [2019-12-27 16:48:07,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:07,361 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-27 16:48:07,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856611940] [2019-12-27 16:48:07,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:07,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:48:07,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [727573854] [2019-12-27 16:48:07,362 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:07,384 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:07,587 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 323 transitions. [2019-12-27 16:48:07,588 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:07,588 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:07,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:48:07,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:07,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:48:07,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:07,589 INFO L87 Difference]: Start difference. First operand 12707 states and 38911 transitions. Second operand 3 states. [2019-12-27 16:48:07,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:07,650 INFO L93 Difference]: Finished difference Result 12706 states and 38909 transitions. [2019-12-27 16:48:07,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:48:07,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 16:48:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:07,672 INFO L225 Difference]: With dead ends: 12706 [2019-12-27 16:48:07,673 INFO L226 Difference]: Without dead ends: 12706 [2019-12-27 16:48:07,673 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-27 16:48:07,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12706 states. [2019-12-27 16:48:07,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12706 to 12706. [2019-12-27 16:48:07,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12706 states. [2019-12-27 16:48:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12706 states to 12706 states and 38909 transitions. [2019-12-27 16:48:07,893 INFO L78 Accepts]: Start accepts. Automaton has 12706 states and 38909 transitions. Word has length 66 [2019-12-27 16:48:07,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:07,894 INFO L462 AbstractCegarLoop]: Abstraction has 12706 states and 38909 transitions. [2019-12-27 16:48:07,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:48:07,894 INFO L276 IsEmpty]: Start isEmpty. Operand 12706 states and 38909 transitions. [2019-12-27 16:48:07,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:48:07,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:07,907 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, 1] [2019-12-27 16:48:07,907 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-27 16:48:07,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:07,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1555205525, now seen corresponding path program 1 times [2019-12-27 16:48:07,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:07,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294934089] [2019-12-27 16:48:07,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:08,087 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-27 16:48:08,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294934089] [2019-12-27 16:48:08,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:08,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:48:08,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [169541003] [2019-12-27 16:48:08,088 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:08,105 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:08,447 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 324 transitions. [2019-12-27 16:48:08,447 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:08,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:08,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:09,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:09,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:09,143 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 16:48:09,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 16:48:09,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:09,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 16:48:09,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-12-27 16:48:09,145 INFO L87 Difference]: Start difference. First operand 12706 states and 38909 transitions. Second operand 24 states. [2019-12-27 16:48:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:17,797 INFO L93 Difference]: Finished difference Result 37148 states and 111028 transitions. [2019-12-27 16:48:17,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-12-27 16:48:17,798 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-12-27 16:48:17,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:17,846 INFO L225 Difference]: With dead ends: 37148 [2019-12-27 16:48:17,846 INFO L226 Difference]: Without dead ends: 31459 [2019-12-27 16:48:17,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5894 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2117, Invalid=14913, Unknown=0, NotChecked=0, Total=17030 [2019-12-27 16:48:18,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31459 states. [2019-12-27 16:48:18,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31459 to 17367. [2019-12-27 16:48:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17367 states. [2019-12-27 16:48:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17367 states to 17367 states and 53002 transitions. [2019-12-27 16:48:18,353 INFO L78 Accepts]: Start accepts. Automaton has 17367 states and 53002 transitions. Word has length 67 [2019-12-27 16:48:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:18,353 INFO L462 AbstractCegarLoop]: Abstraction has 17367 states and 53002 transitions. [2019-12-27 16:48:18,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 16:48:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 17367 states and 53002 transitions. [2019-12-27 16:48:18,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:48:18,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:18,375 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, 1] [2019-12-27 16:48:18,375 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-27 16:48:18,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:18,375 INFO L82 PathProgramCache]: Analyzing trace with hash -945042827, now seen corresponding path program 2 times [2019-12-27 16:48:18,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:18,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170884110] [2019-12-27 16:48:18,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:19,115 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-27 16:48:19,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170884110] [2019-12-27 16:48:19,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:19,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 16:48:19,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [330109417] [2019-12-27 16:48:19,116 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:19,145 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:19,423 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 248 states and 470 transitions. [2019-12-27 16:48:19,424 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:20,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 16:48:20,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 16:48:20,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 16:48:20,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 16:48:21,041 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 41 times. [2019-12-27 16:48:21,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 16:48:21,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:21,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 16:48:21,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2019-12-27 16:48:21,043 INFO L87 Difference]: Start difference. First operand 17367 states and 53002 transitions. Second operand 30 states. [2019-12-27 16:48:24,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:24,770 INFO L93 Difference]: Finished difference Result 17423 states and 51675 transitions. [2019-12-27 16:48:24,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 16:48:24,771 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-12-27 16:48:24,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:24,795 INFO L225 Difference]: With dead ends: 17423 [2019-12-27 16:48:24,795 INFO L226 Difference]: Without dead ends: 16609 [2019-12-27 16:48:24,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 24 SyntacticMatches, 10 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=387, Invalid=2369, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 16:48:24,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16609 states. [2019-12-27 16:48:25,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16609 to 15383. [2019-12-27 16:48:25,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15383 states. [2019-12-27 16:48:25,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15383 states to 15383 states and 46246 transitions. [2019-12-27 16:48:25,137 INFO L78 Accepts]: Start accepts. Automaton has 15383 states and 46246 transitions. Word has length 67 [2019-12-27 16:48:25,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:25,137 INFO L462 AbstractCegarLoop]: Abstraction has 15383 states and 46246 transitions. [2019-12-27 16:48:25,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 16:48:25,137 INFO L276 IsEmpty]: Start isEmpty. Operand 15383 states and 46246 transitions. [2019-12-27 16:48:25,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:48:25,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:25,152 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, 1] [2019-12-27 16:48:25,153 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-27 16:48:25,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:25,153 INFO L82 PathProgramCache]: Analyzing trace with hash 187570937, now seen corresponding path program 3 times [2019-12-27 16:48:25,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:25,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023076615] [2019-12-27 16:48:25,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:25,354 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-27 16:48:25,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023076615] [2019-12-27 16:48:25,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:25,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:48:25,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [414376848] [2019-12-27 16:48:25,356 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:25,373 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:25,727 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 297 states and 597 transitions. [2019-12-27 16:48:25,728 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:26,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:26,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:26,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:26,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:26,341 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 16:48:26,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 16:48:26,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:26,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 16:48:26,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-12-27 16:48:26,343 INFO L87 Difference]: Start difference. First operand 15383 states and 46246 transitions. Second operand 21 states. [2019-12-27 16:48:27,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:27,582 INFO L93 Difference]: Finished difference Result 18889 states and 55894 transitions. [2019-12-27 16:48:27,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 16:48:27,583 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-27 16:48:27,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:27,605 INFO L225 Difference]: With dead ends: 18889 [2019-12-27 16:48:27,605 INFO L226 Difference]: Without dead ends: 15978 [2019-12-27 16:48:27,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=264, Invalid=1142, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 16:48:27,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15978 states. [2019-12-27 16:48:27,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15978 to 13442. [2019-12-27 16:48:27,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13442 states. [2019-12-27 16:48:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13442 states to 13442 states and 40624 transitions. [2019-12-27 16:48:27,832 INFO L78 Accepts]: Start accepts. Automaton has 13442 states and 40624 transitions. Word has length 67 [2019-12-27 16:48:27,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:27,832 INFO L462 AbstractCegarLoop]: Abstraction has 13442 states and 40624 transitions. [2019-12-27 16:48:27,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 16:48:27,832 INFO L276 IsEmpty]: Start isEmpty. Operand 13442 states and 40624 transitions. [2019-12-27 16:48:27,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:48:27,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:27,845 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, 1] [2019-12-27 16:48:27,845 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-27 16:48:27,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:27,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1748623595, now seen corresponding path program 4 times [2019-12-27 16:48:27,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:27,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768201566] [2019-12-27 16:48:27,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:48:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:48:27,974 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:48:27,974 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:48:27,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= v_~b$r_buff1_thd0~0_230 0) (= v_~b$w_buff1~0_176 0) (= v_~b$mem_tmp~0_20 0) (= v_~weak$$choice2~0_144 0) (= 0 v_~b$r_buff1_thd3~0_337) (= 0 v_~b$read_delayed~0_7) (= 0 v_~b$r_buff0_thd2~0_182) (= 0 v_~__unbuffered_p0_EAX~0_176) (= v_~__unbuffered_p1_EBX~0_38 0) (= v_~main$tmp_guard1~0_34 0) (= v_~y~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~b$r_buff0_thd0~0_204 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~b$r_buff1_thd1~0_215) (= v_~a~0_14 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t867~0.base_25|)) (= 0 v_~x~0_124) (= 0 v_~b$r_buff0_thd3~0_395) (= v_~__unbuffered_p2_EBX~0_38 0) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p2_EAX~0_34) (= 0 v_~b$w_buff0_used~0_787) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t867~0.base_25| 1)) (= |v_#NULL.offset_4| 0) (= 0 v_~b$w_buff0~0_250) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t867~0.base_25|) (= v_~__unbuffered_cnt~0_137 0) (= 0 |v_ULTIMATE.start_main_~#t867~0.offset_17|) (= 0 v_~b$w_buff1_used~0_450) (= 0 v_~b$r_buff1_thd2~0_222) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_186 0) (= v_~main$tmp_guard0~0_24 0) (= v_~b$flush_delayed~0_35 0) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t867~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t867~0.base_25|) |v_ULTIMATE.start_main_~#t867~0.offset_17| 0))) (= 0 v_~b$read_delayed_var~0.base_7) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t867~0.base_25| 4) |v_#length_25|) (= 0 v_~b$r_buff0_thd1~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_395, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_215, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t868~0.offset=|v_ULTIMATE.start_main_~#t868~0.offset_17|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_245|, ULTIMATE.start_main_~#t867~0.base=|v_ULTIMATE.start_main_~#t867~0.base_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_51|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_787, ~a~0=v_~a~0_14, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_176, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_250, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_182, ~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~b$flush_delayed~0=v_~b$flush_delayed~0_35, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t867~0.offset=|v_ULTIMATE.start_main_~#t867~0.offset_17|, ~b$w_buff1~0=v_~b$w_buff1~0_176, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ~x~0=v_~x~0_124, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_323, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ULTIMATE.start_main_~#t869~0.base=|v_ULTIMATE.start_main_~#t869~0.base_21|, ULTIMATE.start_main_~#t869~0.offset=|v_ULTIMATE.start_main_~#t869~0.offset_17|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_450, ~y~0=v_~y~0_19, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_222, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_230, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ~b~0=v_~b~0_186, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t868~0.base=|v_ULTIMATE.start_main_~#t868~0.base_21|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_144, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_337} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_~#t868~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t867~0.base, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t867~0.offset, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t869~0.base, ULTIMATE.start_main_~#t869~0.offset, ULTIMATE.start_main_#t~ite51, ~b$w_buff1_used~0, ~y~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t868~0.base, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 16:48:27,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L842-1-->L844: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t868~0.base_10|)) (= |v_ULTIMATE.start_main_~#t868~0.offset_9| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t868~0.base_10| 1) |v_#valid_27|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t868~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t868~0.base_10|) |v_ULTIMATE.start_main_~#t868~0.offset_9| 1)) |v_#memory_int_11|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t868~0.base_10|) 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t868~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t868~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t868~0.offset=|v_ULTIMATE.start_main_~#t868~0.offset_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t868~0.base=|v_ULTIMATE.start_main_~#t868~0.base_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t868~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t868~0.base, #length] because there is no mapped edge [2019-12-27 16:48:27,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t869~0.base_13|) (= |v_ULTIMATE.start_main_~#t869~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t869~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t869~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t869~0.base_13|) |v_ULTIMATE.start_main_~#t869~0.offset_11| 2)) |v_#memory_int_15|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t869~0.base_13| 1)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t869~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t869~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t869~0.base=|v_ULTIMATE.start_main_~#t869~0.base_13|, ULTIMATE.start_main_~#t869~0.offset=|v_ULTIMATE.start_main_~#t869~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t869~0.base, ULTIMATE.start_main_~#t869~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 16:48:27,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L754: Formula: (and (= ~b$r_buff1_thd0~0_Out1141933146 ~b$r_buff0_thd0~0_In1141933146) (= ~__unbuffered_p0_EAX~0_Out1141933146 ~x~0_In1141933146) (= ~b$r_buff1_thd3~0_Out1141933146 ~b$r_buff0_thd3~0_In1141933146) (not (= 0 P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1141933146)) (= ~b$r_buff0_thd2~0_In1141933146 ~b$r_buff1_thd2~0_Out1141933146) (= ~b$r_buff0_thd1~0_Out1141933146 1) (= ~b$r_buff1_thd1~0_Out1141933146 ~b$r_buff0_thd1~0_In1141933146)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1141933146, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1141933146, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1141933146, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1141933146, ~x~0=~x~0_In1141933146, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1141933146} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out1141933146, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1141933146, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1141933146, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1141933146, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out1141933146, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out1141933146, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1141933146, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out1141933146, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out1141933146, ~x~0=~x~0_In1141933146, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1141933146} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 16:48:27,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse1 (= (mod ~b$w_buff1_used~0_In1323269510 256) 0)) (.cse0 (= (mod ~b$r_buff1_thd2~0_In1323269510 256) 0))) (or (and (or .cse0 .cse1) (= ~b~0_In1323269510 |P1Thread1of1ForFork0_#t~ite9_Out1323269510|)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite9_Out1323269510| ~b$w_buff1~0_In1323269510)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In1323269510, ~b~0=~b~0_In1323269510, ~b$w_buff1~0=~b$w_buff1~0_In1323269510, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1323269510} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In1323269510, ~b~0=~b~0_In1323269510, ~b$w_buff1~0=~b$w_buff1~0_In1323269510, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out1323269510|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1323269510} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 16:48:27,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_66 |v_P1Thread1of1ForFork0_#t~ite9_34|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_34|} OutVars{~b~0=v_~b~0_66, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_53|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_33|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 16:48:27,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In-942477542 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In-942477542 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite11_Out-942477542| ~b$w_buff0_used~0_In-942477542) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite11_Out-942477542| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-942477542, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-942477542} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-942477542, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-942477542, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-942477542|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 16:48:27,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse2 (= (mod ~b$w_buff1_used~0_In1742055758 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd2~0_In1742055758 256) 0)) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In1742055758 256))) (.cse0 (= (mod ~b$r_buff0_thd2~0_In1742055758 256) 0))) (or (and (or .cse0 .cse1) (= ~b$w_buff1_used~0_In1742055758 |P1Thread1of1ForFork0_#t~ite12_Out1742055758|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite12_Out1742055758| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1742055758, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1742055758, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1742055758, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1742055758} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1742055758, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1742055758, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1742055758, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out1742055758|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1742055758} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 16:48:27,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd2~0_In196435051 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In196435051 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out196435051|) (not .cse1)) (and (or .cse1 .cse0) (= ~b$r_buff0_thd2~0_In196435051 |P1Thread1of1ForFork0_#t~ite13_Out196435051|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In196435051, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In196435051} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In196435051, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In196435051, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out196435051|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 16:48:27,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In-596614709 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd2~0_In-596614709 256))) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-596614709 256))) (.cse2 (= (mod ~b$r_buff1_thd2~0_In-596614709 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite14_Out-596614709|)) (and (or .cse0 .cse1) (= ~b$r_buff1_thd2~0_In-596614709 |P1Thread1of1ForFork0_#t~ite14_Out-596614709|) (or .cse3 .cse2)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-596614709, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-596614709, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-596614709, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-596614709} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-596614709, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-596614709, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-596614709, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-596614709|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-596614709} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 16:48:27,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L784-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= v_~b$r_buff1_thd2~0_85 |v_P1Thread1of1ForFork0_#t~ite14_32|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_32|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_31|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_85, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 16:48:27,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1480443862 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite20_Out-1480443862| ~b$w_buff0~0_In-1480443862) .cse0 (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In-1480443862 256) 0))) (or (= (mod ~b$w_buff0_used~0_In-1480443862 256) 0) (and (= 0 (mod ~b$w_buff1_used~0_In-1480443862 256)) .cse1) (and (= 0 (mod ~b$r_buff1_thd3~0_In-1480443862 256)) .cse1))) (= |P2Thread1of1ForFork1_#t~ite21_Out-1480443862| |P2Thread1of1ForFork1_#t~ite20_Out-1480443862|)) (and (= |P2Thread1of1ForFork1_#t~ite20_In-1480443862| |P2Thread1of1ForFork1_#t~ite20_Out-1480443862|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite21_Out-1480443862| ~b$w_buff0~0_In-1480443862)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1480443862, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1480443862, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In-1480443862|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1480443862, ~b$w_buff0~0=~b$w_buff0~0_In-1480443862, ~weak$$choice2~0=~weak$$choice2~0_In-1480443862, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1480443862} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1480443862, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1480443862, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out-1480443862|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out-1480443862|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1480443862, ~b$w_buff0~0=~b$w_buff0~0_In-1480443862, ~weak$$choice2~0=~weak$$choice2~0_In-1480443862, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1480443862} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 16:48:27,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1503297154 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite26_In-1503297154| |P2Thread1of1ForFork1_#t~ite26_Out-1503297154|) (= ~b$w_buff0_used~0_In-1503297154 |P2Thread1of1ForFork1_#t~ite27_Out-1503297154|) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite26_Out-1503297154| ~b$w_buff0_used~0_In-1503297154) (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-1503297154 256)))) (or (= 0 (mod ~b$w_buff0_used~0_In-1503297154 256)) (and (= (mod ~b$r_buff1_thd3~0_In-1503297154 256) 0) .cse1) (and (= (mod ~b$w_buff1_used~0_In-1503297154 256) 0) .cse1))) .cse0 (= |P2Thread1of1ForFork1_#t~ite26_Out-1503297154| |P2Thread1of1ForFork1_#t~ite27_Out-1503297154|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1503297154, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1503297154, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-1503297154|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1503297154, ~weak$$choice2~0=~weak$$choice2~0_In-1503297154, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1503297154} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1503297154, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-1503297154|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1503297154, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-1503297154|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1503297154, ~weak$$choice2~0=~weak$$choice2~0_In-1503297154, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1503297154} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-27 16:48:27,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~b$r_buff0_thd3~0_79 v_~b$r_buff0_thd3~0_78)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 16:48:27,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (not (= (mod v_~b$flush_delayed~0_8 256) 0)) (= v_~b~0_30 v_~b$mem_tmp~0_5)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~b~0=v_~b~0_30, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-27 16:48:27,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff1_thd3~0_In1844593704 256))) (.cse1 (= (mod ~b$w_buff1_used~0_In1844593704 256) 0))) (or (and (= ~b~0_In1844593704 |P2Thread1of1ForFork1_#t~ite38_Out1844593704|) (or .cse0 .cse1)) (and (= ~b$w_buff1~0_In1844593704 |P2Thread1of1ForFork1_#t~ite38_Out1844593704|) (not .cse0) (not .cse1)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In1844593704, ~b~0=~b~0_In1844593704, ~b$w_buff1~0=~b$w_buff1~0_In1844593704, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1844593704} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out1844593704|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1844593704, ~b~0=~b~0_In1844593704, ~b$w_buff1~0=~b$w_buff1~0_In1844593704, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1844593704} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-27 16:48:27,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_46 |v_P2Thread1of1ForFork1_#t~ite38_12|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_12|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_11|, ~b~0=v_~b~0_46, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-27 16:48:27,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In1242003515 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd3~0_In1242003515 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite40_Out1242003515| 0)) (and (= ~b$w_buff0_used~0_In1242003515 |P2Thread1of1ForFork1_#t~ite40_Out1242003515|) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1242003515, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1242003515} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1242003515, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1242003515, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out1242003515|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-27 16:48:27,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~b$r_buff1_thd3~0_In-512266728 256) 0)) (.cse0 (= (mod ~b$w_buff1_used~0_In-512266728 256) 0)) (.cse3 (= 0 (mod ~b$r_buff0_thd3~0_In-512266728 256))) (.cse2 (= (mod ~b$w_buff0_used~0_In-512266728 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite41_Out-512266728| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite41_Out-512266728| ~b$w_buff1_used~0_In-512266728) (or .cse3 .cse2)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-512266728, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-512266728, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-512266728, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-512266728} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-512266728, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-512266728, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-512266728, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out-512266728|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-512266728} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-27 16:48:27,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-1230442807 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd3~0_In-1230442807 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite42_Out-1230442807| ~b$r_buff0_thd3~0_In-1230442807)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite42_Out-1230442807| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1230442807, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1230442807} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1230442807, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1230442807, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-1230442807|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-27 16:48:27,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse2 (= (mod ~b$r_buff1_thd3~0_In1589963394 256) 0)) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In1589963394 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In1589963394 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In1589963394 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite43_Out1589963394| ~b$r_buff1_thd3~0_In1589963394) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork1_#t~ite43_Out1589963394| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1589963394, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1589963394, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1589963394, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1589963394} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1589963394, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1589963394, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out1589963394|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1589963394, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1589963394} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 16:48:27,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite43_44| v_~b$r_buff1_thd3~0_140) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_140, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 16:48:27,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd1~0_In1908922775 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In1908922775 256)))) (or (and (= ~b$w_buff0_used~0_In1908922775 |P0Thread1of1ForFork2_#t~ite5_Out1908922775|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out1908922775|) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1908922775, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1908922775} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1908922775, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1908922775, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out1908922775|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 16:48:27,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~b$r_buff1_thd1~0_In894177691 256) 0)) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In894177691 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In894177691 256))) (.cse0 (= (mod ~b$r_buff0_thd1~0_In894177691 256) 0))) (or (and (or .cse0 .cse1) (= ~b$w_buff1_used~0_In894177691 |P0Thread1of1ForFork2_#t~ite6_Out894177691|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork2_#t~ite6_Out894177691|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In894177691, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In894177691, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In894177691, ~b$w_buff1_used~0=~b$w_buff1_used~0_In894177691} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In894177691, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In894177691, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In894177691, ~b$w_buff1_used~0=~b$w_buff1_used~0_In894177691, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out894177691|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 16:48:27,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd1~0_In891824981 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In891824981 256) 0))) (or (and (not .cse0) (= 0 ~b$r_buff0_thd1~0_Out891824981) (not .cse1)) (and (or .cse0 .cse1) (= ~b$r_buff0_thd1~0_In891824981 ~b$r_buff0_thd1~0_Out891824981)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In891824981, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In891824981} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In891824981, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out891824981, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out891824981|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 16:48:27,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~b$w_buff1_used~0_In-1410789225 256))) (.cse3 (= (mod ~b$r_buff1_thd1~0_In-1410789225 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In-1410789225 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In-1410789225 256) 0))) (or (and (= 0 |P0Thread1of1ForFork2_#t~ite8_Out-1410789225|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P0Thread1of1ForFork2_#t~ite8_Out-1410789225| ~b$r_buff1_thd1~0_In-1410789225)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1410789225, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1410789225, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1410789225, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1410789225} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1410789225, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1410789225, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1410789225, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1410789225, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1410789225|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 16:48:27,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_36| v_~b$r_buff1_thd1~0_103) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_103, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_35|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 16:48:27,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (= 3 v_~__unbuffered_cnt~0_33) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:48:28,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In700895104 256))) (.cse1 (= 0 (mod ~b$r_buff1_thd0~0_In700895104 256)))) (or (and (= ~b~0_In700895104 |ULTIMATE.start_main_#t~ite47_Out700895104|) (or .cse0 .cse1)) (and (= ~b$w_buff1~0_In700895104 |ULTIMATE.start_main_#t~ite47_Out700895104|) (not .cse0) (not .cse1)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In700895104, ~b$w_buff1_used~0=~b$w_buff1_used~0_In700895104, ~b~0=~b~0_In700895104, ~b$w_buff1~0=~b$w_buff1~0_In700895104} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In700895104, ~b$w_buff1_used~0=~b$w_buff1_used~0_In700895104, ~b~0=~b~0_In700895104, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out700895104|, ~b$w_buff1~0=~b$w_buff1~0_In700895104} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 16:48:28,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_51 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{~b~0=v_~b~0_51, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 16:48:28,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~b$r_buff0_thd0~0_In-515522677 256) 0)) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In-515522677 256)))) (or (and (= ~b$w_buff0_used~0_In-515522677 |ULTIMATE.start_main_#t~ite49_Out-515522677|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-515522677|) (not .cse0) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-515522677, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-515522677} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-515522677, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-515522677|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-515522677} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 16:48:28,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse2 (= (mod ~b$w_buff1_used~0_In-1525156330 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd0~0_In-1525156330 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In-1525156330 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In-1525156330 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~b$w_buff1_used~0_In-1525156330 |ULTIMATE.start_main_#t~ite50_Out-1525156330|)) (and (= |ULTIMATE.start_main_#t~ite50_Out-1525156330| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1525156330, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1525156330, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1525156330, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1525156330} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1525156330|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In-1525156330, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1525156330, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1525156330, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1525156330} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 16:48:28,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd0~0_In1303887060 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In1303887060 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1303887060|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite51_Out1303887060| ~b$r_buff0_thd0~0_In1303887060)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1303887060, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1303887060} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1303887060, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1303887060|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1303887060} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 16:48:28,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse2 (= 0 (mod ~b$r_buff1_thd0~0_In-1603551867 256))) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-1603551867 256))) (.cse1 (= (mod ~b$r_buff0_thd0~0_In-1603551867 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In-1603551867 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1603551867|)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-1603551867| ~b$r_buff1_thd0~0_In-1603551867) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1603551867, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1603551867, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1603551867, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1603551867} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1603551867, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1603551867|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1603551867, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1603551867, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1603551867} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 16:48:28,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_19) (= v_~b$r_buff1_thd0~0_185 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= 0 v_~__unbuffered_p0_EAX~0_139) (= v_~__unbuffered_p2_EBX~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_185, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:48:28,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:48:28 BasicIcfg [2019-12-27 16:48:28,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:48:28,113 INFO L168 Benchmark]: Toolchain (without parser) took 148769.07 ms. Allocated memory was 137.9 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 101.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 16:48:28,114 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 16:48:28,115 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.72 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 101.3 MB in the beginning and 154.3 MB in the end (delta: -53.0 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:28,115 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.73 ms. Allocated memory is still 201.3 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:28,115 INFO L168 Benchmark]: Boogie Preprocessor took 39.96 ms. Allocated memory is still 201.3 MB. Free memory was 151.6 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:28,118 INFO L168 Benchmark]: RCFGBuilder took 861.47 ms. Allocated memory is still 201.3 MB. Free memory was 149.6 MB in the beginning and 98.6 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:28,120 INFO L168 Benchmark]: TraceAbstraction took 147043.66 ms. Allocated memory was 201.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 97.9 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 16:48:28,123 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 746.72 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 101.3 MB in the beginning and 154.3 MB in the end (delta: -53.0 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.73 ms. Allocated memory is still 201.3 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.96 ms. Allocated memory is still 201.3 MB. Free memory was 151.6 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 861.47 ms. Allocated memory is still 201.3 MB. Free memory was 149.6 MB in the beginning and 98.6 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 147043.66 ms. Allocated memory was 201.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 97.9 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 180 ProgramPointsBefore, 96 ProgramPointsAfterwards, 217 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7698 VarBasedMoverChecksPositive, 261 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 271 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 83556 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t867, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t868, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t869, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L754] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L780] 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L754] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L781] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L782] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L783] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 3 z = 1 [L797] 3 a = 1 [L800] 3 __unbuffered_p2_EAX = a [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 b$flush_delayed = weak$$choice2 [L806] 3 b$mem_tmp = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L808] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L809] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=1, y=1, z=1] [L809] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L810] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L821] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L822] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L755] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L852] 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L854] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L855] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 146.7s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 62.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7178 SDtfs, 17064 SDslu, 35026 SDs, 0 SdLazy, 26839 SolverSat, 991 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 984 GetRequests, 241 SyntacticMatches, 62 SemanticMatches, 681 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14298 ImplicationChecksByTransitivity, 20.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171775occurred 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: 35.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 241752 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1512 NumberOfCodeBlocks, 1512 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1415 ConstructedInterpolants, 0 QuantifiedInterpolants, 301065 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...