/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/safe005_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:07:02,901 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:07:02,904 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:07:02,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:07:02,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:07:02,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:07:02,925 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:07:02,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:07:02,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:07:02,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:07:02,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:07:02,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:07:02,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:07:02,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:07:02,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:07:02,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:07:02,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:07:02,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:07:02,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:07:02,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:07:02,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:07:02,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:07:02,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:07:02,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:07:02,958 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:07:02,958 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:07:02,958 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:07:02,960 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:07:02,960 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:07:02,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:07:02,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:07:02,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:07:02,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:07:02,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:07:02,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:07:02,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:07:02,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:07:02,971 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:07:02,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:07:02,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:07:02,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:07:02,974 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 18:07:02,994 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:07:02,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:07:02,996 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:07:02,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:07:02,997 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:07:02,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:07:02,997 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:07:02,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:07:02,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:07:02,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:07:02,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:07:02,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:07:02,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:07:03,000 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:07:03,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:07:03,000 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:07:03,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:07:03,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:07:03,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:07:03,001 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:07:03,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:07:03,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:07:03,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:07:03,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:07:03,002 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:07:03,002 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:07:03,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:07:03,003 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:07:03,003 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:07:03,003 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:07:03,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:07:03,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:07:03,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:07:03,276 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:07:03,278 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:07:03,278 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:07:03,280 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_rmo.oepc.i [2019-12-27 18:07:03,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c88b8166/6574ac7b08f349e8bf3500c049730372/FLAGe573fa10f [2019-12-27 18:07:03,926 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:07:03,926 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_rmo.oepc.i [2019-12-27 18:07:03,944 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c88b8166/6574ac7b08f349e8bf3500c049730372/FLAGe573fa10f [2019-12-27 18:07:04,184 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c88b8166/6574ac7b08f349e8bf3500c049730372 [2019-12-27 18:07:04,192 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:07:04,194 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:07:04,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:07:04,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:07:04,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:07:04,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:07:04" (1/1) ... [2019-12-27 18:07:04,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@746c584f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:04, skipping insertion in model container [2019-12-27 18:07:04,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:07:04" (1/1) ... [2019-12-27 18:07:04,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:07:04,272 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:07:04,726 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:07:04,739 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:07:04,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:07:04,943 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:07:04,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:04 WrapperNode [2019-12-27 18:07:04,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:07:04,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:07:04,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:07:04,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:07:04,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:04" (1/1) ... [2019-12-27 18:07:04,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:04" (1/1) ... [2019-12-27 18:07:05,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:07:05,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:07:05,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:07:05,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:07:05,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:04" (1/1) ... [2019-12-27 18:07:05,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:04" (1/1) ... [2019-12-27 18:07:05,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:04" (1/1) ... [2019-12-27 18:07:05,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:04" (1/1) ... [2019-12-27 18:07:05,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:04" (1/1) ... [2019-12-27 18:07:05,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:04" (1/1) ... [2019-12-27 18:07:05,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:04" (1/1) ... [2019-12-27 18:07:05,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:07:05,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:07:05,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:07:05,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:07:05,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:04" (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 18:07:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:07:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:07:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:07:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:07:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:07:05,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:07:05,143 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:07:05,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:07:05,143 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:07:05,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:07:05,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:07:05,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:07:05,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:07:05,146 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 18:07:05,904 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:07:05,905 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:07:05,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:07:05 BoogieIcfgContainer [2019-12-27 18:07:05,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:07:05,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:07:05,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:07:05,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:07:05,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:07:04" (1/3) ... [2019-12-27 18:07:05,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d857f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:07:05, skipping insertion in model container [2019-12-27 18:07:05,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:07:04" (2/3) ... [2019-12-27 18:07:05,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d857f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:07:05, skipping insertion in model container [2019-12-27 18:07:05,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:07:05" (3/3) ... [2019-12-27 18:07:05,916 INFO L109 eAbstractionObserver]: Analyzing ICFG safe005_rmo.oepc.i [2019-12-27 18:07:05,924 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:07:05,925 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:07:05,932 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:07:05,933 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:07:05,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,973 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,974 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:05,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,000 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,000 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,000 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,024 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,024 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,033 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,033 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,033 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,040 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,041 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,046 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,048 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:07:06,070 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:07:06,091 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:07:06,091 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:07:06,091 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:07:06,091 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:07:06,091 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:07:06,091 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:07:06,092 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:07:06,092 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:07:06,108 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 18:07:06,111 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 18:07:06,209 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 18:07:06,210 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:07:06,230 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:07:06,264 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 18:07:06,319 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 18:07:06,319 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:07:06,333 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:07:06,361 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 18:07:06,362 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:07:11,138 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-12-27 18:07:11,951 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 18:07:12,061 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 18:07:12,184 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66367 [2019-12-27 18:07:12,185 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 18:07:12,188 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-27 18:07:24,007 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-27 18:07:24,009 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-27 18:07:24,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:07:24,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:07:24,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:07:24,017 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:07:24,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:07:24,022 INFO L82 PathProgramCache]: Analyzing trace with hash 795562213, now seen corresponding path program 1 times [2019-12-27 18:07:24,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:07:24,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650821921] [2019-12-27 18:07:24,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:07:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:07:24,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 18:07:24,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650821921] [2019-12-27 18:07:24,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:07:24,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:07:24,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [649564533] [2019-12-27 18:07:24,359 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:07:24,364 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:07:24,377 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:07:24,378 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:07:24,381 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:07:24,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:07:24,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:07:24,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:07:24,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:07:24,394 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-27 18:07:27,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:07:27,863 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-27 18:07:27,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:07:27,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:07:27,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:07:28,508 INFO L225 Difference]: With dead ends: 85012 [2019-12-27 18:07:28,509 INFO L226 Difference]: Without dead ends: 80140 [2019-12-27 18:07:28,510 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 18:07:31,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-27 18:07:35,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-27 18:07:35,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-27 18:07:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-27 18:07:36,133 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-27 18:07:36,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:07:36,133 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-27 18:07:36,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:07:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-27 18:07:36,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:07:36,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:07:36,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:07:36,142 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:07:36,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:07:36,142 INFO L82 PathProgramCache]: Analyzing trace with hash -36571135, now seen corresponding path program 1 times [2019-12-27 18:07:36,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:07:36,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086426231] [2019-12-27 18:07:36,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:07:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:07:36,228 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 18:07:36,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086426231] [2019-12-27 18:07:36,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:07:36,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:07:36,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [456146014] [2019-12-27 18:07:36,230 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:07:36,232 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:07:36,238 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:07:36,238 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:07:36,238 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:07:36,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:07:36,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:07:36,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:07:36,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:07:36,241 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-27 18:07:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:07:40,733 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-27 18:07:40,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:07:40,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:07:40,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:07:41,412 INFO L225 Difference]: With dead ends: 123388 [2019-12-27 18:07:41,412 INFO L226 Difference]: Without dead ends: 123290 [2019-12-27 18:07:41,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 18:07:44,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-27 18:07:46,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-27 18:07:46,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-27 18:07:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-27 18:07:47,838 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-27 18:07:47,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:07:47,839 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-27 18:07:47,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:07:47,839 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-27 18:07:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:07:47,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:07:47,842 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:07:47,843 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:07:47,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:07:47,843 INFO L82 PathProgramCache]: Analyzing trace with hash 424299118, now seen corresponding path program 1 times [2019-12-27 18:07:47,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:07:47,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916781638] [2019-12-27 18:07:47,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:07:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:07:47,961 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 18:07:47,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916781638] [2019-12-27 18:07:47,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:07:47,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:07:47,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [936939729] [2019-12-27 18:07:47,962 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:07:47,963 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:07:47,965 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:07:47,965 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:07:47,965 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:07:47,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:07:47,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:07:47,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:07:47,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:07:47,966 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-27 18:07:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:07:53,819 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-27 18:07:53,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:07:53,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:07:53,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:07:54,333 INFO L225 Difference]: With dead ends: 159677 [2019-12-27 18:07:54,333 INFO L226 Difference]: Without dead ends: 159565 [2019-12-27 18:07:54,334 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 18:07:58,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-27 18:08:00,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-27 18:08:00,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-27 18:08:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-27 18:08:01,441 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-27 18:08:01,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:01,442 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-27 18:08:01,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:08:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-27 18:08:01,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:08:01,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:01,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:08:01,448 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:01,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:01,448 INFO L82 PathProgramCache]: Analyzing trace with hash -2100241523, now seen corresponding path program 1 times [2019-12-27 18:08:01,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:01,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840123375] [2019-12-27 18:08:01,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:01,532 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 18:08:01,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840123375] [2019-12-27 18:08:01,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:01,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:08:01,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [969031465] [2019-12-27 18:08:01,533 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:01,535 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:01,538 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:08:01,541 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:01,614 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:08:01,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:08:01,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:01,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:08:01,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:08:01,615 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 5 states. [2019-12-27 18:08:02,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:02,658 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-27 18:08:02,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:08:02,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:08:02,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:09,145 INFO L225 Difference]: With dead ends: 181618 [2019-12-27 18:08:09,146 INFO L226 Difference]: Without dead ends: 181618 [2019-12-27 18:08:09,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:08:13,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-27 18:08:16,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-27 18:08:16,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-27 18:08:16,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-27 18:08:16,809 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-27 18:08:16,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:16,809 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-27 18:08:16,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:08:16,809 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-27 18:08:16,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:08:16,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:16,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:08:16,813 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:16,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:16,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2100376187, now seen corresponding path program 1 times [2019-12-27 18:08:16,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:16,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936271901] [2019-12-27 18:08:16,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:16,916 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 18:08:16,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936271901] [2019-12-27 18:08:16,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:16,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:08:16,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1911780985] [2019-12-27 18:08:16,917 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:16,919 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:16,922 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:08:16,923 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:16,938 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:08:16,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:08:16,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:16,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:08:16,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:08:16,939 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 5 states. [2019-12-27 18:08:19,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:19,216 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-27 18:08:19,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:08:19,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:08:19,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:19,734 INFO L225 Difference]: With dead ends: 179622 [2019-12-27 18:08:19,734 INFO L226 Difference]: Without dead ends: 179542 [2019-12-27 18:08:19,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:08:29,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-27 18:08:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-27 18:08:32,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-27 18:08:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-27 18:08:33,688 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-27 18:08:33,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:33,688 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-27 18:08:33,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:08:33,689 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-27 18:08:33,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:08:33,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:33,692 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:08:33,692 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:33,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:33,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1940234062, now seen corresponding path program 1 times [2019-12-27 18:08:33,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:33,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152863220] [2019-12-27 18:08:33,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:33,737 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 18:08:33,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152863220] [2019-12-27 18:08:33,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:33,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:08:33,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [656264508] [2019-12-27 18:08:33,739 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:33,741 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:33,744 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:08:33,745 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:33,760 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:08:33,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:08:33,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:33,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:08:33,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:08:33,761 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 5 states. [2019-12-27 18:08:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:34,964 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-27 18:08:34,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:08:34,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:08:34,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:42,114 INFO L225 Difference]: With dead ends: 189091 [2019-12-27 18:08:42,114 INFO L226 Difference]: Without dead ends: 188995 [2019-12-27 18:08:42,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:08:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-27 18:08:48,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-27 18:08:48,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-27 18:08:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-27 18:08:49,272 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-27 18:08:49,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:49,272 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-27 18:08:49,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:08:49,272 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-27 18:08:49,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 18:08:49,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:49,292 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:08:49,293 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:49,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:49,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1828891691, now seen corresponding path program 1 times [2019-12-27 18:08:49,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:49,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410252494] [2019-12-27 18:08:49,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:49,338 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 18:08:49,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410252494] [2019-12-27 18:08:49,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:49,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:08:49,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1654155017] [2019-12-27 18:08:49,339 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:49,341 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:49,344 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 18:08:49,344 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:49,344 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:08:49,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:08:49,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:49,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:08:49,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:08:49,345 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-27 18:08:51,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:51,312 INFO L93 Difference]: Finished difference Result 160940 states and 664422 transitions. [2019-12-27 18:08:51,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:08:51,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 18:08:51,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:51,813 INFO L225 Difference]: With dead ends: 160940 [2019-12-27 18:08:51,813 INFO L226 Difference]: Without dead ends: 160940 [2019-12-27 18:08:51,813 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 18:09:01,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160940 states. [2019-12-27 18:09:03,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160940 to 160940. [2019-12-27 18:09:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160940 states. [2019-12-27 18:09:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160940 states to 160940 states and 664422 transitions. [2019-12-27 18:09:05,300 INFO L78 Accepts]: Start accepts. Automaton has 160940 states and 664422 transitions. Word has length 18 [2019-12-27 18:09:05,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:05,300 INFO L462 AbstractCegarLoop]: Abstraction has 160940 states and 664422 transitions. [2019-12-27 18:09:05,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:09:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand 160940 states and 664422 transitions. [2019-12-27 18:09:05,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:09:05,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:05,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:09:05,322 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:05,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:05,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2025528817, now seen corresponding path program 1 times [2019-12-27 18:09:05,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:05,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599235594] [2019-12-27 18:09:05,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:05,385 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 18:09:05,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599235594] [2019-12-27 18:09:05,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:05,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:09:05,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [956512165] [2019-12-27 18:09:05,386 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:05,389 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:05,392 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 50 transitions. [2019-12-27 18:09:05,392 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:05,407 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:09:05,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:09:05,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:05,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:09:05,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:09:05,408 INFO L87 Difference]: Start difference. First operand 160940 states and 664422 transitions. Second operand 5 states. [2019-12-27 18:09:13,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:13,535 INFO L93 Difference]: Finished difference Result 383501 states and 1595297 transitions. [2019-12-27 18:09:13,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:09:13,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 18:09:13,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:15,041 INFO L225 Difference]: With dead ends: 383501 [2019-12-27 18:09:15,041 INFO L226 Difference]: Without dead ends: 256533 [2019-12-27 18:09:15,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:09:24,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256533 states. [2019-12-27 18:09:27,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256533 to 171713. [2019-12-27 18:09:27,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171713 states. [2019-12-27 18:09:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171713 states to 171713 states and 702115 transitions. [2019-12-27 18:09:28,870 INFO L78 Accepts]: Start accepts. Automaton has 171713 states and 702115 transitions. Word has length 19 [2019-12-27 18:09:28,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:28,870 INFO L462 AbstractCegarLoop]: Abstraction has 171713 states and 702115 transitions. [2019-12-27 18:09:28,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:09:28,870 INFO L276 IsEmpty]: Start isEmpty. Operand 171713 states and 702115 transitions. [2019-12-27 18:09:28,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:09:28,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:28,888 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:09:28,888 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:28,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:28,889 INFO L82 PathProgramCache]: Analyzing trace with hash 550104482, now seen corresponding path program 1 times [2019-12-27 18:09:28,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:28,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675790136] [2019-12-27 18:09:28,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:28,958 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 18:09:28,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675790136] [2019-12-27 18:09:28,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:28,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:09:28,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [518544819] [2019-12-27 18:09:28,961 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:28,965 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:28,968 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 31 transitions. [2019-12-27 18:09:28,969 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:29,003 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:09:29,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:09:29,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:29,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:09:29,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:09:29,005 INFO L87 Difference]: Start difference. First operand 171713 states and 702115 transitions. Second operand 5 states. [2019-12-27 18:09:29,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:29,421 INFO L93 Difference]: Finished difference Result 52005 states and 178102 transitions. [2019-12-27 18:09:29,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:09:29,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 18:09:29,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:29,499 INFO L225 Difference]: With dead ends: 52005 [2019-12-27 18:09:29,499 INFO L226 Difference]: Without dead ends: 41010 [2019-12-27 18:09:29,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:09:29,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41010 states. [2019-12-27 18:09:31,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41010 to 37941. [2019-12-27 18:09:31,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37941 states. [2019-12-27 18:09:31,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37941 states to 37941 states and 125252 transitions. [2019-12-27 18:09:31,391 INFO L78 Accepts]: Start accepts. Automaton has 37941 states and 125252 transitions. Word has length 19 [2019-12-27 18:09:31,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:31,392 INFO L462 AbstractCegarLoop]: Abstraction has 37941 states and 125252 transitions. [2019-12-27 18:09:31,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:09:31,392 INFO L276 IsEmpty]: Start isEmpty. Operand 37941 states and 125252 transitions. [2019-12-27 18:09:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:09:31,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:31,398 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 18:09:31,399 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:31,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:31,399 INFO L82 PathProgramCache]: Analyzing trace with hash -70181007, now seen corresponding path program 1 times [2019-12-27 18:09:31,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:31,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854885326] [2019-12-27 18:09:31,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:09:31,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854885326] [2019-12-27 18:09:31,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:31,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:09:31,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [452819184] [2019-12-27 18:09:31,465 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:31,468 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:31,479 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 102 transitions. [2019-12-27 18:09:31,480 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:31,480 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:09:31,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:09:31,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:31,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:09:31,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:09:31,481 INFO L87 Difference]: Start difference. First operand 37941 states and 125252 transitions. Second operand 5 states. [2019-12-27 18:09:32,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:32,030 INFO L93 Difference]: Finished difference Result 50773 states and 164800 transitions. [2019-12-27 18:09:32,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:09:32,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 18:09:32,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:32,116 INFO L225 Difference]: With dead ends: 50773 [2019-12-27 18:09:32,116 INFO L226 Difference]: Without dead ends: 50471 [2019-12-27 18:09:32,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:09:32,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50471 states. [2019-12-27 18:09:35,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50471 to 38659. [2019-12-27 18:09:35,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38659 states. [2019-12-27 18:09:35,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38659 states to 38659 states and 127563 transitions. [2019-12-27 18:09:35,770 INFO L78 Accepts]: Start accepts. Automaton has 38659 states and 127563 transitions. Word has length 22 [2019-12-27 18:09:35,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:35,770 INFO L462 AbstractCegarLoop]: Abstraction has 38659 states and 127563 transitions. [2019-12-27 18:09:35,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:09:35,770 INFO L276 IsEmpty]: Start isEmpty. Operand 38659 states and 127563 transitions. [2019-12-27 18:09:35,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:09:35,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:35,777 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 18:09:35,777 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:35,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:35,778 INFO L82 PathProgramCache]: Analyzing trace with hash -633645132, now seen corresponding path program 1 times [2019-12-27 18:09:35,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:35,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293868268] [2019-12-27 18:09:35,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:35,859 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 18:09:35,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293868268] [2019-12-27 18:09:35,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:35,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:09:35,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [735395937] [2019-12-27 18:09:35,860 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:35,864 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:35,876 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 92 transitions. [2019-12-27 18:09:35,876 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:35,932 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:09:35,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:09:35,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:35,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:09:35,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:09:35,933 INFO L87 Difference]: Start difference. First operand 38659 states and 127563 transitions. Second operand 6 states. [2019-12-27 18:09:36,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:36,883 INFO L93 Difference]: Finished difference Result 75469 states and 247696 transitions. [2019-12-27 18:09:36,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 18:09:36,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 18:09:36,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:37,016 INFO L225 Difference]: With dead ends: 75469 [2019-12-27 18:09:37,017 INFO L226 Difference]: Without dead ends: 75049 [2019-12-27 18:09:37,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:09:37,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75049 states. [2019-12-27 18:09:38,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75049 to 36650. [2019-12-27 18:09:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36650 states. [2019-12-27 18:09:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36650 states to 36650 states and 120885 transitions. [2019-12-27 18:09:38,213 INFO L78 Accepts]: Start accepts. Automaton has 36650 states and 120885 transitions. Word has length 22 [2019-12-27 18:09:38,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:38,213 INFO L462 AbstractCegarLoop]: Abstraction has 36650 states and 120885 transitions. [2019-12-27 18:09:38,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:09:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 36650 states and 120885 transitions. [2019-12-27 18:09:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:09:38,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:38,224 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 18:09:38,225 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:38,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:38,225 INFO L82 PathProgramCache]: Analyzing trace with hash 400071569, now seen corresponding path program 1 times [2019-12-27 18:09:38,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:38,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038863079] [2019-12-27 18:09:38,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:38,296 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 18:09:38,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038863079] [2019-12-27 18:09:38,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:38,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:09:38,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [92627611] [2019-12-27 18:09:38,297 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:38,300 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:38,305 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:09:38,305 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:38,305 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:09:38,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:09:38,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:38,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:09:38,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:09:38,307 INFO L87 Difference]: Start difference. First operand 36650 states and 120885 transitions. Second operand 5 states. [2019-12-27 18:09:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:39,013 INFO L93 Difference]: Finished difference Result 50791 states and 163979 transitions. [2019-12-27 18:09:39,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:09:39,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 18:09:39,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:39,138 INFO L225 Difference]: With dead ends: 50791 [2019-12-27 18:09:39,138 INFO L226 Difference]: Without dead ends: 50351 [2019-12-27 18:09:39,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:09:39,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50351 states. [2019-12-27 18:09:39,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50351 to 41268. [2019-12-27 18:09:39,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41268 states. [2019-12-27 18:09:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41268 states to 41268 states and 135281 transitions. [2019-12-27 18:09:39,924 INFO L78 Accepts]: Start accepts. Automaton has 41268 states and 135281 transitions. Word has length 25 [2019-12-27 18:09:39,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:39,925 INFO L462 AbstractCegarLoop]: Abstraction has 41268 states and 135281 transitions. [2019-12-27 18:09:39,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:09:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 41268 states and 135281 transitions. [2019-12-27 18:09:39,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 18:09:39,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:39,944 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:09:39,944 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:39,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:39,945 INFO L82 PathProgramCache]: Analyzing trace with hash -819070516, now seen corresponding path program 1 times [2019-12-27 18:09:39,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:39,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237315381] [2019-12-27 18:09:39,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:40,014 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 18:09:40,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237315381] [2019-12-27 18:09:40,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:40,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:09:40,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [77518926] [2019-12-27 18:09:40,016 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:40,020 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:40,046 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 18:09:40,046 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:40,316 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-12-27 18:09:40,353 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:09:40,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:09:40,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:40,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:09:40,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:09:40,354 INFO L87 Difference]: Start difference. First operand 41268 states and 135281 transitions. Second operand 7 states. [2019-12-27 18:09:40,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:40,976 INFO L93 Difference]: Finished difference Result 51734 states and 167995 transitions. [2019-12-27 18:09:40,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:09:40,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-12-27 18:09:40,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:41,068 INFO L225 Difference]: With dead ends: 51734 [2019-12-27 18:09:41,068 INFO L226 Difference]: Without dead ends: 51360 [2019-12-27 18:09:41,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:09:41,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51360 states. [2019-12-27 18:09:41,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51360 to 43047. [2019-12-27 18:09:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43047 states. [2019-12-27 18:09:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43047 states to 43047 states and 141093 transitions. [2019-12-27 18:09:41,833 INFO L78 Accepts]: Start accepts. Automaton has 43047 states and 141093 transitions. Word has length 28 [2019-12-27 18:09:41,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:41,833 INFO L462 AbstractCegarLoop]: Abstraction has 43047 states and 141093 transitions. [2019-12-27 18:09:41,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:09:41,834 INFO L276 IsEmpty]: Start isEmpty. Operand 43047 states and 141093 transitions. [2019-12-27 18:09:41,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 18:09:41,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:41,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:09:41,853 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:41,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:41,854 INFO L82 PathProgramCache]: Analyzing trace with hash 377940687, now seen corresponding path program 1 times [2019-12-27 18:09:41,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:41,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322978909] [2019-12-27 18:09:41,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:41,904 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 18:09:41,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322978909] [2019-12-27 18:09:41,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:41,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:09:41,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [532680709] [2019-12-27 18:09:41,905 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:41,910 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:41,933 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 18:09:41,933 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:41,991 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:09:41,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:09:41,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:41,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:09:41,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:09:41,992 INFO L87 Difference]: Start difference. First operand 43047 states and 141093 transitions. Second operand 7 states. [2019-12-27 18:09:42,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:42,630 INFO L93 Difference]: Finished difference Result 54015 states and 175600 transitions. [2019-12-27 18:09:42,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:09:42,631 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-12-27 18:09:42,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:42,726 INFO L225 Difference]: With dead ends: 54015 [2019-12-27 18:09:42,726 INFO L226 Difference]: Without dead ends: 54015 [2019-12-27 18:09:42,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:09:42,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54015 states. [2019-12-27 18:09:43,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54015 to 44513. [2019-12-27 18:09:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44513 states. [2019-12-27 18:09:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44513 states to 44513 states and 143418 transitions. [2019-12-27 18:09:43,503 INFO L78 Accepts]: Start accepts. Automaton has 44513 states and 143418 transitions. Word has length 28 [2019-12-27 18:09:43,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:43,503 INFO L462 AbstractCegarLoop]: Abstraction has 44513 states and 143418 transitions. [2019-12-27 18:09:43,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:09:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 44513 states and 143418 transitions. [2019-12-27 18:09:43,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 18:09:43,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:43,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] [2019-12-27 18:09:43,523 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:43,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:43,524 INFO L82 PathProgramCache]: Analyzing trace with hash -589973380, now seen corresponding path program 1 times [2019-12-27 18:09:43,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:43,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463482459] [2019-12-27 18:09:43,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:43,588 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 18:09:43,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463482459] [2019-12-27 18:09:43,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:43,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:09:43,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [101962655] [2019-12-27 18:09:43,590 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:43,595 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:43,625 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 157 transitions. [2019-12-27 18:09:43,626 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:43,662 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:09:43,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:09:43,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:43,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:09:43,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:09:43,663 INFO L87 Difference]: Start difference. First operand 44513 states and 143418 transitions. Second operand 7 states. [2019-12-27 18:09:44,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:44,338 INFO L93 Difference]: Finished difference Result 55187 states and 176165 transitions. [2019-12-27 18:09:44,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:09:44,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-12-27 18:09:44,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:44,501 INFO L225 Difference]: With dead ends: 55187 [2019-12-27 18:09:44,502 INFO L226 Difference]: Without dead ends: 54793 [2019-12-27 18:09:44,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:09:45,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54793 states. [2019-12-27 18:09:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54793 to 43795. [2019-12-27 18:09:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43795 states. [2019-12-27 18:09:45,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43795 states to 43795 states and 140903 transitions. [2019-12-27 18:09:45,763 INFO L78 Accepts]: Start accepts. Automaton has 43795 states and 140903 transitions. Word has length 29 [2019-12-27 18:09:45,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:45,763 INFO L462 AbstractCegarLoop]: Abstraction has 43795 states and 140903 transitions. [2019-12-27 18:09:45,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:09:45,763 INFO L276 IsEmpty]: Start isEmpty. Operand 43795 states and 140903 transitions. [2019-12-27 18:09:45,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 18:09:45,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:45,782 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] [2019-12-27 18:09:45,782 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:45,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:45,783 INFO L82 PathProgramCache]: Analyzing trace with hash -934002539, now seen corresponding path program 1 times [2019-12-27 18:09:45,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:45,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393660806] [2019-12-27 18:09:45,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:45,818 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 18:09:45,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393660806] [2019-12-27 18:09:45,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:45,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:09:45,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1916836038] [2019-12-27 18:09:45,819 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:45,823 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:45,838 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 111 transitions. [2019-12-27 18:09:45,838 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:45,850 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:09:45,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:09:45,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:45,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:09:45,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:09:45,852 INFO L87 Difference]: Start difference. First operand 43795 states and 140903 transitions. Second operand 4 states. [2019-12-27 18:09:46,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:46,091 INFO L93 Difference]: Finished difference Result 67942 states and 220761 transitions. [2019-12-27 18:09:46,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:09:46,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-27 18:09:46,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:46,147 INFO L225 Difference]: With dead ends: 67942 [2019-12-27 18:09:46,147 INFO L226 Difference]: Without dead ends: 32397 [2019-12-27 18:09:46,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:09:46,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32397 states. [2019-12-27 18:09:46,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32397 to 31522. [2019-12-27 18:09:46,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31522 states. [2019-12-27 18:09:47,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31522 states to 31522 states and 100287 transitions. [2019-12-27 18:09:47,007 INFO L78 Accepts]: Start accepts. Automaton has 31522 states and 100287 transitions. Word has length 29 [2019-12-27 18:09:47,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:47,007 INFO L462 AbstractCegarLoop]: Abstraction has 31522 states and 100287 transitions. [2019-12-27 18:09:47,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:09:47,007 INFO L276 IsEmpty]: Start isEmpty. Operand 31522 states and 100287 transitions. [2019-12-27 18:09:47,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 18:09:47,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:47,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:09:47,020 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:47,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:47,020 INFO L82 PathProgramCache]: Analyzing trace with hash -2124026772, now seen corresponding path program 1 times [2019-12-27 18:09:47,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:47,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032282951] [2019-12-27 18:09:47,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:47,079 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 18:09:47,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032282951] [2019-12-27 18:09:47,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:47,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:09:47,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2047775485] [2019-12-27 18:09:47,080 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:47,084 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:47,092 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 52 transitions. [2019-12-27 18:09:47,092 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:47,101 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:09:47,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:09:47,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:47,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:09:47,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:09:47,103 INFO L87 Difference]: Start difference. First operand 31522 states and 100287 transitions. Second operand 5 states. [2019-12-27 18:09:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:47,683 INFO L93 Difference]: Finished difference Result 70384 states and 230715 transitions. [2019-12-27 18:09:47,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:09:47,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 18:09:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:47,758 INFO L225 Difference]: With dead ends: 70384 [2019-12-27 18:09:47,758 INFO L226 Difference]: Without dead ends: 42005 [2019-12-27 18:09:47,758 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 18:09:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42005 states. [2019-12-27 18:09:48,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42005 to 24904. [2019-12-27 18:09:48,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24904 states. [2019-12-27 18:09:48,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24904 states to 24904 states and 81632 transitions. [2019-12-27 18:09:48,309 INFO L78 Accepts]: Start accepts. Automaton has 24904 states and 81632 transitions. Word has length 30 [2019-12-27 18:09:48,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:48,309 INFO L462 AbstractCegarLoop]: Abstraction has 24904 states and 81632 transitions. [2019-12-27 18:09:48,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:09:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand 24904 states and 81632 transitions. [2019-12-27 18:09:48,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 18:09:48,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:48,323 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:09:48,323 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:48,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:48,324 INFO L82 PathProgramCache]: Analyzing trace with hash -936488553, now seen corresponding path program 1 times [2019-12-27 18:09:48,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:48,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193246179] [2019-12-27 18:09:48,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:48,388 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 18:09:48,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193246179] [2019-12-27 18:09:48,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:48,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:09:48,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [891860642] [2019-12-27 18:09:48,389 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:48,398 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:48,416 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 114 transitions. [2019-12-27 18:09:48,416 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:48,505 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:09:48,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:09:48,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:48,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:09:48,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:09:48,506 INFO L87 Difference]: Start difference. First operand 24904 states and 81632 transitions. Second operand 8 states. [2019-12-27 18:09:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:49,369 INFO L93 Difference]: Finished difference Result 40035 states and 129044 transitions. [2019-12-27 18:09:49,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:09:49,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-12-27 18:09:49,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:49,433 INFO L225 Difference]: With dead ends: 40035 [2019-12-27 18:09:49,433 INFO L226 Difference]: Without dead ends: 40035 [2019-12-27 18:09:49,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:09:49,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40035 states. [2019-12-27 18:09:49,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40035 to 32700. [2019-12-27 18:09:49,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32700 states. [2019-12-27 18:09:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32700 states to 32700 states and 106238 transitions. [2019-12-27 18:09:50,013 INFO L78 Accepts]: Start accepts. Automaton has 32700 states and 106238 transitions. Word has length 30 [2019-12-27 18:09:50,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:50,013 INFO L462 AbstractCegarLoop]: Abstraction has 32700 states and 106238 transitions. [2019-12-27 18:09:50,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:09:50,014 INFO L276 IsEmpty]: Start isEmpty. Operand 32700 states and 106238 transitions. [2019-12-27 18:09:50,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 18:09:50,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:50,036 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] [2019-12-27 18:09:50,036 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:50,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:50,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1151300207, now seen corresponding path program 1 times [2019-12-27 18:09:50,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:50,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876488651] [2019-12-27 18:09:50,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:50,099 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 18:09:50,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876488651] [2019-12-27 18:09:50,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:50,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:09:50,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [266238984] [2019-12-27 18:09:50,100 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:50,105 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:50,125 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 119 transitions. [2019-12-27 18:09:50,125 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:50,141 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:09:50,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:09:50,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:50,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:09:50,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:09:50,142 INFO L87 Difference]: Start difference. First operand 32700 states and 106238 transitions. Second operand 6 states. [2019-12-27 18:09:50,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:50,258 INFO L93 Difference]: Finished difference Result 15040 states and 45214 transitions. [2019-12-27 18:09:50,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:09:50,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-27 18:09:50,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:50,275 INFO L225 Difference]: With dead ends: 15040 [2019-12-27 18:09:50,275 INFO L226 Difference]: Without dead ends: 12648 [2019-12-27 18:09:50,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:09:50,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12648 states. [2019-12-27 18:09:50,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12648 to 12434. [2019-12-27 18:09:50,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12434 states. [2019-12-27 18:09:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12434 states to 12434 states and 37089 transitions. [2019-12-27 18:09:50,447 INFO L78 Accepts]: Start accepts. Automaton has 12434 states and 37089 transitions. Word has length 31 [2019-12-27 18:09:50,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:50,448 INFO L462 AbstractCegarLoop]: Abstraction has 12434 states and 37089 transitions. [2019-12-27 18:09:50,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:09:50,448 INFO L276 IsEmpty]: Start isEmpty. Operand 12434 states and 37089 transitions. [2019-12-27 18:09:50,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:09:50,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:50,459 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 18:09:50,460 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:50,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:50,460 INFO L82 PathProgramCache]: Analyzing trace with hash -134226549, now seen corresponding path program 1 times [2019-12-27 18:09:50,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:50,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087534236] [2019-12-27 18:09:50,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:50,551 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 18:09:50,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087534236] [2019-12-27 18:09:50,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:50,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:09:50,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1424254790] [2019-12-27 18:09:50,552 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:50,561 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:50,608 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 152 transitions. [2019-12-27 18:09:50,608 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:50,622 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:09:50,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:09:50,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:50,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:09:50,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:09:50,624 INFO L87 Difference]: Start difference. First operand 12434 states and 37089 transitions. Second operand 6 states. [2019-12-27 18:09:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:50,871 INFO L93 Difference]: Finished difference Result 12560 states and 37323 transitions. [2019-12-27 18:09:50,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:09:50,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 18:09:50,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:50,890 INFO L225 Difference]: With dead ends: 12560 [2019-12-27 18:09:50,890 INFO L226 Difference]: Without dead ends: 12333 [2019-12-27 18:09:50,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:09:50,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12333 states. [2019-12-27 18:09:51,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12333 to 12333. [2019-12-27 18:09:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12333 states. [2019-12-27 18:09:51,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12333 states to 12333 states and 36878 transitions. [2019-12-27 18:09:51,162 INFO L78 Accepts]: Start accepts. Automaton has 12333 states and 36878 transitions. Word has length 40 [2019-12-27 18:09:51,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:51,162 INFO L462 AbstractCegarLoop]: Abstraction has 12333 states and 36878 transitions. [2019-12-27 18:09:51,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:09:51,162 INFO L276 IsEmpty]: Start isEmpty. Operand 12333 states and 36878 transitions. [2019-12-27 18:09:51,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:09:51,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:09:51,175 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:51,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:51,175 INFO L82 PathProgramCache]: Analyzing trace with hash 809189858, now seen corresponding path program 1 times [2019-12-27 18:09:51,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:51,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292876169] [2019-12-27 18:09:51,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:51,251 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 18:09:51,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292876169] [2019-12-27 18:09:51,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:51,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:09:51,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [804193778] [2019-12-27 18:09:51,252 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:51,261 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:51,301 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 162 transitions. [2019-12-27 18:09:51,301 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:51,363 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 18:09:51,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:09:51,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:51,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:09:51,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:09:51,364 INFO L87 Difference]: Start difference. First operand 12333 states and 36878 transitions. Second operand 9 states. [2019-12-27 18:09:52,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:52,953 INFO L93 Difference]: Finished difference Result 42008 states and 123572 transitions. [2019-12-27 18:09:52,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 18:09:52,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-12-27 18:09:52,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:53,014 INFO L225 Difference]: With dead ends: 42008 [2019-12-27 18:09:53,015 INFO L226 Difference]: Without dead ends: 42008 [2019-12-27 18:09:53,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-12-27 18:09:53,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42008 states. [2019-12-27 18:09:53,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42008 to 14381. [2019-12-27 18:09:53,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14381 states. [2019-12-27 18:09:53,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14381 states to 14381 states and 43273 transitions. [2019-12-27 18:09:53,407 INFO L78 Accepts]: Start accepts. Automaton has 14381 states and 43273 transitions. Word has length 40 [2019-12-27 18:09:53,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:53,407 INFO L462 AbstractCegarLoop]: Abstraction has 14381 states and 43273 transitions. [2019-12-27 18:09:53,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:09:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 14381 states and 43273 transitions. [2019-12-27 18:09:53,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:09:53,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:53,423 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 18:09:53,423 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:53,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:53,423 INFO L82 PathProgramCache]: Analyzing trace with hash -2114152388, now seen corresponding path program 2 times [2019-12-27 18:09:53,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:53,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121905465] [2019-12-27 18:09:53,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:53,479 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 18:09:53,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121905465] [2019-12-27 18:09:53,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:53,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:09:53,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [992937297] [2019-12-27 18:09:53,480 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:53,488 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:53,540 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 199 transitions. [2019-12-27 18:09:53,540 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:53,541 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:09:53,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:09:53,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:53,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:09:53,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:09:53,543 INFO L87 Difference]: Start difference. First operand 14381 states and 43273 transitions. Second operand 3 states. [2019-12-27 18:09:53,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:53,633 INFO L93 Difference]: Finished difference Result 14295 states and 42973 transitions. [2019-12-27 18:09:53,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:09:53,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 18:09:53,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:53,668 INFO L225 Difference]: With dead ends: 14295 [2019-12-27 18:09:53,668 INFO L226 Difference]: Without dead ends: 14295 [2019-12-27 18:09:53,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:09:53,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14295 states. [2019-12-27 18:09:53,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14295 to 11887. [2019-12-27 18:09:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11887 states. [2019-12-27 18:09:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11887 states to 11887 states and 36097 transitions. [2019-12-27 18:09:54,002 INFO L78 Accepts]: Start accepts. Automaton has 11887 states and 36097 transitions. Word has length 40 [2019-12-27 18:09:54,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:54,003 INFO L462 AbstractCegarLoop]: Abstraction has 11887 states and 36097 transitions. [2019-12-27 18:09:54,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:09:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 11887 states and 36097 transitions. [2019-12-27 18:09:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:09:54,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:54,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:09:54,021 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:54,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:54,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1136448647, now seen corresponding path program 1 times [2019-12-27 18:09:54,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:54,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843860544] [2019-12-27 18:09:54,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:54,112 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 18:09:54,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843860544] [2019-12-27 18:09:54,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:54,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:09:54,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [880159132] [2019-12-27 18:09:54,113 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:54,127 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:54,277 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 161 transitions. [2019-12-27 18:09:54,277 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:54,358 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:09:54,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:09:54,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:54,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:09:54,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:09:54,359 INFO L87 Difference]: Start difference. First operand 11887 states and 36097 transitions. Second operand 7 states. [2019-12-27 18:09:55,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:55,168 INFO L93 Difference]: Finished difference Result 20868 states and 62620 transitions. [2019-12-27 18:09:55,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 18:09:55,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 18:09:55,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:55,198 INFO L225 Difference]: With dead ends: 20868 [2019-12-27 18:09:55,198 INFO L226 Difference]: Without dead ends: 20527 [2019-12-27 18:09:55,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:09:55,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20527 states. [2019-12-27 18:09:55,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20527 to 12343. [2019-12-27 18:09:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12343 states. [2019-12-27 18:09:55,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12343 states to 12343 states and 37665 transitions. [2019-12-27 18:09:55,441 INFO L78 Accepts]: Start accepts. Automaton has 12343 states and 37665 transitions. Word has length 41 [2019-12-27 18:09:55,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:55,441 INFO L462 AbstractCegarLoop]: Abstraction has 12343 states and 37665 transitions. [2019-12-27 18:09:55,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:09:55,441 INFO L276 IsEmpty]: Start isEmpty. Operand 12343 states and 37665 transitions. [2019-12-27 18:09:55,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:09:55,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:55,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:09:55,453 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:55,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:55,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1425122982, now seen corresponding path program 1 times [2019-12-27 18:09:55,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:55,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133257595] [2019-12-27 18:09:55,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:55,505 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 18:09:55,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133257595] [2019-12-27 18:09:55,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:55,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:09:55,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [397115579] [2019-12-27 18:09:55,506 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:55,515 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:55,557 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 163 transitions. [2019-12-27 18:09:55,557 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:55,566 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:09:55,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:09:55,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:55,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:09:55,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:09:55,567 INFO L87 Difference]: Start difference. First operand 12343 states and 37665 transitions. Second operand 4 states. [2019-12-27 18:09:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:55,804 INFO L93 Difference]: Finished difference Result 13513 states and 39746 transitions. [2019-12-27 18:09:55,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:09:55,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-27 18:09:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:55,833 INFO L225 Difference]: With dead ends: 13513 [2019-12-27 18:09:55,833 INFO L226 Difference]: Without dead ends: 13513 [2019-12-27 18:09:55,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 18:09:55,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13513 states. [2019-12-27 18:09:56,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13513 to 9787. [2019-12-27 18:09:56,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9787 states. [2019-12-27 18:09:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9787 states to 9787 states and 29069 transitions. [2019-12-27 18:09:56,035 INFO L78 Accepts]: Start accepts. Automaton has 9787 states and 29069 transitions. Word has length 41 [2019-12-27 18:09:56,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:56,036 INFO L462 AbstractCegarLoop]: Abstraction has 9787 states and 29069 transitions. [2019-12-27 18:09:56,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:09:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand 9787 states and 29069 transitions. [2019-12-27 18:09:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 18:09:56,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:56,046 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] [2019-12-27 18:09:56,046 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:56,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:56,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1119333898, now seen corresponding path program 1 times [2019-12-27 18:09:56,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:56,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851884709] [2019-12-27 18:09:56,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:56,114 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 18:09:56,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851884709] [2019-12-27 18:09:56,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:56,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:09:56,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [329062223] [2019-12-27 18:09:56,115 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:56,124 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:56,166 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 152 transitions. [2019-12-27 18:09:56,166 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:56,168 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:09:56,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:09:56,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:56,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:09:56,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:09:56,169 INFO L87 Difference]: Start difference. First operand 9787 states and 29069 transitions. Second operand 6 states. [2019-12-27 18:09:56,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:56,258 INFO L93 Difference]: Finished difference Result 8711 states and 26510 transitions. [2019-12-27 18:09:56,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:09:56,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 18:09:56,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:56,273 INFO L225 Difference]: With dead ends: 8711 [2019-12-27 18:09:56,273 INFO L226 Difference]: Without dead ends: 8597 [2019-12-27 18:09:56,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:09:56,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8597 states. [2019-12-27 18:09:56,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8597 to 8170. [2019-12-27 18:09:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8170 states. [2019-12-27 18:09:56,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8170 states to 8170 states and 25100 transitions. [2019-12-27 18:09:56,393 INFO L78 Accepts]: Start accepts. Automaton has 8170 states and 25100 transitions. Word has length 42 [2019-12-27 18:09:56,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:56,394 INFO L462 AbstractCegarLoop]: Abstraction has 8170 states and 25100 transitions. [2019-12-27 18:09:56,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:09:56,394 INFO L276 IsEmpty]: Start isEmpty. Operand 8170 states and 25100 transitions. [2019-12-27 18:09:56,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:09:56,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:56,402 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] [2019-12-27 18:09:56,402 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:56,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:56,402 INFO L82 PathProgramCache]: Analyzing trace with hash 259489780, now seen corresponding path program 1 times [2019-12-27 18:09:56,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:56,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958718594] [2019-12-27 18:09:56,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:56,508 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 18:09:56,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958718594] [2019-12-27 18:09:56,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:56,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 18:09:56,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1408670689] [2019-12-27 18:09:56,509 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:56,524 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:56,647 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 192 states and 359 transitions. [2019-12-27 18:09:56,648 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:56,831 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 18:09:56,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:09:56,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:56,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:09:56,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:09:56,833 INFO L87 Difference]: Start difference. First operand 8170 states and 25100 transitions. Second operand 11 states. [2019-12-27 18:09:58,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:58,181 INFO L93 Difference]: Finished difference Result 15545 states and 46870 transitions. [2019-12-27 18:09:58,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 18:09:58,182 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 18:09:58,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:58,198 INFO L225 Difference]: With dead ends: 15545 [2019-12-27 18:09:58,198 INFO L226 Difference]: Without dead ends: 10252 [2019-12-27 18:09:58,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-12-27 18:09:58,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10252 states. [2019-12-27 18:09:58,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10252 to 9668. [2019-12-27 18:09:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9668 states. [2019-12-27 18:09:58,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9668 states to 9668 states and 29051 transitions. [2019-12-27 18:09:58,344 INFO L78 Accepts]: Start accepts. Automaton has 9668 states and 29051 transitions. Word has length 56 [2019-12-27 18:09:58,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:58,345 INFO L462 AbstractCegarLoop]: Abstraction has 9668 states and 29051 transitions. [2019-12-27 18:09:58,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:09:58,345 INFO L276 IsEmpty]: Start isEmpty. Operand 9668 states and 29051 transitions. [2019-12-27 18:09:58,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:09:58,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:58,355 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] [2019-12-27 18:09:58,355 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:58,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:58,356 INFO L82 PathProgramCache]: Analyzing trace with hash 425157206, now seen corresponding path program 2 times [2019-12-27 18:09:58,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:58,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085057611] [2019-12-27 18:09:58,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:58,571 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 18:09:58,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085057611] [2019-12-27 18:09:58,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:58,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 18:09:58,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [153751512] [2019-12-27 18:09:58,572 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:58,589 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:58,741 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 288 transitions. [2019-12-27 18:09:58,741 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:58,987 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 18:09:58,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 18:09:58,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:58,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 18:09:58,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-12-27 18:09:58,989 INFO L87 Difference]: Start difference. First operand 9668 states and 29051 transitions. Second operand 18 states. [2019-12-27 18:10:03,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:10:03,292 INFO L93 Difference]: Finished difference Result 26301 states and 79116 transitions. [2019-12-27 18:10:03,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-27 18:10:03,297 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-27 18:10:03,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:10:03,322 INFO L225 Difference]: With dead ends: 26301 [2019-12-27 18:10:03,322 INFO L226 Difference]: Without dead ends: 18496 [2019-12-27 18:10:03,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=748, Invalid=3944, Unknown=0, NotChecked=0, Total=4692 [2019-12-27 18:10:03,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18496 states. [2019-12-27 18:10:03,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18496 to 11798. [2019-12-27 18:10:03,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11798 states. [2019-12-27 18:10:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11798 states to 11798 states and 35264 transitions. [2019-12-27 18:10:03,545 INFO L78 Accepts]: Start accepts. Automaton has 11798 states and 35264 transitions. Word has length 56 [2019-12-27 18:10:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:10:03,545 INFO L462 AbstractCegarLoop]: Abstraction has 11798 states and 35264 transitions. [2019-12-27 18:10:03,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 18:10:03,545 INFO L276 IsEmpty]: Start isEmpty. Operand 11798 states and 35264 transitions. [2019-12-27 18:10:03,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:10:03,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:10:03,558 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] [2019-12-27 18:10:03,559 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:10:03,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:10:03,559 INFO L82 PathProgramCache]: Analyzing trace with hash 918799478, now seen corresponding path program 3 times [2019-12-27 18:10:03,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:10:03,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622204604] [2019-12-27 18:10:03,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:10:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:10:03,733 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 18:10:03,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622204604] [2019-12-27 18:10:03,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:10:03,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 18:10:03,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1630008583] [2019-12-27 18:10:03,734 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:10:03,750 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:10:03,871 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 180 states and 333 transitions. [2019-12-27 18:10:03,871 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:10:04,096 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 18:10:04,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 18:10:04,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:10:04,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 18:10:04,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:10:04,097 INFO L87 Difference]: Start difference. First operand 11798 states and 35264 transitions. Second operand 15 states. [2019-12-27 18:10:05,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:10:05,009 INFO L93 Difference]: Finished difference Result 13204 states and 38836 transitions. [2019-12-27 18:10:05,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 18:10:05,010 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 18:10:05,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:10:05,030 INFO L225 Difference]: With dead ends: 13204 [2019-12-27 18:10:05,030 INFO L226 Difference]: Without dead ends: 12600 [2019-12-27 18:10:05,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 11 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2019-12-27 18:10:05,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12600 states. [2019-12-27 18:10:05,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12600 to 11550. [2019-12-27 18:10:05,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11550 states. [2019-12-27 18:10:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11550 states to 11550 states and 34594 transitions. [2019-12-27 18:10:05,203 INFO L78 Accepts]: Start accepts. Automaton has 11550 states and 34594 transitions. Word has length 56 [2019-12-27 18:10:05,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:10:05,203 INFO L462 AbstractCegarLoop]: Abstraction has 11550 states and 34594 transitions. [2019-12-27 18:10:05,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 18:10:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 11550 states and 34594 transitions. [2019-12-27 18:10:05,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:10:05,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:10:05,215 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] [2019-12-27 18:10:05,215 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:10:05,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:10:05,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1649345490, now seen corresponding path program 4 times [2019-12-27 18:10:05,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:10:05,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251140108] [2019-12-27 18:10:05,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:10:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:10:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:10:05,318 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:10:05,318 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:10:05,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_448 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_643) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1909~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1909~0.base_26|) |v_ULTIMATE.start_main_~#t1909~0.offset_20| 0))) (= 0 v_~x~0_243) (= v_~__unbuffered_p2_EBX~0_64 0) (= 0 v_~__unbuffered_p0_EAX~0_82) (= |v_ULTIMATE.start_main_~#t1909~0.offset_20| 0) (= 0 v_~x$r_buff1_thd2~0_283) (= v_~x$flush_delayed~0_67 0) (= 0 v_~__unbuffered_p2_EAX~0_64) (= v_~main$tmp_guard1~0_51 0) (= v_~main$tmp_guard0~0_41 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1909~0.base_26| 4)) (< 0 |v_#StackHeapBarrier_17|) (= v_~x$r_buff1_thd0~0_322 0) (= 0 v_~x$w_buff1~0_350) (= v_~weak$$choice2~0_208 0) (= 0 v_~x$w_buff0~0_432) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$r_buff0_thd3~0_150) (= v_~x$r_buff0_thd1~0_385 0) (= 0 v_~x$r_buff1_thd3~0_288) (= v_~x$mem_tmp~0_44 0) (= 0 v_~x$r_buff0_thd2~0_345) (= |v_#NULL.offset_5| 0) (= 0 v_~x$w_buff0_used~0_952) (= (store .cse0 |v_ULTIMATE.start_main_~#t1909~0.base_26| 1) |v_#valid_62|) (= v_~x$r_buff0_thd0~0_164 0) (= 0 v_~weak$$choice0~0_40) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1909~0.base_26|) (= v_~y~0_300 0) (= 0 |v_#NULL.base_5|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1909~0.base_26|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_432, ULTIMATE.start_main_~#t1911~0.offset=|v_ULTIMATE.start_main_~#t1911~0.offset_14|, ~x$flush_delayed~0=v_~x$flush_delayed~0_67, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_448, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_150, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_64, ULTIMATE.start_main_~#t1909~0.offset=|v_ULTIMATE.start_main_~#t1909~0.offset_20|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_164, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_350, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_643, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_283, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1910~0.offset=|v_ULTIMATE.start_main_~#t1910~0.offset_20|, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1911~0.base=|v_ULTIMATE.start_main_~#t1911~0.base_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_243, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_385, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_106|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ~x$mem_tmp~0=v_~x$mem_tmp~0_44, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t1910~0.base=|v_ULTIMATE.start_main_~#t1910~0.base_27|, ~y~0=v_~y~0_300, ULTIMATE.start_main_~#t1909~0.base=|v_ULTIMATE.start_main_~#t1909~0.base_26|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_322, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_345, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_952, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_208, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t1911~0.offset, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1910~0.base, ~y~0, ULTIMATE.start_main_~#t1909~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1909~0.base, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1910~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_~#t1911~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 18:10:05,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L818-1-->L820: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1910~0.base_10| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1910~0.base_10|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1910~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1910~0.base_10|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1910~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1910~0.base_10|) |v_ULTIMATE.start_main_~#t1910~0.offset_9| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1910~0.offset_9|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1910~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1910~0.offset=|v_ULTIMATE.start_main_~#t1910~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1910~0.base=|v_ULTIMATE.start_main_~#t1910~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1910~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1910~0.base] because there is no mapped edge [2019-12-27 18:10:05,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] P1ENTRY-->L5-3: Formula: (and (= (mod v_~x$w_buff1_used~0_45 256) 0) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_10 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 1 v_~x$w_buff0_used~0_82) (= v_P1Thread1of1ForFork0_~arg.offset_8 |v_P1Thread1of1ForFork0_#in~arg.offset_8|) (= v_~x$w_buff1_used~0_45 v_~x$w_buff0_used~0_83) (= v_~x$w_buff0~0_23 v_~x$w_buff1~0_17) (= v_P1Thread1of1ForFork0_~arg.base_8 |v_P1Thread1of1ForFork0_#in~arg.base_8|) (= 1 v_~x$w_buff0~0_22) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_10, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_8, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_8, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, ~x$w_buff1~0=v_~x$w_buff1~0_17, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_45, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 18:10:05,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L820-1-->L822: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1911~0.base_11| 4) |v_#length_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1911~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1911~0.base_11|) |v_ULTIMATE.start_main_~#t1911~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1911~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1911~0.base_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1911~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1911~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t1911~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1911~0.base=|v_ULTIMATE.start_main_~#t1911~0.base_11|, ULTIMATE.start_main_~#t1911~0.offset=|v_ULTIMATE.start_main_~#t1911~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1911~0.base, ULTIMATE.start_main_~#t1911~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 18:10:05,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In-751803961 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-751803961 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out-751803961| ~x$w_buff1~0_In-751803961) (not .cse0) (not .cse1)) (and (= ~x~0_In-751803961 |P2Thread1of1ForFork1_#t~ite32_Out-751803961|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-751803961, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-751803961, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-751803961, ~x~0=~x~0_In-751803961} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-751803961|, ~x$w_buff1~0=~x$w_buff1~0_In-751803961, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-751803961, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-751803961, ~x~0=~x~0_In-751803961} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 18:10:05,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_18 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 18:10:05,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In969383384 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In969383384 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out969383384| ~x$w_buff0_used~0_In969383384) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out969383384| 0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In969383384, ~x$w_buff0_used~0=~x$w_buff0_used~0_In969383384} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out969383384|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In969383384, ~x$w_buff0_used~0=~x$w_buff0_used~0_In969383384} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 18:10:05,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2117669563 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_In2117669563| |P0Thread1of1ForFork2_#t~ite8_Out2117669563|) (not .cse0) (= ~x$w_buff0~0_In2117669563 |P0Thread1of1ForFork2_#t~ite9_Out2117669563|)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out2117669563| ~x$w_buff0~0_In2117669563) .cse0 (= |P0Thread1of1ForFork2_#t~ite8_Out2117669563| |P0Thread1of1ForFork2_#t~ite9_Out2117669563|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In2117669563 256) 0))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In2117669563 256) 0)) (and (= 0 (mod ~x$r_buff1_thd1~0_In2117669563 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In2117669563 256))))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In2117669563, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2117669563, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In2117669563|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2117669563, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2117669563, ~weak$$choice2~0=~weak$$choice2~0_In2117669563, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2117669563} OutVars{~x$w_buff0~0=~x$w_buff0~0_In2117669563, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2117669563, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out2117669563|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2117669563, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out2117669563|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2117669563, ~weak$$choice2~0=~weak$$choice2~0_In2117669563, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2117669563} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 18:10:05,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-149871269 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-149871269 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-149871269| ~x$w_buff0_used~0_In-149871269) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-149871269| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-149871269, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-149871269} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-149871269, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-149871269|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-149871269} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 18:10:05,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-1833179641 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1833179641 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1833179641 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1833179641 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out-1833179641| ~x$w_buff1_used~0_In-1833179641) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork0_#t~ite29_Out-1833179641| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1833179641, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1833179641, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1833179641, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1833179641} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1833179641, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1833179641, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1833179641, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1833179641|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1833179641} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 18:10:05,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L778-->L779: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2002030173 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-2002030173 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-2002030173 ~x$r_buff0_thd2~0_Out-2002030173)) (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-2002030173) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2002030173, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2002030173} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-2002030173|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2002030173, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2002030173} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 18:10:05,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-1734914559 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1734914559 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1734914559 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1734914559 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-1734914559| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite31_Out-1734914559| ~x$r_buff1_thd2~0_In-1734914559) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1734914559, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1734914559, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1734914559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1734914559} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1734914559|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1734914559, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1734914559, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1734914559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1734914559} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 18:10:05,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_52 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 18:10:05,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd3~0_In1474557318 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1474557318 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1474557318 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1474557318 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1474557318 |P2Thread1of1ForFork1_#t~ite35_Out1474557318|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out1474557318|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1474557318, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1474557318, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1474557318, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1474557318} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1474557318|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1474557318, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1474557318, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1474557318, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1474557318} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 18:10:05,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-1824553046 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1824553046 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-1824553046| 0)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1824553046| ~x$r_buff0_thd3~0_In-1824553046) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1824553046, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1824553046} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1824553046|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1824553046, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1824553046} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 18:10:05,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1056074105 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In1056074105| |P0Thread1of1ForFork2_#t~ite17_Out1056074105|) (= |P0Thread1of1ForFork2_#t~ite18_Out1056074105| ~x$w_buff1_used~0_In1056074105)) (and (= |P0Thread1of1ForFork2_#t~ite18_Out1056074105| |P0Thread1of1ForFork2_#t~ite17_Out1056074105|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1056074105 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1056074105 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In1056074105 256)) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In1056074105 256)) .cse1))) .cse0 (= ~x$w_buff1_used~0_In1056074105 |P0Thread1of1ForFork2_#t~ite17_Out1056074105|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1056074105, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1056074105|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1056074105, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1056074105, ~weak$$choice2~0=~weak$$choice2~0_In1056074105, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1056074105} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1056074105, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1056074105|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1056074105|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1056074105, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1056074105, ~weak$$choice2~0=~weak$$choice2~0_In1056074105, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1056074105} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 18:10:05,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_104 v_~x$r_buff0_thd1~0_103) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_103, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_13|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 18:10:05,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L745-->L745-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1000037622 256)))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1000037622 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In-1000037622 256)) .cse0) (= 0 (mod ~x$w_buff0_used~0_In-1000037622 256)) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-1000037622 256))))) (= |P0Thread1of1ForFork2_#t~ite24_Out-1000037622| |P0Thread1of1ForFork2_#t~ite23_Out-1000037622|) (= ~x$r_buff1_thd1~0_In-1000037622 |P0Thread1of1ForFork2_#t~ite23_Out-1000037622|) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite23_In-1000037622| |P0Thread1of1ForFork2_#t~ite23_Out-1000037622|) (= ~x$r_buff1_thd1~0_In-1000037622 |P0Thread1of1ForFork2_#t~ite24_Out-1000037622|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1000037622, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1000037622, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1000037622, ~weak$$choice2~0=~weak$$choice2~0_In-1000037622, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1000037622|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1000037622} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1000037622, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1000037622, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1000037622, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1000037622|, ~weak$$choice2~0=~weak$$choice2~0_In-1000037622, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1000037622|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1000037622} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-27 18:10:05,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-1669297029 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1669297029 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1669297029 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1669297029 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out-1669297029| ~x$r_buff1_thd3~0_In-1669297029)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork1_#t~ite37_Out-1669297029| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1669297029, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1669297029, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1669297029, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1669297029} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1669297029|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1669297029, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1669297029, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1669297029, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1669297029} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 18:10:05,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_30|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 18:10:05,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10) (= (+ v_~__unbuffered_cnt~0_30 1) v_~__unbuffered_cnt~0_29)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 18:10:05,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_172 256)) (= (mod v_~x$r_buff0_thd0~0_29 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 18:10:05,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In732902260 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In732902260 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out732902260| ~x$w_buff1~0_In732902260)) (and (= ~x~0_In732902260 |ULTIMATE.start_main_#t~ite41_Out732902260|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In732902260, ~x$w_buff1_used~0=~x$w_buff1_used~0_In732902260, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In732902260, ~x~0=~x~0_In732902260} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out732902260|, ~x$w_buff1~0=~x$w_buff1~0_In732902260, ~x$w_buff1_used~0=~x$w_buff1_used~0_In732902260, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In732902260, ~x~0=~x~0_In732902260} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 18:10:05,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 18:10:05,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1037854291 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1037854291 256)))) (or (and (= ~x$w_buff0_used~0_In-1037854291 |ULTIMATE.start_main_#t~ite43_Out-1037854291|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1037854291|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1037854291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1037854291} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1037854291, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1037854291|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1037854291} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 18:10:05,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In1452179367 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1452179367 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1452179367 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1452179367 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1452179367 |ULTIMATE.start_main_#t~ite44_Out1452179367|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite44_Out1452179367| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1452179367, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1452179367, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1452179367, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1452179367} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1452179367, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1452179367, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1452179367, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1452179367|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1452179367} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 18:10:05,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In19775374 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In19775374 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out19775374| 0)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In19775374 |ULTIMATE.start_main_#t~ite45_Out19775374|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In19775374, ~x$w_buff0_used~0=~x$w_buff0_used~0_In19775374} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In19775374, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out19775374|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In19775374} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 18:10:05,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-428771048 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-428771048 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-428771048 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-428771048 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-428771048| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite46_Out-428771048| ~x$r_buff1_thd0~0_In-428771048) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-428771048, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-428771048, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-428771048, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-428771048} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-428771048, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-428771048|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-428771048, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-428771048, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-428771048} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 18:10:05,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_26 0) (= v_~y~0_272 2) (= v_~x$r_buff1_thd0~0_293 |v_ULTIMATE.start_main_#t~ite46_58|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_26 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= 0 v_~__unbuffered_p0_EAX~0_53) (= v_~__unbuffered_p2_EBX~0_34 1) (= 1 v_~__unbuffered_p2_EAX~0_34)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_58|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_293, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:10:05,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:10:05 BasicIcfg [2019-12-27 18:10:05,454 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:10:05,457 INFO L168 Benchmark]: Toolchain (without parser) took 181261.76 ms. Allocated memory was 138.9 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 100.5 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 18:10:05,458 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.9 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 18:10:05,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.58 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.1 MB in the beginning and 156.7 MB in the end (delta: -56.6 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 18:10:05,462 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.80 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 154.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 18:10:05,463 INFO L168 Benchmark]: Boogie Preprocessor took 38.95 ms. Allocated memory is still 203.4 MB. Free memory was 154.8 MB in the beginning and 151.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 18:10:05,463 INFO L168 Benchmark]: RCFGBuilder took 859.21 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 105.3 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:10:05,464 INFO L168 Benchmark]: TraceAbstraction took 179545.74 ms. Allocated memory was 203.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 105.3 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 18:10:05,466 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.18 ms. Allocated memory is still 138.9 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 748.58 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.1 MB in the beginning and 156.7 MB in the end (delta: -56.6 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.80 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 154.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.95 ms. Allocated memory is still 203.4 MB. Free memory was 154.8 MB in the beginning and 151.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 859.21 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 105.3 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 179545.74 ms. Allocated memory was 203.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 105.3 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 6760 VarBasedMoverChecksPositive, 302 VarBasedMoverChecksNegative, 126 SemBasedMoverChecksPositive, 261 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 66367 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1909, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1910, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] FCALL, FORK 0 pthread_create(&t1911, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 y = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 179.2s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 63.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4541 SDtfs, 7808 SDslu, 13383 SDs, 0 SdLazy, 9182 SolverSat, 455 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 118 SyntacticMatches, 33 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171713occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 91.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 363246 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 871 NumberOfCodeBlocks, 871 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 787 ConstructedInterpolants, 0 QuantifiedInterpolants, 95044 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...