/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/mix038_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:55:43,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:55:43,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:55:43,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:55:43,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:55:43,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:55:43,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:55:43,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:55:43,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:55:43,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:55:43,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:55:43,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:55:43,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:55:43,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:55:43,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:55:43,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:55:43,928 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:55:43,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:55:43,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:55:43,935 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:55:43,939 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:55:43,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:55:43,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:55:43,943 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:55:43,945 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:55:43,945 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:55:43,945 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:55:43,946 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:55:43,946 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:55:43,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:55:43,947 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:55:43,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:55:43,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:55:43,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:55:43,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:55:43,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:55:43,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:55:43,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:55:43,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:55:43,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:55:43,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:55:43,954 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:55:43,982 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:55:43,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:55:43,983 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:55:43,983 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:55:43,987 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:55:43,987 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:55:43,987 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:55:43,987 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:55:43,988 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:55:43,988 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:55:43,988 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:55:43,988 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:55:43,988 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:55:43,989 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:55:43,989 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:55:43,989 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:55:43,989 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:55:43,989 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:55:43,989 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:55:43,994 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:55:43,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:55:43,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:55:43,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:55:43,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:55:43,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:55:43,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:55:43,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:55:43,995 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:55:43,995 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:55:43,996 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:55:43,996 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:55:44,254 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:55:44,270 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:55:44,276 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:55:44,278 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:55:44,278 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:55:44,280 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_rmo.oepc.i [2019-12-27 16:55:44,352 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f89fe58e5/9be7b9aee5de4d7e9e7cd84b7808e8f9/FLAGb5415823d [2019-12-27 16:55:44,907 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:55:44,907 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_rmo.oepc.i [2019-12-27 16:55:44,926 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f89fe58e5/9be7b9aee5de4d7e9e7cd84b7808e8f9/FLAGb5415823d [2019-12-27 16:55:45,197 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f89fe58e5/9be7b9aee5de4d7e9e7cd84b7808e8f9 [2019-12-27 16:55:45,205 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:55:45,207 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:55:45,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:55:45,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:55:45,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:55:45,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:55:45" (1/1) ... [2019-12-27 16:55:45,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cc7de13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:45, skipping insertion in model container [2019-12-27 16:55:45,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:55:45" (1/1) ... [2019-12-27 16:55:45,226 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:55:45,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:55:45,864 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:55:45,883 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:55:45,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:55:46,051 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:55:46,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:46 WrapperNode [2019-12-27 16:55:46,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:55:46,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:55:46,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:55:46,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:55:46,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:46" (1/1) ... [2019-12-27 16:55:46,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:46" (1/1) ... [2019-12-27 16:55:46,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:55:46,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:55:46,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:55:46,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:55:46,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:46" (1/1) ... [2019-12-27 16:55:46,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:46" (1/1) ... [2019-12-27 16:55:46,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:46" (1/1) ... [2019-12-27 16:55:46,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:46" (1/1) ... [2019-12-27 16:55:46,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:46" (1/1) ... [2019-12-27 16:55:46,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:46" (1/1) ... [2019-12-27 16:55:46,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:46" (1/1) ... [2019-12-27 16:55:46,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:55:46,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:55:46,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:55:46,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:55:46,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:55:46,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:55:46,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:55:46,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:55:46,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:55:46,234 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:55:46,234 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:55:46,234 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:55:46,234 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:55:46,234 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:55:46,235 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:55:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:55:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:55:46,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:55:46,238 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:55:46,999 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:55:46,999 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:55:47,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:55:47 BoogieIcfgContainer [2019-12-27 16:55:47,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:55:47,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:55:47,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:55:47,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:55:47,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:55:45" (1/3) ... [2019-12-27 16:55:47,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488b5735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:55:47, skipping insertion in model container [2019-12-27 16:55:47,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:46" (2/3) ... [2019-12-27 16:55:47,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488b5735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:55:47, skipping insertion in model container [2019-12-27 16:55:47,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:55:47" (3/3) ... [2019-12-27 16:55:47,009 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_rmo.oepc.i [2019-12-27 16:55:47,019 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:55:47,020 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:55:47,028 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:55:47,029 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:55:47,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,070 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,070 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,070 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,070 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,070 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,078 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,079 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,105 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,105 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,132 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,134 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,141 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,142 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,142 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,147 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,147 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:47,173 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:55:47,192 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:55:47,192 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:55:47,192 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:55:47,192 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:55:47,193 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:55:47,193 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:55:47,193 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:55:47,193 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:55:47,209 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 16:55:47,211 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 16:55:47,315 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 16:55:47,315 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:55:47,331 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:55:47,357 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 16:55:47,411 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 16:55:47,411 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:55:47,419 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:55:47,441 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 16:55:47,442 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:55:53,197 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 16:55:53,352 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 16:55:53,379 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87212 [2019-12-27 16:55:53,379 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 16:55:53,383 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-27 16:56:07,334 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-27 16:56:07,336 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-27 16:56:07,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:56:07,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:07,341 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:56:07,342 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:07,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:07,347 INFO L82 PathProgramCache]: Analyzing trace with hash 919766, now seen corresponding path program 1 times [2019-12-27 16:56:07,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:07,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416792241] [2019-12-27 16:56:07,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:07,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:07,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416792241] [2019-12-27 16:56:07,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:07,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:56:07,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [515630446] [2019-12-27 16:56:07,561 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:07,565 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:07,577 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:56:07,577 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:07,581 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:56:07,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:56:07,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:07,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:56:07,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:56:07,598 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-27 16:56:11,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:11,481 INFO L93 Difference]: Finished difference Result 101544 states and 430594 transitions. [2019-12-27 16:56:11,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:56:11,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:56:11,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:12,197 INFO L225 Difference]: With dead ends: 101544 [2019-12-27 16:56:12,197 INFO L226 Difference]: Without dead ends: 95304 [2019-12-27 16:56:12,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:56:17,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95304 states. [2019-12-27 16:56:19,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95304 to 95304. [2019-12-27 16:56:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95304 states. [2019-12-27 16:56:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95304 states to 95304 states and 403554 transitions. [2019-12-27 16:56:20,382 INFO L78 Accepts]: Start accepts. Automaton has 95304 states and 403554 transitions. Word has length 3 [2019-12-27 16:56:20,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:20,382 INFO L462 AbstractCegarLoop]: Abstraction has 95304 states and 403554 transitions. [2019-12-27 16:56:20,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:56:20,382 INFO L276 IsEmpty]: Start isEmpty. Operand 95304 states and 403554 transitions. [2019-12-27 16:56:20,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:56:20,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:20,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:20,387 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:20,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:20,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1982627867, now seen corresponding path program 1 times [2019-12-27 16:56:20,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:20,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574485833] [2019-12-27 16:56:20,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:20,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:20,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574485833] [2019-12-27 16:56:20,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:20,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:56:20,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [547318514] [2019-12-27 16:56:20,525 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:20,526 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:20,530 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:56:20,530 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:20,530 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:56:20,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:56:20,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:20,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:56:20,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:56:20,532 INFO L87 Difference]: Start difference. First operand 95304 states and 403554 transitions. Second operand 4 states. [2019-12-27 16:56:25,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:25,427 INFO L93 Difference]: Finished difference Result 152040 states and 617140 transitions. [2019-12-27 16:56:25,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:56:25,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:56:25,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:26,061 INFO L225 Difference]: With dead ends: 152040 [2019-12-27 16:56:26,062 INFO L226 Difference]: Without dead ends: 151991 [2019-12-27 16:56:26,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:56:30,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151991 states. [2019-12-27 16:56:33,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151991 to 137801. [2019-12-27 16:56:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137801 states. [2019-12-27 16:56:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137801 states to 137801 states and 566928 transitions. [2019-12-27 16:56:33,747 INFO L78 Accepts]: Start accepts. Automaton has 137801 states and 566928 transitions. Word has length 11 [2019-12-27 16:56:33,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:33,747 INFO L462 AbstractCegarLoop]: Abstraction has 137801 states and 566928 transitions. [2019-12-27 16:56:33,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:56:33,747 INFO L276 IsEmpty]: Start isEmpty. Operand 137801 states and 566928 transitions. [2019-12-27 16:56:33,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:56:33,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:33,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:33,753 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:33,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:33,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1673757482, now seen corresponding path program 1 times [2019-12-27 16:56:33,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:33,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645109834] [2019-12-27 16:56:33,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:33,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:33,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645109834] [2019-12-27 16:56:33,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:33,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:56:33,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [590006653] [2019-12-27 16:56:33,818 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:33,821 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:33,822 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:56:33,822 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:33,823 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:56:33,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:56:33,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:33,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:56:33,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:56:33,824 INFO L87 Difference]: Start difference. First operand 137801 states and 566928 transitions. Second operand 3 states. [2019-12-27 16:56:33,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:33,955 INFO L93 Difference]: Finished difference Result 30915 states and 99823 transitions. [2019-12-27 16:56:33,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:56:33,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:56:33,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:34,002 INFO L225 Difference]: With dead ends: 30915 [2019-12-27 16:56:34,002 INFO L226 Difference]: Without dead ends: 30915 [2019-12-27 16:56:34,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:56:38,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30915 states. [2019-12-27 16:56:38,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30915 to 30915. [2019-12-27 16:56:38,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30915 states. [2019-12-27 16:56:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30915 states to 30915 states and 99823 transitions. [2019-12-27 16:56:38,793 INFO L78 Accepts]: Start accepts. Automaton has 30915 states and 99823 transitions. Word has length 13 [2019-12-27 16:56:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:38,794 INFO L462 AbstractCegarLoop]: Abstraction has 30915 states and 99823 transitions. [2019-12-27 16:56:38,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:56:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 30915 states and 99823 transitions. [2019-12-27 16:56:38,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:56:38,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:38,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:38,797 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:38,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:38,798 INFO L82 PathProgramCache]: Analyzing trace with hash 841711145, now seen corresponding path program 1 times [2019-12-27 16:56:38,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:38,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579063321] [2019-12-27 16:56:38,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:38,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579063321] [2019-12-27 16:56:38,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:38,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:56:38,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [479115886] [2019-12-27 16:56:38,890 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:38,896 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:38,900 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:56:38,900 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:38,901 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:56:38,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:56:38,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:38,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:56:38,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:56:38,902 INFO L87 Difference]: Start difference. First operand 30915 states and 99823 transitions. Second operand 4 states. [2019-12-27 16:56:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:39,246 INFO L93 Difference]: Finished difference Result 38538 states and 124019 transitions. [2019-12-27 16:56:39,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:56:39,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:56:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:39,305 INFO L225 Difference]: With dead ends: 38538 [2019-12-27 16:56:39,305 INFO L226 Difference]: Without dead ends: 38538 [2019-12-27 16:56:39,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:56:39,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38538 states. [2019-12-27 16:56:39,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38538 to 34473. [2019-12-27 16:56:39,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34473 states. [2019-12-27 16:56:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 111272 transitions. [2019-12-27 16:56:39,890 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 111272 transitions. Word has length 16 [2019-12-27 16:56:39,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:39,891 INFO L462 AbstractCegarLoop]: Abstraction has 34473 states and 111272 transitions. [2019-12-27 16:56:39,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:56:39,891 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 111272 transitions. [2019-12-27 16:56:39,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:56:39,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:39,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:39,902 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:39,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:39,902 INFO L82 PathProgramCache]: Analyzing trace with hash 361242897, now seen corresponding path program 1 times [2019-12-27 16:56:39,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:39,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552422487] [2019-12-27 16:56:39,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:40,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552422487] [2019-12-27 16:56:40,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:40,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:56:40,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1539689394] [2019-12-27 16:56:40,017 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:40,022 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:40,029 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 16:56:40,029 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:40,140 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:56:40,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:56:40,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:40,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:56:40,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:56:40,142 INFO L87 Difference]: Start difference. First operand 34473 states and 111272 transitions. Second operand 7 states. [2019-12-27 16:56:41,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:41,564 INFO L93 Difference]: Finished difference Result 52978 states and 168667 transitions. [2019-12-27 16:56:41,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:56:41,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 16:56:41,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:41,649 INFO L225 Difference]: With dead ends: 52978 [2019-12-27 16:56:41,649 INFO L226 Difference]: Without dead ends: 52971 [2019-12-27 16:56:41,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:56:41,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52971 states. [2019-12-27 16:56:42,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52971 to 34062. [2019-12-27 16:56:42,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34062 states. [2019-12-27 16:56:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34062 states to 34062 states and 109831 transitions. [2019-12-27 16:56:42,356 INFO L78 Accepts]: Start accepts. Automaton has 34062 states and 109831 transitions. Word has length 22 [2019-12-27 16:56:42,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:42,357 INFO L462 AbstractCegarLoop]: Abstraction has 34062 states and 109831 transitions. [2019-12-27 16:56:42,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:56:42,357 INFO L276 IsEmpty]: Start isEmpty. Operand 34062 states and 109831 transitions. [2019-12-27 16:56:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:56:42,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:42,369 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:42,370 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:42,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:42,370 INFO L82 PathProgramCache]: Analyzing trace with hash -2019660134, now seen corresponding path program 1 times [2019-12-27 16:56:42,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:42,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976772953] [2019-12-27 16:56:42,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:42,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976772953] [2019-12-27 16:56:42,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:42,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:56:42,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1664356357] [2019-12-27 16:56:42,428 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:42,432 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:42,443 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 16:56:42,443 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:42,457 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:56:42,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:56:42,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:42,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:56:42,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:56:42,458 INFO L87 Difference]: Start difference. First operand 34062 states and 109831 transitions. Second operand 5 states. [2019-12-27 16:56:42,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:42,542 INFO L93 Difference]: Finished difference Result 13768 states and 41803 transitions. [2019-12-27 16:56:42,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:56:42,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 16:56:42,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:42,563 INFO L225 Difference]: With dead ends: 13768 [2019-12-27 16:56:42,564 INFO L226 Difference]: Without dead ends: 13768 [2019-12-27 16:56:42,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:56:42,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2019-12-27 16:56:42,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 13468. [2019-12-27 16:56:42,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13468 states. [2019-12-27 16:56:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13468 states to 13468 states and 40947 transitions. [2019-12-27 16:56:42,780 INFO L78 Accepts]: Start accepts. Automaton has 13468 states and 40947 transitions. Word has length 25 [2019-12-27 16:56:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:42,780 INFO L462 AbstractCegarLoop]: Abstraction has 13468 states and 40947 transitions. [2019-12-27 16:56:42,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:56:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 13468 states and 40947 transitions. [2019-12-27 16:56:42,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:56:42,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:42,794 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:42,794 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:42,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:42,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1429942457, now seen corresponding path program 1 times [2019-12-27 16:56:42,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:42,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049084627] [2019-12-27 16:56:42,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:42,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049084627] [2019-12-27 16:56:42,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:42,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:56:42,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1600287313] [2019-12-27 16:56:42,841 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:42,845 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:42,853 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:56:42,853 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:42,853 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:56:42,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:56:42,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:42,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:56:42,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:56:42,854 INFO L87 Difference]: Start difference. First operand 13468 states and 40947 transitions. Second operand 3 states. [2019-12-27 16:56:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:42,939 INFO L93 Difference]: Finished difference Result 19309 states and 57773 transitions. [2019-12-27 16:56:42,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:56:42,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:56:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:42,965 INFO L225 Difference]: With dead ends: 19309 [2019-12-27 16:56:42,965 INFO L226 Difference]: Without dead ends: 19309 [2019-12-27 16:56:42,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:56:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19309 states. [2019-12-27 16:56:43,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19309 to 14214. [2019-12-27 16:56:43,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14214 states. [2019-12-27 16:56:43,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14214 states to 14214 states and 43085 transitions. [2019-12-27 16:56:43,201 INFO L78 Accepts]: Start accepts. Automaton has 14214 states and 43085 transitions. Word has length 27 [2019-12-27 16:56:43,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:43,202 INFO L462 AbstractCegarLoop]: Abstraction has 14214 states and 43085 transitions. [2019-12-27 16:56:43,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:56:43,202 INFO L276 IsEmpty]: Start isEmpty. Operand 14214 states and 43085 transitions. [2019-12-27 16:56:43,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:56:43,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:43,211 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:43,211 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:43,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:43,211 INFO L82 PathProgramCache]: Analyzing trace with hash -535275942, now seen corresponding path program 1 times [2019-12-27 16:56:43,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:43,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466585127] [2019-12-27 16:56:43,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:43,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466585127] [2019-12-27 16:56:43,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:43,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:56:43,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1617615823] [2019-12-27 16:56:43,265 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:43,269 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:43,276 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:56:43,276 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:43,276 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:56:43,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:56:43,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:43,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:56:43,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:56:43,277 INFO L87 Difference]: Start difference. First operand 14214 states and 43085 transitions. Second operand 3 states. [2019-12-27 16:56:43,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:43,375 INFO L93 Difference]: Finished difference Result 21037 states and 62324 transitions. [2019-12-27 16:56:43,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:56:43,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:56:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:43,403 INFO L225 Difference]: With dead ends: 21037 [2019-12-27 16:56:43,403 INFO L226 Difference]: Without dead ends: 21037 [2019-12-27 16:56:43,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:56:43,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21037 states. [2019-12-27 16:56:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21037 to 15942. [2019-12-27 16:56:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-12-27 16:56:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 47636 transitions. [2019-12-27 16:56:43,890 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 47636 transitions. Word has length 27 [2019-12-27 16:56:43,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:43,890 INFO L462 AbstractCegarLoop]: Abstraction has 15942 states and 47636 transitions. [2019-12-27 16:56:43,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:56:43,890 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 47636 transitions. [2019-12-27 16:56:43,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:56:43,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:43,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:43,902 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:43,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:43,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1457952739, now seen corresponding path program 1 times [2019-12-27 16:56:43,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:43,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704818360] [2019-12-27 16:56:43,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:44,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:44,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704818360] [2019-12-27 16:56:44,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:44,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:56:44,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [421326368] [2019-12-27 16:56:44,001 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:44,005 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:44,011 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:56:44,011 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:44,012 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:56:44,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:56:44,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:44,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:56:44,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:56:44,013 INFO L87 Difference]: Start difference. First operand 15942 states and 47636 transitions. Second operand 6 states. [2019-12-27 16:56:44,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:44,639 INFO L93 Difference]: Finished difference Result 29609 states and 87623 transitions. [2019-12-27 16:56:44,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:56:44,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 16:56:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:44,682 INFO L225 Difference]: With dead ends: 29609 [2019-12-27 16:56:44,683 INFO L226 Difference]: Without dead ends: 29609 [2019-12-27 16:56:44,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:56:44,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29609 states. [2019-12-27 16:56:44,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29609 to 18458. [2019-12-27 16:56:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18458 states. [2019-12-27 16:56:45,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18458 states to 18458 states and 55021 transitions. [2019-12-27 16:56:45,020 INFO L78 Accepts]: Start accepts. Automaton has 18458 states and 55021 transitions. Word has length 27 [2019-12-27 16:56:45,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:45,021 INFO L462 AbstractCegarLoop]: Abstraction has 18458 states and 55021 transitions. [2019-12-27 16:56:45,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:56:45,021 INFO L276 IsEmpty]: Start isEmpty. Operand 18458 states and 55021 transitions. [2019-12-27 16:56:45,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:56:45,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:45,034 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 16:56:45,034 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:45,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:45,034 INFO L82 PathProgramCache]: Analyzing trace with hash 294567066, now seen corresponding path program 1 times [2019-12-27 16:56:45,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:45,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029139349] [2019-12-27 16:56:45,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:45,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029139349] [2019-12-27 16:56:45,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:45,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:56:45,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [76434760] [2019-12-27 16:56:45,129 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:45,134 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:45,143 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 16:56:45,143 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:45,144 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:56:45,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:56:45,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:45,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:56:45,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:56:45,145 INFO L87 Difference]: Start difference. First operand 18458 states and 55021 transitions. Second operand 6 states. [2019-12-27 16:56:45,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:45,802 INFO L93 Difference]: Finished difference Result 28968 states and 85211 transitions. [2019-12-27 16:56:45,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:56:45,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 16:56:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:45,841 INFO L225 Difference]: With dead ends: 28968 [2019-12-27 16:56:45,841 INFO L226 Difference]: Without dead ends: 28968 [2019-12-27 16:56:45,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:56:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28968 states. [2019-12-27 16:56:46,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28968 to 18220. [2019-12-27 16:56:46,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18220 states. [2019-12-27 16:56:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18220 states to 18220 states and 54222 transitions. [2019-12-27 16:56:46,166 INFO L78 Accepts]: Start accepts. Automaton has 18220 states and 54222 transitions. Word has length 28 [2019-12-27 16:56:46,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:46,166 INFO L462 AbstractCegarLoop]: Abstraction has 18220 states and 54222 transitions. [2019-12-27 16:56:46,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:56:46,167 INFO L276 IsEmpty]: Start isEmpty. Operand 18220 states and 54222 transitions. [2019-12-27 16:56:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:56:46,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:46,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:46,184 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:46,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:46,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1705939963, now seen corresponding path program 1 times [2019-12-27 16:56:46,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:46,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061586370] [2019-12-27 16:56:46,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:46,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061586370] [2019-12-27 16:56:46,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:46,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:56:46,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [872850857] [2019-12-27 16:56:46,277 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:46,283 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:46,296 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 16:56:46,296 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:46,385 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:56:46,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:56:46,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:46,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:56:46,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:56:46,388 INFO L87 Difference]: Start difference. First operand 18220 states and 54222 transitions. Second operand 9 states. [2019-12-27 16:56:48,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:48,963 INFO L93 Difference]: Finished difference Result 52157 states and 153796 transitions. [2019-12-27 16:56:48,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 16:56:48,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 16:56:48,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:49,038 INFO L225 Difference]: With dead ends: 52157 [2019-12-27 16:56:49,038 INFO L226 Difference]: Without dead ends: 52157 [2019-12-27 16:56:49,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-12-27 16:56:49,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52157 states. [2019-12-27 16:56:49,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52157 to 20337. [2019-12-27 16:56:49,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20337 states. [2019-12-27 16:56:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20337 states to 20337 states and 60571 transitions. [2019-12-27 16:56:49,556 INFO L78 Accepts]: Start accepts. Automaton has 20337 states and 60571 transitions. Word has length 33 [2019-12-27 16:56:49,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:49,556 INFO L462 AbstractCegarLoop]: Abstraction has 20337 states and 60571 transitions. [2019-12-27 16:56:49,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:56:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 20337 states and 60571 transitions. [2019-12-27 16:56:49,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:56:49,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:49,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:49,579 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:49,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:49,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1567643153, now seen corresponding path program 2 times [2019-12-27 16:56:49,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:49,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547010904] [2019-12-27 16:56:49,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:49,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547010904] [2019-12-27 16:56:49,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:49,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:56:49,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1239967280] [2019-12-27 16:56:49,690 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:49,697 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:49,716 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 73 transitions. [2019-12-27 16:56:49,716 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:49,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:56:49,751 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:56:49,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:56:49,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:49,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:56:49,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:56:49,752 INFO L87 Difference]: Start difference. First operand 20337 states and 60571 transitions. Second operand 9 states. [2019-12-27 16:56:52,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:52,480 INFO L93 Difference]: Finished difference Result 61814 states and 179044 transitions. [2019-12-27 16:56:52,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 16:56:52,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 16:56:52,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:52,567 INFO L225 Difference]: With dead ends: 61814 [2019-12-27 16:56:52,567 INFO L226 Difference]: Without dead ends: 61814 [2019-12-27 16:56:52,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=327, Invalid=1079, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 16:56:52,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61814 states. [2019-12-27 16:56:53,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61814 to 22796. [2019-12-27 16:56:53,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22796 states. [2019-12-27 16:56:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22796 states to 22796 states and 67944 transitions. [2019-12-27 16:56:53,541 INFO L78 Accepts]: Start accepts. Automaton has 22796 states and 67944 transitions. Word has length 33 [2019-12-27 16:56:53,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:53,542 INFO L462 AbstractCegarLoop]: Abstraction has 22796 states and 67944 transitions. [2019-12-27 16:56:53,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:56:53,542 INFO L276 IsEmpty]: Start isEmpty. Operand 22796 states and 67944 transitions. [2019-12-27 16:56:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 16:56:53,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:53,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:53,561 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:53,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:53,561 INFO L82 PathProgramCache]: Analyzing trace with hash -607763582, now seen corresponding path program 1 times [2019-12-27 16:56:53,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:53,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686739314] [2019-12-27 16:56:53,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:53,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686739314] [2019-12-27 16:56:53,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:53,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:56:53,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1034697595] [2019-12-27 16:56:53,673 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:53,680 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:53,694 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 62 transitions. [2019-12-27 16:56:53,694 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:53,803 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:56:53,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:56:53,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:53,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:56:53,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:56:53,805 INFO L87 Difference]: Start difference. First operand 22796 states and 67944 transitions. Second operand 9 states. [2019-12-27 16:56:56,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:56,124 INFO L93 Difference]: Finished difference Result 47036 states and 138916 transitions. [2019-12-27 16:56:56,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 16:56:56,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-27 16:56:56,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:56,189 INFO L225 Difference]: With dead ends: 47036 [2019-12-27 16:56:56,189 INFO L226 Difference]: Without dead ends: 47036 [2019-12-27 16:56:56,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-12-27 16:56:56,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47036 states. [2019-12-27 16:56:56,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47036 to 21660. [2019-12-27 16:56:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21660 states. [2019-12-27 16:56:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21660 states to 21660 states and 64627 transitions. [2019-12-27 16:56:56,702 INFO L78 Accepts]: Start accepts. Automaton has 21660 states and 64627 transitions. Word has length 34 [2019-12-27 16:56:56,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:56,703 INFO L462 AbstractCegarLoop]: Abstraction has 21660 states and 64627 transitions. [2019-12-27 16:56:56,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:56:56,703 INFO L276 IsEmpty]: Start isEmpty. Operand 21660 states and 64627 transitions. [2019-12-27 16:56:56,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 16:56:56,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:56,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:56,723 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:56,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:56,723 INFO L82 PathProgramCache]: Analyzing trace with hash 846412022, now seen corresponding path program 2 times [2019-12-27 16:56:56,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:56,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862840692] [2019-12-27 16:56:56,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:56,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:56,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862840692] [2019-12-27 16:56:56,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:56,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:56:56,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [630495022] [2019-12-27 16:56:56,859 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:56,866 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:56,883 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 56 transitions. [2019-12-27 16:56:56,883 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:56,883 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:56:56,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:56:56,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:56,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:56:56,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:56:56,885 INFO L87 Difference]: Start difference. First operand 21660 states and 64627 transitions. Second operand 8 states. [2019-12-27 16:56:58,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:58,344 INFO L93 Difference]: Finished difference Result 48473 states and 140571 transitions. [2019-12-27 16:56:58,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 16:56:58,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 16:56:58,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:58,410 INFO L225 Difference]: With dead ends: 48473 [2019-12-27 16:56:58,410 INFO L226 Difference]: Without dead ends: 48473 [2019-12-27 16:56:58,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:56:58,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48473 states. [2019-12-27 16:56:59,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48473 to 21115. [2019-12-27 16:56:59,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21115 states. [2019-12-27 16:56:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21115 states to 21115 states and 63019 transitions. [2019-12-27 16:56:59,258 INFO L78 Accepts]: Start accepts. Automaton has 21115 states and 63019 transitions. Word has length 34 [2019-12-27 16:56:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:59,259 INFO L462 AbstractCegarLoop]: Abstraction has 21115 states and 63019 transitions. [2019-12-27 16:56:59,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:56:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 21115 states and 63019 transitions. [2019-12-27 16:56:59,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 16:56:59,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:59,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:59,284 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:59,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:59,285 INFO L82 PathProgramCache]: Analyzing trace with hash -211414604, now seen corresponding path program 3 times [2019-12-27 16:56:59,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:59,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11874018] [2019-12-27 16:56:59,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:59,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11874018] [2019-12-27 16:56:59,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:59,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:56:59,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [381586423] [2019-12-27 16:56:59,416 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:59,423 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:59,444 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 68 transitions. [2019-12-27 16:56:59,445 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:59,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:56:59,467 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:56:59,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:56:59,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:59,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:56:59,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:56:59,468 INFO L87 Difference]: Start difference. First operand 21115 states and 63019 transitions. Second operand 10 states. [2019-12-27 16:57:03,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:03,292 INFO L93 Difference]: Finished difference Result 52433 states and 150612 transitions. [2019-12-27 16:57:03,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 16:57:03,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-12-27 16:57:03,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:03,370 INFO L225 Difference]: With dead ends: 52433 [2019-12-27 16:57:03,370 INFO L226 Difference]: Without dead ends: 52433 [2019-12-27 16:57:03,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=366, Invalid=1356, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 16:57:03,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52433 states. [2019-12-27 16:57:03,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52433 to 20235. [2019-12-27 16:57:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20235 states. [2019-12-27 16:57:03,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20235 states to 20235 states and 60391 transitions. [2019-12-27 16:57:03,881 INFO L78 Accepts]: Start accepts. Automaton has 20235 states and 60391 transitions. Word has length 34 [2019-12-27 16:57:03,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:03,881 INFO L462 AbstractCegarLoop]: Abstraction has 20235 states and 60391 transitions. [2019-12-27 16:57:03,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:57:03,882 INFO L276 IsEmpty]: Start isEmpty. Operand 20235 states and 60391 transitions. [2019-12-27 16:57:03,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:57:03,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:03,907 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:03,907 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:03,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:03,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1053586821, now seen corresponding path program 1 times [2019-12-27 16:57:03,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:03,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164665102] [2019-12-27 16:57:03,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:03,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:57:03,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164665102] [2019-12-27 16:57:03,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:03,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:57:03,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1103488321] [2019-12-27 16:57:03,970 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:03,977 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:04,047 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 379 transitions. [2019-12-27 16:57:04,047 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:04,048 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:57:04,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:57:04,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:04,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:57:04,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:57:04,050 INFO L87 Difference]: Start difference. First operand 20235 states and 60391 transitions. Second operand 3 states. [2019-12-27 16:57:04,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:04,131 INFO L93 Difference]: Finished difference Result 20234 states and 60389 transitions. [2019-12-27 16:57:04,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:57:04,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 16:57:04,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:04,159 INFO L225 Difference]: With dead ends: 20234 [2019-12-27 16:57:04,159 INFO L226 Difference]: Without dead ends: 20234 [2019-12-27 16:57:04,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:57:04,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20234 states. [2019-12-27 16:57:04,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20234 to 20234. [2019-12-27 16:57:04,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20234 states. [2019-12-27 16:57:04,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20234 states to 20234 states and 60389 transitions. [2019-12-27 16:57:04,423 INFO L78 Accepts]: Start accepts. Automaton has 20234 states and 60389 transitions. Word has length 39 [2019-12-27 16:57:04,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:04,424 INFO L462 AbstractCegarLoop]: Abstraction has 20234 states and 60389 transitions. [2019-12-27 16:57:04,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:57:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 20234 states and 60389 transitions. [2019-12-27 16:57:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:57:04,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:04,441 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:04,441 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:04,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:04,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2145844780, now seen corresponding path program 1 times [2019-12-27 16:57:04,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:04,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161846299] [2019-12-27 16:57:04,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:57:04,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161846299] [2019-12-27 16:57:04,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:04,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:57:04,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1466635678] [2019-12-27 16:57:04,501 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:04,509 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:04,601 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 454 transitions. [2019-12-27 16:57:04,601 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:04,855 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-27 16:57:04,874 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:57:04,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:57:04,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:04,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:57:04,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:57:04,877 INFO L87 Difference]: Start difference. First operand 20234 states and 60389 transitions. Second operand 7 states. [2019-12-27 16:57:05,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:05,005 INFO L93 Difference]: Finished difference Result 18998 states and 57570 transitions. [2019-12-27 16:57:05,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:57:05,006 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 16:57:05,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:05,045 INFO L225 Difference]: With dead ends: 18998 [2019-12-27 16:57:05,045 INFO L226 Difference]: Without dead ends: 18998 [2019-12-27 16:57:05,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:57:05,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18998 states. [2019-12-27 16:57:05,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18998 to 16550. [2019-12-27 16:57:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16550 states. [2019-12-27 16:57:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16550 states to 16550 states and 50746 transitions. [2019-12-27 16:57:05,431 INFO L78 Accepts]: Start accepts. Automaton has 16550 states and 50746 transitions. Word has length 40 [2019-12-27 16:57:05,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:05,431 INFO L462 AbstractCegarLoop]: Abstraction has 16550 states and 50746 transitions. [2019-12-27 16:57:05,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:57:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 16550 states and 50746 transitions. [2019-12-27 16:57:05,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:57:05,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:05,457 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:05,457 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:05,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:05,457 INFO L82 PathProgramCache]: Analyzing trace with hash 914424357, now seen corresponding path program 1 times [2019-12-27 16:57:05,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:05,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752251261] [2019-12-27 16:57:05,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:57:05,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752251261] [2019-12-27 16:57:05,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:05,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:57:05,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [523535959] [2019-12-27 16:57:05,595 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:05,620 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:05,820 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 255 states and 489 transitions. [2019-12-27 16:57:05,820 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:05,930 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 16:57:05,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:57:05,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:05,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:57:05,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:57:05,932 INFO L87 Difference]: Start difference. First operand 16550 states and 50746 transitions. Second operand 11 states. [2019-12-27 16:57:10,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:10,056 INFO L93 Difference]: Finished difference Result 152948 states and 455135 transitions. [2019-12-27 16:57:10,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 16:57:10,057 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 16:57:10,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:10,252 INFO L225 Difference]: With dead ends: 152948 [2019-12-27 16:57:10,253 INFO L226 Difference]: Without dead ends: 114492 [2019-12-27 16:57:10,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=890, Invalid=3666, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 16:57:10,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114492 states. [2019-12-27 16:57:11,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114492 to 20487. [2019-12-27 16:57:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20487 states. [2019-12-27 16:57:11,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20487 states to 20487 states and 63320 transitions. [2019-12-27 16:57:11,629 INFO L78 Accepts]: Start accepts. Automaton has 20487 states and 63320 transitions. Word has length 64 [2019-12-27 16:57:11,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:11,630 INFO L462 AbstractCegarLoop]: Abstraction has 20487 states and 63320 transitions. [2019-12-27 16:57:11,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:57:11,630 INFO L276 IsEmpty]: Start isEmpty. Operand 20487 states and 63320 transitions. [2019-12-27 16:57:11,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:57:11,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:11,651 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:11,651 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:11,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:11,652 INFO L82 PathProgramCache]: Analyzing trace with hash -466762747, now seen corresponding path program 2 times [2019-12-27 16:57:11,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:11,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477039256] [2019-12-27 16:57:11,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:11,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:57:11,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477039256] [2019-12-27 16:57:11,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:11,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:57:11,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2050420248] [2019-12-27 16:57:11,747 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:11,796 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:12,029 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 206 states and 368 transitions. [2019-12-27 16:57:12,029 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:12,050 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:57:12,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:57:12,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:12,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:57:12,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:57:12,057 INFO L87 Difference]: Start difference. First operand 20487 states and 63320 transitions. Second operand 8 states. [2019-12-27 16:57:13,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:13,973 INFO L93 Difference]: Finished difference Result 78355 states and 233153 transitions. [2019-12-27 16:57:13,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 16:57:13,974 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 16:57:13,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:14,068 INFO L225 Difference]: With dead ends: 78355 [2019-12-27 16:57:14,068 INFO L226 Difference]: Without dead ends: 59440 [2019-12-27 16:57:14,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2019-12-27 16:57:14,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59440 states. [2019-12-27 16:57:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59440 to 24492. [2019-12-27 16:57:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24492 states. [2019-12-27 16:57:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24492 states to 24492 states and 75075 transitions. [2019-12-27 16:57:15,152 INFO L78 Accepts]: Start accepts. Automaton has 24492 states and 75075 transitions. Word has length 64 [2019-12-27 16:57:15,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:15,152 INFO L462 AbstractCegarLoop]: Abstraction has 24492 states and 75075 transitions. [2019-12-27 16:57:15,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:57:15,152 INFO L276 IsEmpty]: Start isEmpty. Operand 24492 states and 75075 transitions. [2019-12-27 16:57:15,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:57:15,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:15,179 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:15,179 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:15,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:15,180 INFO L82 PathProgramCache]: Analyzing trace with hash 849472763, now seen corresponding path program 3 times [2019-12-27 16:57:15,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:15,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507420020] [2019-12-27 16:57:15,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:57:15,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507420020] [2019-12-27 16:57:15,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:15,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:57:15,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1520478541] [2019-12-27 16:57:15,270 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:15,290 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:15,545 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 408 transitions. [2019-12-27 16:57:15,546 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:15,669 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:57:15,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:57:15,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:15,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:57:15,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:57:15,670 INFO L87 Difference]: Start difference. First operand 24492 states and 75075 transitions. Second operand 11 states. [2019-12-27 16:57:17,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:17,302 INFO L93 Difference]: Finished difference Result 60485 states and 182050 transitions. [2019-12-27 16:57:17,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:57:17,302 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 16:57:17,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:17,375 INFO L225 Difference]: With dead ends: 60485 [2019-12-27 16:57:17,376 INFO L226 Difference]: Without dead ends: 52035 [2019-12-27 16:57:17,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-12-27 16:57:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52035 states. [2019-12-27 16:57:17,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52035 to 24796. [2019-12-27 16:57:17,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24796 states. [2019-12-27 16:57:17,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24796 states to 24796 states and 75989 transitions. [2019-12-27 16:57:17,950 INFO L78 Accepts]: Start accepts. Automaton has 24796 states and 75989 transitions. Word has length 64 [2019-12-27 16:57:17,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:17,951 INFO L462 AbstractCegarLoop]: Abstraction has 24796 states and 75989 transitions. [2019-12-27 16:57:17,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:57:17,951 INFO L276 IsEmpty]: Start isEmpty. Operand 24796 states and 75989 transitions. [2019-12-27 16:57:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:57:17,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:17,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:17,980 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:17,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:17,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1624619189, now seen corresponding path program 4 times [2019-12-27 16:57:17,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:17,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909065846] [2019-12-27 16:57:17,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:57:18,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909065846] [2019-12-27 16:57:18,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:18,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:57:18,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1157750474] [2019-12-27 16:57:18,117 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:18,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:18,293 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 199 states and 355 transitions. [2019-12-27 16:57:18,293 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:18,330 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 16:57:18,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:57:18,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:18,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:57:18,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:57:18,331 INFO L87 Difference]: Start difference. First operand 24796 states and 75989 transitions. Second operand 9 states. [2019-12-27 16:57:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:21,859 INFO L93 Difference]: Finished difference Result 70283 states and 210990 transitions. [2019-12-27 16:57:21,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 16:57:21,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 16:57:21,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:21,957 INFO L225 Difference]: With dead ends: 70283 [2019-12-27 16:57:21,957 INFO L226 Difference]: Without dead ends: 70283 [2019-12-27 16:57:21,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=297, Invalid=1035, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 16:57:22,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70283 states. [2019-12-27 16:57:22,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70283 to 25160. [2019-12-27 16:57:22,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25160 states. [2019-12-27 16:57:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25160 states to 25160 states and 77057 transitions. [2019-12-27 16:57:22,675 INFO L78 Accepts]: Start accepts. Automaton has 25160 states and 77057 transitions. Word has length 64 [2019-12-27 16:57:22,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:22,675 INFO L462 AbstractCegarLoop]: Abstraction has 25160 states and 77057 transitions. [2019-12-27 16:57:22,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:57:22,676 INFO L276 IsEmpty]: Start isEmpty. Operand 25160 states and 77057 transitions. [2019-12-27 16:57:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:57:22,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:22,704 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:22,704 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:22,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:22,705 INFO L82 PathProgramCache]: Analyzing trace with hash 2090754765, now seen corresponding path program 5 times [2019-12-27 16:57:22,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:22,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757286485] [2019-12-27 16:57:22,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:22,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:57:22,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757286485] [2019-12-27 16:57:22,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:22,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:57:22,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1317030745] [2019-12-27 16:57:22,758 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:22,777 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:22,943 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 316 transitions. [2019-12-27 16:57:22,943 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:22,944 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:57:22,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:57:22,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:22,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:57:22,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:57:22,945 INFO L87 Difference]: Start difference. First operand 25160 states and 77057 transitions. Second operand 3 states. [2019-12-27 16:57:23,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:23,065 INFO L93 Difference]: Finished difference Result 29087 states and 88965 transitions. [2019-12-27 16:57:23,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:57:23,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 16:57:23,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:23,103 INFO L225 Difference]: With dead ends: 29087 [2019-12-27 16:57:23,103 INFO L226 Difference]: Without dead ends: 29087 [2019-12-27 16:57:23,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:57:23,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29087 states. [2019-12-27 16:57:23,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29087 to 25709. [2019-12-27 16:57:23,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25709 states. [2019-12-27 16:57:23,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25709 states to 25709 states and 78995 transitions. [2019-12-27 16:57:23,501 INFO L78 Accepts]: Start accepts. Automaton has 25709 states and 78995 transitions. Word has length 64 [2019-12-27 16:57:23,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:23,501 INFO L462 AbstractCegarLoop]: Abstraction has 25709 states and 78995 transitions. [2019-12-27 16:57:23,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:57:23,501 INFO L276 IsEmpty]: Start isEmpty. Operand 25709 states and 78995 transitions. [2019-12-27 16:57:23,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:57:23,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:23,529 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:23,530 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:23,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:23,530 INFO L82 PathProgramCache]: Analyzing trace with hash -998961960, now seen corresponding path program 1 times [2019-12-27 16:57:23,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:23,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663874750] [2019-12-27 16:57:23,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:23,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:57:23,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663874750] [2019-12-27 16:57:23,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:23,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:57:23,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1796360714] [2019-12-27 16:57:23,584 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:23,604 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:24,113 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 237 states and 443 transitions. [2019-12-27 16:57:24,113 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:24,133 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:57:24,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:57:24,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:24,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:57:24,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:57:24,134 INFO L87 Difference]: Start difference. First operand 25709 states and 78995 transitions. Second operand 5 states. [2019-12-27 16:57:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:24,614 INFO L93 Difference]: Finished difference Result 47016 states and 144217 transitions. [2019-12-27 16:57:24,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:57:24,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 16:57:24,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:24,679 INFO L225 Difference]: With dead ends: 47016 [2019-12-27 16:57:24,679 INFO L226 Difference]: Without dead ends: 47016 [2019-12-27 16:57:24,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:57:24,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47016 states. [2019-12-27 16:57:25,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47016 to 27902. [2019-12-27 16:57:25,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27902 states. [2019-12-27 16:57:25,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27902 states to 27902 states and 86148 transitions. [2019-12-27 16:57:25,241 INFO L78 Accepts]: Start accepts. Automaton has 27902 states and 86148 transitions. Word has length 65 [2019-12-27 16:57:25,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:25,241 INFO L462 AbstractCegarLoop]: Abstraction has 27902 states and 86148 transitions. [2019-12-27 16:57:25,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:57:25,241 INFO L276 IsEmpty]: Start isEmpty. Operand 27902 states and 86148 transitions. [2019-12-27 16:57:25,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:57:25,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:25,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:25,270 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:25,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:25,270 INFO L82 PathProgramCache]: Analyzing trace with hash 8687464, now seen corresponding path program 2 times [2019-12-27 16:57:25,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:25,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750472082] [2019-12-27 16:57:25,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:25,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:57:25,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750472082] [2019-12-27 16:57:25,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:25,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:57:25,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1693683795] [2019-12-27 16:57:25,316 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:25,342 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:25,613 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 423 transitions. [2019-12-27 16:57:25,614 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:25,615 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:57:25,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:57:25,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:25,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:57:25,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:57:25,618 INFO L87 Difference]: Start difference. First operand 27902 states and 86148 transitions. Second operand 3 states. [2019-12-27 16:57:25,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:25,843 INFO L93 Difference]: Finished difference Result 37296 states and 115240 transitions. [2019-12-27 16:57:25,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:57:25,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 16:57:25,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:25,898 INFO L225 Difference]: With dead ends: 37296 [2019-12-27 16:57:25,898 INFO L226 Difference]: Without dead ends: 37296 [2019-12-27 16:57:25,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:57:25,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37296 states. [2019-12-27 16:57:26,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37296 to 28399. [2019-12-27 16:57:26,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28399 states. [2019-12-27 16:57:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28399 states to 28399 states and 87699 transitions. [2019-12-27 16:57:26,409 INFO L78 Accepts]: Start accepts. Automaton has 28399 states and 87699 transitions. Word has length 65 [2019-12-27 16:57:26,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:26,410 INFO L462 AbstractCegarLoop]: Abstraction has 28399 states and 87699 transitions. [2019-12-27 16:57:26,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:57:26,410 INFO L276 IsEmpty]: Start isEmpty. Operand 28399 states and 87699 transitions. [2019-12-27 16:57:26,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:57:26,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:26,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:26,445 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:26,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:26,445 INFO L82 PathProgramCache]: Analyzing trace with hash 405134954, now seen corresponding path program 1 times [2019-12-27 16:57:26,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:26,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755213039] [2019-12-27 16:57:26,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:57:26,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755213039] [2019-12-27 16:57:26,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:26,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:57:26,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1235483254] [2019-12-27 16:57:26,811 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:26,831 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:27,054 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 423 transitions. [2019-12-27 16:57:27,054 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:27,148 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 16:57:27,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:57:27,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:27,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:57:27,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:57:27,149 INFO L87 Difference]: Start difference. First operand 28399 states and 87699 transitions. Second operand 11 states. [2019-12-27 16:57:30,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:30,032 INFO L93 Difference]: Finished difference Result 117473 states and 349296 transitions. [2019-12-27 16:57:30,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 16:57:30,033 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 16:57:30,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:30,196 INFO L225 Difference]: With dead ends: 117473 [2019-12-27 16:57:30,196 INFO L226 Difference]: Without dead ends: 109771 [2019-12-27 16:57:30,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=455, Invalid=1525, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 16:57:30,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109771 states. [2019-12-27 16:57:31,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109771 to 28059. [2019-12-27 16:57:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28059 states. [2019-12-27 16:57:31,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28059 states to 28059 states and 86395 transitions. [2019-12-27 16:57:31,275 INFO L78 Accepts]: Start accepts. Automaton has 28059 states and 86395 transitions. Word has length 65 [2019-12-27 16:57:31,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:31,275 INFO L462 AbstractCegarLoop]: Abstraction has 28059 states and 86395 transitions. [2019-12-27 16:57:31,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:57:31,276 INFO L276 IsEmpty]: Start isEmpty. Operand 28059 states and 86395 transitions. [2019-12-27 16:57:31,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:57:31,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:31,306 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:31,306 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:31,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:31,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1949977412, now seen corresponding path program 3 times [2019-12-27 16:57:31,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:31,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777316941] [2019-12-27 16:57:31,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:31,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:57:31,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777316941] [2019-12-27 16:57:31,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:31,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:57:31,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [573466462] [2019-12-27 16:57:31,377 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:31,397 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:31,835 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 186 states and 319 transitions. [2019-12-27 16:57:31,835 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:31,836 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:57:31,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:57:31,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:31,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:57:31,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:57:31,837 INFO L87 Difference]: Start difference. First operand 28059 states and 86395 transitions. Second operand 4 states. [2019-12-27 16:57:31,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:31,970 INFO L93 Difference]: Finished difference Result 27783 states and 85394 transitions. [2019-12-27 16:57:31,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:57:31,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 16:57:31,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:32,006 INFO L225 Difference]: With dead ends: 27783 [2019-12-27 16:57:32,006 INFO L226 Difference]: Without dead ends: 27783 [2019-12-27 16:57:32,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:57:32,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27783 states. [2019-12-27 16:57:32,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27783 to 24152. [2019-12-27 16:57:32,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24152 states. [2019-12-27 16:57:32,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24152 states to 24152 states and 73616 transitions. [2019-12-27 16:57:32,393 INFO L78 Accepts]: Start accepts. Automaton has 24152 states and 73616 transitions. Word has length 65 [2019-12-27 16:57:32,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:32,394 INFO L462 AbstractCegarLoop]: Abstraction has 24152 states and 73616 transitions. [2019-12-27 16:57:32,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:57:32,394 INFO L276 IsEmpty]: Start isEmpty. Operand 24152 states and 73616 transitions. [2019-12-27 16:57:32,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:57:32,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:32,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:32,419 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:32,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:32,419 INFO L82 PathProgramCache]: Analyzing trace with hash -755298849, now seen corresponding path program 1 times [2019-12-27 16:57:32,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:32,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486555478] [2019-12-27 16:57:32,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:32,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 16:57:32,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486555478] [2019-12-27 16:57:32,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:32,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:57:32,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1009854801] [2019-12-27 16:57:32,533 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:32,552 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:32,747 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 276 transitions. [2019-12-27 16:57:32,747 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:32,839 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 16:57:32,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:57:32,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:32,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:57:32,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:57:32,841 INFO L87 Difference]: Start difference. First operand 24152 states and 73616 transitions. Second operand 10 states. [2019-12-27 16:57:37,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:37,029 INFO L93 Difference]: Finished difference Result 57422 states and 170132 transitions. [2019-12-27 16:57:37,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 16:57:37,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 16:57:37,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:37,108 INFO L225 Difference]: With dead ends: 57422 [2019-12-27 16:57:37,108 INFO L226 Difference]: Without dead ends: 57170 [2019-12-27 16:57:37,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=315, Invalid=1491, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 16:57:37,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57170 states. [2019-12-27 16:57:38,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57170 to 28535. [2019-12-27 16:57:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28535 states. [2019-12-27 16:57:38,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28535 states to 28535 states and 86192 transitions. [2019-12-27 16:57:38,118 INFO L78 Accepts]: Start accepts. Automaton has 28535 states and 86192 transitions. Word has length 65 [2019-12-27 16:57:38,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:38,118 INFO L462 AbstractCegarLoop]: Abstraction has 28535 states and 86192 transitions. [2019-12-27 16:57:38,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:57:38,118 INFO L276 IsEmpty]: Start isEmpty. Operand 28535 states and 86192 transitions. [2019-12-27 16:57:38,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:57:38,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:38,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:38,147 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:38,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:38,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1171161157, now seen corresponding path program 2 times [2019-12-27 16:57:38,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:38,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063065698] [2019-12-27 16:57:38,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:57:38,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063065698] [2019-12-27 16:57:38,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:38,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 16:57:38,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1610896621] [2019-12-27 16:57:38,328 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:38,346 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:38,558 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 294 transitions. [2019-12-27 16:57:38,558 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:38,665 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 16:57:38,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:57:38,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:38,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:57:38,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:57:38,666 INFO L87 Difference]: Start difference. First operand 28535 states and 86192 transitions. Second operand 11 states. [2019-12-27 16:57:41,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:41,563 INFO L93 Difference]: Finished difference Result 51194 states and 152345 transitions. [2019-12-27 16:57:41,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 16:57:41,564 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 16:57:41,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:41,633 INFO L225 Difference]: With dead ends: 51194 [2019-12-27 16:57:41,633 INFO L226 Difference]: Without dead ends: 51194 [2019-12-27 16:57:41,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=267, Invalid=1293, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 16:57:41,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51194 states. [2019-12-27 16:57:42,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51194 to 28416. [2019-12-27 16:57:42,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28416 states. [2019-12-27 16:57:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28416 states to 28416 states and 85965 transitions. [2019-12-27 16:57:42,245 INFO L78 Accepts]: Start accepts. Automaton has 28416 states and 85965 transitions. Word has length 65 [2019-12-27 16:57:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:42,246 INFO L462 AbstractCegarLoop]: Abstraction has 28416 states and 85965 transitions. [2019-12-27 16:57:42,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:57:42,246 INFO L276 IsEmpty]: Start isEmpty. Operand 28416 states and 85965 transitions. [2019-12-27 16:57:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:57:42,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:42,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:42,275 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:42,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:42,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1095461897, now seen corresponding path program 3 times [2019-12-27 16:57:42,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:42,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444035180] [2019-12-27 16:57:42,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:57:42,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444035180] [2019-12-27 16:57:42,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:42,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:57:42,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [841256147] [2019-12-27 16:57:42,343 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:42,364 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:42,517 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 237 transitions. [2019-12-27 16:57:42,517 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:42,518 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:57:42,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:57:42,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:42,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:57:42,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:57:42,519 INFO L87 Difference]: Start difference. First operand 28416 states and 85965 transitions. Second operand 3 states. [2019-12-27 16:57:42,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:42,645 INFO L93 Difference]: Finished difference Result 23042 states and 68781 transitions. [2019-12-27 16:57:42,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:57:42,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 16:57:42,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:42,694 INFO L225 Difference]: With dead ends: 23042 [2019-12-27 16:57:42,695 INFO L226 Difference]: Without dead ends: 23042 [2019-12-27 16:57:42,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:57:42,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23042 states. [2019-12-27 16:57:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23042 to 22076. [2019-12-27 16:57:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22076 states. [2019-12-27 16:57:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22076 states to 22076 states and 65725 transitions. [2019-12-27 16:57:43,620 INFO L78 Accepts]: Start accepts. Automaton has 22076 states and 65725 transitions. Word has length 65 [2019-12-27 16:57:43,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:43,620 INFO L462 AbstractCegarLoop]: Abstraction has 22076 states and 65725 transitions. [2019-12-27 16:57:43,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:57:43,620 INFO L276 IsEmpty]: Start isEmpty. Operand 22076 states and 65725 transitions. [2019-12-27 16:57:43,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:57:43,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:43,644 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:43,644 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:43,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:43,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1362331982, now seen corresponding path program 1 times [2019-12-27 16:57:43,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:43,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027520034] [2019-12-27 16:57:43,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:57:43,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027520034] [2019-12-27 16:57:43,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:43,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:57:43,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1316327265] [2019-12-27 16:57:43,710 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:43,724 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:43,945 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 331 transitions. [2019-12-27 16:57:43,945 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:43,946 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:57:43,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:57:43,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:43,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:57:43,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:57:43,948 INFO L87 Difference]: Start difference. First operand 22076 states and 65725 transitions. Second operand 3 states. [2019-12-27 16:57:44,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:44,014 INFO L93 Difference]: Finished difference Result 22076 states and 65724 transitions. [2019-12-27 16:57:44,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:57:44,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 16:57:44,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:44,043 INFO L225 Difference]: With dead ends: 22076 [2019-12-27 16:57:44,043 INFO L226 Difference]: Without dead ends: 22076 [2019-12-27 16:57:44,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:57:44,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22076 states. [2019-12-27 16:57:44,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22076 to 16744. [2019-12-27 16:57:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16744 states. [2019-12-27 16:57:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16744 states to 16744 states and 50465 transitions. [2019-12-27 16:57:44,322 INFO L78 Accepts]: Start accepts. Automaton has 16744 states and 50465 transitions. Word has length 66 [2019-12-27 16:57:44,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:44,323 INFO L462 AbstractCegarLoop]: Abstraction has 16744 states and 50465 transitions. [2019-12-27 16:57:44,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:57:44,323 INFO L276 IsEmpty]: Start isEmpty. Operand 16744 states and 50465 transitions. [2019-12-27 16:57:44,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:57:44,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:44,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:44,339 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:44,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:44,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1790496915, now seen corresponding path program 1 times [2019-12-27 16:57:44,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:44,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130597628] [2019-12-27 16:57:44,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:57:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:57:44,455 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:57:44,455 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:57:44,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_89| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~y~0_33 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1013~0.base_51|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1013~0.base_51| 4) |v_#length_25|) (= v_~main$tmp_guard1~0_50 0) (= 0 v_~a$read_delayed_var~0.base_8) (= v_~a$mem_tmp~0_19 0) (= v_~a$r_buff1_thd3~0_279 0) (= 0 v_~a$r_buff1_thd2~0_156) (= v_~a$r_buff0_thd0~0_153 0) (= v_~a$r_buff0_thd3~0_364 0) (= v_~z~0_14 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1013~0.base_51| 1) |v_#valid_87|) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice0~0_15) (= 0 v_~a$w_buff1~0_224) (= 0 v_~__unbuffered_cnt~0_98) (= 0 v_~a$w_buff0_used~0_781) (= 0 v_~a$r_buff1_thd1~0_124) (= 0 v_~a$r_buff0_thd2~0_146) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= 0 v_~a$w_buff1_used~0_506) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1013~0.base_51| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1013~0.base_51|) |v_ULTIMATE.start_main_~#t1013~0.offset_32| 0)) |v_#memory_int_21|) (= |v_ULTIMATE.start_main_~#t1013~0.offset_32| 0) (= v_~a$r_buff1_thd0~0_160 0) (= |v_#NULL.offset_4| 0) (= v_~a$w_buff0~0_325 0) (= v_~a$flush_delayed~0_30 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1013~0.base_51|) 0) (= 0 v_~x~0_130) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~weak$$choice2~0_108 0) (= v_~a~0_163 0) (= v_~__unbuffered_p2_EBX~0_61 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= 0 v_~a$r_buff0_thd1~0_224) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1014~0.base=|v_ULTIMATE.start_main_~#t1014~0.base_39|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_156, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_28|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_60|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_153, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_210|, ~a~0=v_~a~0_163, ULTIMATE.start_main_~#t1013~0.offset=|v_ULTIMATE.start_main_~#t1013~0.offset_32|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_279, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_781, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_224, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_325, ULTIMATE.start_main_~#t1015~0.offset=|v_ULTIMATE.start_main_~#t1015~0.offset_20|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_160, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_130, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ULTIMATE.start_main_~#t1014~0.offset=|v_ULTIMATE.start_main_~#t1014~0.offset_19|, ULTIMATE.start_main_~#t1015~0.base=|v_ULTIMATE.start_main_~#t1015~0.base_28|, ~a$mem_tmp~0=v_~a$mem_tmp~0_19, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ~a$w_buff1~0=v_~a$w_buff1~0_224, ~y~0=v_~y~0_33, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_28|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_124, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_364, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_30, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_14, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_506, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t1013~0.base=|v_ULTIMATE.start_main_~#t1013~0.base_51|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1014~0.base, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_~#t1013~0.offset, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ULTIMATE.start_main_~#t1015~0.offset, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t1014~0.offset, ULTIMATE.start_main_~#t1015~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t1013~0.base] because there is no mapped edge [2019-12-27 16:57:44,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L748: Formula: (and (= ~a$r_buff1_thd2~0_Out2045332541 ~a$r_buff0_thd2~0_In2045332541) (= ~a$r_buff1_thd3~0_Out2045332541 ~a$r_buff0_thd3~0_In2045332541) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In2045332541 0)) (= ~x~0_Out2045332541 1) (= ~a$r_buff0_thd1~0_Out2045332541 1) (= ~a$r_buff0_thd1~0_In2045332541 ~a$r_buff1_thd1~0_Out2045332541) (= ~a$r_buff1_thd0~0_Out2045332541 ~a$r_buff0_thd0~0_In2045332541)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2045332541, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2045332541, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In2045332541, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2045332541, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2045332541} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out2045332541, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out2045332541, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out2045332541, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out2045332541, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2045332541, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2045332541, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In2045332541, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out2045332541, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2045332541, ~x~0=~x~0_Out2045332541} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 16:57:44,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L830-1-->L832: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1014~0.base_9| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1014~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1014~0.base_9|) |v_ULTIMATE.start_main_~#t1014~0.offset_7| 1)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1014~0.base_9| 4)) (= |v_ULTIMATE.start_main_~#t1014~0.offset_7| 0) (not (= |v_ULTIMATE.start_main_~#t1014~0.base_9| 0)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1014~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1014~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t1014~0.base=|v_ULTIMATE.start_main_~#t1014~0.base_9|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1014~0.offset=|v_ULTIMATE.start_main_~#t1014~0.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1014~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1014~0.offset] because there is no mapped edge [2019-12-27 16:57:44,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L832-1-->L834: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1015~0.base_9| 4) |v_#length_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1015~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1015~0.base_9|) |v_ULTIMATE.start_main_~#t1015~0.offset_8| 2))) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1015~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1015~0.base_9| 0)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1015~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t1015~0.offset_8| 0) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1015~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1015~0.base=|v_ULTIMATE.start_main_~#t1015~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1015~0.offset=|v_ULTIMATE.start_main_~#t1015~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1015~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1015~0.offset, #length] because there is no mapped edge [2019-12-27 16:57:44,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd2~0_In1630352703 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1630352703 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out1630352703| |P1Thread1of1ForFork2_#t~ite10_Out1630352703|))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1630352703| ~a~0_In1630352703) (or .cse0 .cse1) .cse2) (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In1630352703 |P1Thread1of1ForFork2_#t~ite9_Out1630352703|) .cse2))) InVars {~a~0=~a~0_In1630352703, ~a$w_buff1~0=~a$w_buff1~0_In1630352703, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1630352703, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1630352703} OutVars{~a~0=~a~0_In1630352703, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1630352703|, ~a$w_buff1~0=~a$w_buff1~0_In1630352703, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1630352703, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1630352703|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1630352703} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 16:57:44,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In1376560748 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1376560748 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1376560748| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1376560748| ~a$w_buff0_used~0_In1376560748)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1376560748, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1376560748} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1376560748, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1376560748, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1376560748|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 16:57:44,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-621233626 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-621233626 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In-621233626 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-621233626 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-621233626|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In-621233626 |P1Thread1of1ForFork2_#t~ite12_Out-621233626|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-621233626, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-621233626, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-621233626, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-621233626} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-621233626, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-621233626, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-621233626, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-621233626|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-621233626} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 16:57:44,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-211930288 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In-211930288| |P2Thread1of1ForFork0_#t~ite20_Out-211930288|) (= |P2Thread1of1ForFork0_#t~ite21_Out-211930288| ~a$w_buff0~0_In-211930288)) (and (= |P2Thread1of1ForFork0_#t~ite20_Out-211930288| ~a$w_buff0~0_In-211930288) (= |P2Thread1of1ForFork0_#t~ite20_Out-211930288| |P2Thread1of1ForFork0_#t~ite21_Out-211930288|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-211930288 256)))) (or (= (mod ~a$w_buff0_used~0_In-211930288 256) 0) (and (= (mod ~a$w_buff1_used~0_In-211930288 256) 0) .cse1) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-211930288 256) 0)))) .cse0))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-211930288, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-211930288, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-211930288, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-211930288, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-211930288, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-211930288|, ~weak$$choice2~0=~weak$$choice2~0_In-211930288} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-211930288|, ~a$w_buff0~0=~a$w_buff0~0_In-211930288, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-211930288, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-211930288, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-211930288, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-211930288|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-211930288, ~weak$$choice2~0=~weak$$choice2~0_In-211930288} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 16:57:44,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1739053376 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1739053376 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out-1739053376| 0) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd2~0_In-1739053376 |P1Thread1of1ForFork2_#t~ite13_Out-1739053376|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1739053376, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1739053376} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1739053376, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1739053376, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1739053376|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 16:57:44,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In903278430 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In903278430 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd2~0_In903278430 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In903278430 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out903278430| ~a$r_buff1_thd2~0_In903278430)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork2_#t~ite14_Out903278430| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In903278430, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In903278430, ~a$w_buff0_used~0=~a$w_buff0_used~0_In903278430, ~a$w_buff1_used~0=~a$w_buff1_used~0_In903278430} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In903278430, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In903278430, ~a$w_buff0_used~0=~a$w_buff0_used~0_In903278430, ~a$w_buff1_used~0=~a$w_buff1_used~0_In903278430, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out903278430|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 16:57:44,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L772-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_50| v_~a$r_buff1_thd2~0_119) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_119, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 16:57:44,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1874476456 256)))) (or (and (not .cse0) (= ~a$w_buff1~0_In1874476456 |P2Thread1of1ForFork0_#t~ite24_Out1874476456|) (= |P2Thread1of1ForFork0_#t~ite23_In1874476456| |P2Thread1of1ForFork0_#t~ite23_Out1874476456|)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1874476456 256) 0))) (or (and (= (mod ~a$w_buff1_used~0_In1874476456 256) 0) .cse1) (and (= 0 (mod ~a$r_buff1_thd3~0_In1874476456 256)) .cse1) (= (mod ~a$w_buff0_used~0_In1874476456 256) 0))) .cse0 (= |P2Thread1of1ForFork0_#t~ite23_Out1874476456| |P2Thread1of1ForFork0_#t~ite24_Out1874476456|) (= |P2Thread1of1ForFork0_#t~ite23_Out1874476456| ~a$w_buff1~0_In1874476456)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In1874476456, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1874476456|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1874476456, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1874476456, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1874476456, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1874476456, ~weak$$choice2~0=~weak$$choice2~0_In1874476456} OutVars{~a$w_buff1~0=~a$w_buff1~0_In1874476456, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1874476456|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1874476456|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1874476456, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1874476456, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1874476456, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1874476456, ~weak$$choice2~0=~weak$$choice2~0_In1874476456} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 16:57:44,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L798-->L798-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In585349814 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out585349814| ~a$w_buff0_used~0_In585349814) (= |P2Thread1of1ForFork0_#t~ite26_In585349814| |P2Thread1of1ForFork0_#t~ite26_Out585349814|)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out585349814| |P2Thread1of1ForFork0_#t~ite26_Out585349814|) (= |P2Thread1of1ForFork0_#t~ite26_Out585349814| ~a$w_buff0_used~0_In585349814) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In585349814 256) 0))) (or (and (= 0 (mod ~a$w_buff1_used~0_In585349814 256)) .cse1) (= (mod ~a$w_buff0_used~0_In585349814 256) 0) (and (= (mod ~a$r_buff1_thd3~0_In585349814 256) 0) .cse1)))))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In585349814|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In585349814, ~a$w_buff0_used~0=~a$w_buff0_used~0_In585349814, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In585349814, ~a$w_buff1_used~0=~a$w_buff1_used~0_In585349814, ~weak$$choice2~0=~weak$$choice2~0_In585349814} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out585349814|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out585349814|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In585349814, ~a$w_buff0_used~0=~a$w_buff0_used~0_In585349814, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In585349814, ~a$w_buff1_used~0=~a$w_buff1_used~0_In585349814, ~weak$$choice2~0=~weak$$choice2~0_In585349814} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 16:57:44,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_71 v_~a$r_buff0_thd3~0_70)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_70, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 16:57:44,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_39 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_39, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 16:57:44,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1658890258 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1658890258 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-1658890258| ~a~0_In-1658890258)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-1658890258| ~a$w_buff1~0_In-1658890258) (not .cse1)))) InVars {~a~0=~a~0_In-1658890258, ~a$w_buff1~0=~a$w_buff1~0_In-1658890258, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1658890258, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1658890258} OutVars{~a~0=~a~0_In-1658890258, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1658890258|, ~a$w_buff1~0=~a$w_buff1~0_In-1658890258, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1658890258, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1658890258} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 16:57:44,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 16:57:44,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-350022799 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-350022799 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-350022799 |P2Thread1of1ForFork0_#t~ite40_Out-350022799|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-350022799|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-350022799, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-350022799} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-350022799|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-350022799, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-350022799} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 16:57:44,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-943559416 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-943559416 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-943559416| 0)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-943559416 |P0Thread1of1ForFork1_#t~ite5_Out-943559416|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-943559416, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-943559416} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-943559416|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-943559416, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-943559416} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 16:57:44,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In922240871 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In922240871 256))) (.cse2 (= (mod ~a$r_buff1_thd1~0_In922240871 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In922240871 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out922240871|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In922240871 |P0Thread1of1ForFork1_#t~ite6_Out922240871|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In922240871, ~a$w_buff0_used~0=~a$w_buff0_used~0_In922240871, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In922240871, ~a$w_buff1_used~0=~a$w_buff1_used~0_In922240871} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out922240871|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In922240871, ~a$w_buff0_used~0=~a$w_buff0_used~0_In922240871, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In922240871, ~a$w_buff1_used~0=~a$w_buff1_used~0_In922240871} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 16:57:44,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-1068373522 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1068373522 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out-1068373522)) (and (= ~a$r_buff0_thd1~0_In-1068373522 ~a$r_buff0_thd1~0_Out-1068373522) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1068373522, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1068373522} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1068373522|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1068373522, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1068373522} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:57:44,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-839701938 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-839701938 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-839701938 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-839701938 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-839701938|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~a$r_buff1_thd1~0_In-839701938 |P0Thread1of1ForFork1_#t~ite8_Out-839701938|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-839701938, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-839701938, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-839701938, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-839701938} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-839701938|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-839701938, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-839701938, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-839701938, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-839701938} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 16:57:44,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_27|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_67, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:57:44,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In1571821927 256))) (.cse3 (= (mod ~a$r_buff0_thd3~0_In1571821927 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In1571821927 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1571821927 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out1571821927| ~a$w_buff1_used~0_In1571821927) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite41_Out1571821927| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1571821927, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1571821927, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1571821927, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1571821927} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1571821927, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1571821927, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1571821927, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1571821927, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1571821927|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 16:57:44,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In783052533 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In783052533 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out783052533|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd3~0_In783052533 |P2Thread1of1ForFork0_#t~ite42_Out783052533|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In783052533, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In783052533} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In783052533, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In783052533, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out783052533|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 16:57:44,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In-775138204 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-775138204 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-775138204 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-775138204 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-775138204| 0)) (and (or .cse2 .cse3) (= ~a$r_buff1_thd3~0_In-775138204 |P2Thread1of1ForFork0_#t~ite43_Out-775138204|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-775138204, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-775138204, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-775138204, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-775138204} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-775138204|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-775138204, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-775138204, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-775138204, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-775138204} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 16:57:44,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~a$r_buff1_thd3~0_120 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 16:57:44,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_24) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:57:44,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite48_Out141561796| |ULTIMATE.start_main_#t~ite47_Out141561796|)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In141561796 256))) (.cse0 (= (mod ~a$r_buff1_thd0~0_In141561796 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out141561796| ~a$w_buff1~0_In141561796) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite47_Out141561796| ~a~0_In141561796) .cse1 (or .cse2 .cse0)))) InVars {~a~0=~a~0_In141561796, ~a$w_buff1~0=~a$w_buff1~0_In141561796, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In141561796, ~a$w_buff1_used~0=~a$w_buff1_used~0_In141561796} OutVars{~a~0=~a~0_In141561796, ~a$w_buff1~0=~a$w_buff1~0_In141561796, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out141561796|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In141561796, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out141561796|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In141561796} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 16:57:44,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In575523056 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In575523056 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out575523056| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out575523056| ~a$w_buff0_used~0_In575523056) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In575523056, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In575523056} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In575523056, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out575523056|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In575523056} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 16:57:44,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd0~0_In1398369955 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1398369955 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In1398369955 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In1398369955 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out1398369955| ~a$w_buff1_used~0_In1398369955) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out1398369955| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1398369955, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1398369955, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1398369955, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1398369955} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1398369955|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1398369955, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1398369955, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1398369955, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1398369955} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 16:57:44,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-490798445 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-490798445 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-490798445|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd0~0_In-490798445 |ULTIMATE.start_main_#t~ite51_Out-490798445|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-490798445, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-490798445} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-490798445|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-490798445, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-490798445} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 16:57:44,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In-395427709 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-395427709 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-395427709 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-395427709 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-395427709| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite52_Out-395427709| ~a$r_buff1_thd0~0_In-395427709) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-395427709, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-395427709, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-395427709, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-395427709} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-395427709|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-395427709, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-395427709, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-395427709, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-395427709} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 16:57:44,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_24) (= v_~x~0_77 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~a$r_buff1_thd0~0_109 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_19 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_77} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_77, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:57:44,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:57:44 BasicIcfg [2019-12-27 16:57:44,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:57:44,579 INFO L168 Benchmark]: Toolchain (without parser) took 119373.15 ms. Allocated memory was 138.4 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 100.2 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 16:57:44,580 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 16:57:44,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 843.34 ms. Allocated memory was 138.4 MB in the beginning and 204.5 MB in the end (delta: 66.1 MB). Free memory was 100.0 MB in the beginning and 157.5 MB in the end (delta: -57.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:57:44,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.54 ms. Allocated memory is still 204.5 MB. Free memory was 157.5 MB in the beginning and 154.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:57:44,581 INFO L168 Benchmark]: Boogie Preprocessor took 44.71 ms. Allocated memory is still 204.5 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:57:44,582 INFO L168 Benchmark]: RCFGBuilder took 841.22 ms. Allocated memory is still 204.5 MB. Free memory was 152.8 MB in the beginning and 102.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:57:44,582 INFO L168 Benchmark]: TraceAbstraction took 117575.85 ms. Allocated memory was 204.5 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 101.6 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 16:57:44,585 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.21 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 843.34 ms. Allocated memory was 138.4 MB in the beginning and 204.5 MB in the end (delta: 66.1 MB). Free memory was 100.0 MB in the beginning and 157.5 MB in the end (delta: -57.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.54 ms. Allocated memory is still 204.5 MB. Free memory was 157.5 MB in the beginning and 154.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.71 ms. Allocated memory is still 204.5 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 841.22 ms. Allocated memory is still 204.5 MB. Free memory was 152.8 MB in the beginning and 102.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 117575.85 ms. Allocated memory was 204.5 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 101.6 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 100 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 33 ChoiceCompositions, 7286 VarBasedMoverChecksPositive, 247 VarBasedMoverChecksNegative, 37 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 87212 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1013, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1014, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L834] FCALL, FORK 0 pthread_create(&t1015, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L782] 3 y = 1 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 117.2s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 50.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7937 SDtfs, 12798 SDslu, 24531 SDs, 0 SdLazy, 22616 SolverSat, 875 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 730 GetRequests, 238 SyntacticMatches, 38 SemanticMatches, 454 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4662 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137801occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 37.0s AutomataMinimizationTime, 30 MinimizatonAttempts, 603529 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1354 NumberOfCodeBlocks, 1354 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1257 ConstructedInterpolants, 0 QuantifiedInterpolants, 205951 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...