/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:37:54,833 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:37:54,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:37:54,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:37:54,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:37:54,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:37:54,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:37:54,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:37:54,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:37:54,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:37:54,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:37:54,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:37:54,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:37:54,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:37:54,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:37:54,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:37:54,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:37:54,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:37:54,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:37:54,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:37:54,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:37:54,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:37:54,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:37:54,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:37:54,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:37:54,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:37:54,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:37:54,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:37:54,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:37:54,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:37:54,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:37:54,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:37:54,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:37:54,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:37:54,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:37:54,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:37:54,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:37:54,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:37:54,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:37:54,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:37:54,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:37:54,913 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-VariableLbe.epf [2019-12-27 07:37:54,930 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:37:54,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:37:54,931 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:37:54,931 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:37:54,931 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:37:54,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:37:54,932 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:37:54,932 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:37:54,932 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:37:54,932 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:37:54,932 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:37:54,932 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:37:54,933 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:37:54,933 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:37:54,933 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:37:54,933 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:37:54,933 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:37:54,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:37:54,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:37:54,936 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:37:54,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:37:54,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:37:54,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:37:54,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:37:54,938 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:37:54,938 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:37:54,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:37:54,938 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:37:54,938 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:37:54,939 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:37:55,235 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:37:55,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:37:55,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:37:55,253 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:37:55,253 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:37:55,254 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.opt.i [2019-12-27 07:37:55,309 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01e43d7eb/99a32e0f242742d9861db147b6a8646c/FLAGa653fda76 [2019-12-27 07:37:55,873 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:37:55,873 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.opt.i [2019-12-27 07:37:55,886 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01e43d7eb/99a32e0f242742d9861db147b6a8646c/FLAGa653fda76 [2019-12-27 07:37:56,145 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01e43d7eb/99a32e0f242742d9861db147b6a8646c [2019-12-27 07:37:56,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:37:56,155 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:37:56,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:37:56,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:37:56,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:37:56,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:37:56" (1/1) ... [2019-12-27 07:37:56,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd32435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:56, skipping insertion in model container [2019-12-27 07:37:56,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:37:56" (1/1) ... [2019-12-27 07:37:56,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:37:56,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:37:56,852 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:37:56,870 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:37:56,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:37:57,034 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:37:57,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:57 WrapperNode [2019-12-27 07:37:57,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:37:57,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:37:57,035 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:37:57,035 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:37:57,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:57" (1/1) ... [2019-12-27 07:37:57,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:57" (1/1) ... [2019-12-27 07:37:57,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:37:57,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:37:57,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:37:57,101 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:37:57,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:57" (1/1) ... [2019-12-27 07:37:57,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:57" (1/1) ... [2019-12-27 07:37:57,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:57" (1/1) ... [2019-12-27 07:37:57,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:57" (1/1) ... [2019-12-27 07:37:57,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:57" (1/1) ... [2019-12-27 07:37:57,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:57" (1/1) ... [2019-12-27 07:37:57,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:57" (1/1) ... [2019-12-27 07:37:57,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:37:57,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:37:57,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:37:57,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:37:57,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:57" (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 07:37:57,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:37:57,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:37:57,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:37:57,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:37:57,226 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:37:57,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:37:57,226 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:37:57,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:37:57,227 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:37:57,227 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:37:57,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:37:57,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:37:57,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:37:57,230 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 07:37:57,990 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:37:57,990 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:37:57,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:37:57 BoogieIcfgContainer [2019-12-27 07:37:57,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:37:57,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:37:57,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:37:57,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:37:57,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:37:56" (1/3) ... [2019-12-27 07:37:57,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ee5e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:37:57, skipping insertion in model container [2019-12-27 07:37:57,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:37:57" (2/3) ... [2019-12-27 07:37:57,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ee5e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:37:57, skipping insertion in model container [2019-12-27 07:37:57,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:37:57" (3/3) ... [2019-12-27 07:37:57,999 INFO L109 eAbstractionObserver]: Analyzing ICFG safe012_pso.opt.i [2019-12-27 07:37:58,010 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:37:58,011 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:37:58,021 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:37:58,022 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:37:58,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,068 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,069 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,118 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,118 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,118 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,118 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,119 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,125 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,125 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,134 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,134 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,134 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,140 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,140 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,145 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,146 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:37:58,165 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:37:58,186 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:37:58,186 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:37:58,186 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:37:58,186 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:37:58,186 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:37:58,186 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:37:58,187 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:37:58,187 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:37:58,204 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 07:37:58,206 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 07:37:58,304 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 07:37:58,304 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:37:58,320 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 07:37:58,345 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 07:37:58,395 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 07:37:58,396 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:37:58,403 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 07:37:58,422 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 07:37:58,424 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:38:02,109 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 07:38:02,224 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 07:38:02,311 INFO L206 etLargeBlockEncoding]: Checked pairs total: 67273 [2019-12-27 07:38:02,312 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 07:38:02,316 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 89 transitions [2019-12-27 07:38:13,141 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85916 states. [2019-12-27 07:38:13,143 INFO L276 IsEmpty]: Start isEmpty. Operand 85916 states. [2019-12-27 07:38:13,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:38:13,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:38:13,150 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:38:13,150 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:38:13,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:38:13,156 INFO L82 PathProgramCache]: Analyzing trace with hash 800242347, now seen corresponding path program 1 times [2019-12-27 07:38:13,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:38:13,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092395882] [2019-12-27 07:38:13,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:38:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:38:13,417 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 07:38:13,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092395882] [2019-12-27 07:38:13,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:38:13,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:38:13,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563424553] [2019-12-27 07:38:13,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:38:13,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:38:13,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:38:13,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:38:13,441 INFO L87 Difference]: Start difference. First operand 85916 states. Second operand 3 states. [2019-12-27 07:38:16,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:38:16,347 INFO L93 Difference]: Finished difference Result 84146 states and 359873 transitions. [2019-12-27 07:38:16,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:38:16,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:38:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:38:17,098 INFO L225 Difference]: With dead ends: 84146 [2019-12-27 07:38:17,099 INFO L226 Difference]: Without dead ends: 79232 [2019-12-27 07:38:17,100 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 07:38:21,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79232 states. [2019-12-27 07:38:23,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79232 to 79232. [2019-12-27 07:38:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79232 states. [2019-12-27 07:38:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79232 states to 79232 states and 338383 transitions. [2019-12-27 07:38:24,247 INFO L78 Accepts]: Start accepts. Automaton has 79232 states and 338383 transitions. Word has length 5 [2019-12-27 07:38:24,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:38:24,247 INFO L462 AbstractCegarLoop]: Abstraction has 79232 states and 338383 transitions. [2019-12-27 07:38:24,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:38:24,247 INFO L276 IsEmpty]: Start isEmpty. Operand 79232 states and 338383 transitions. [2019-12-27 07:38:24,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:38:24,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:38:24,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:38:24,256 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:38:24,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:38:24,256 INFO L82 PathProgramCache]: Analyzing trace with hash 438269963, now seen corresponding path program 1 times [2019-12-27 07:38:24,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:38:24,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925790306] [2019-12-27 07:38:24,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:38:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:38:24,383 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 07:38:24,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925790306] [2019-12-27 07:38:24,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:38:24,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:38:24,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780342740] [2019-12-27 07:38:24,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:38:24,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:38:24,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:38:24,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:38:24,386 INFO L87 Difference]: Start difference. First operand 79232 states and 338383 transitions. Second operand 4 states. [2019-12-27 07:38:28,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:38:28,158 INFO L93 Difference]: Finished difference Result 121026 states and 493729 transitions. [2019-12-27 07:38:28,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:38:28,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:38:28,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:38:28,678 INFO L225 Difference]: With dead ends: 121026 [2019-12-27 07:38:28,678 INFO L226 Difference]: Without dead ends: 120935 [2019-12-27 07:38:28,679 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 07:38:32,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120935 states. [2019-12-27 07:38:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120935 to 109733. [2019-12-27 07:38:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109733 states. [2019-12-27 07:38:35,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109733 states to 109733 states and 453798 transitions. [2019-12-27 07:38:35,390 INFO L78 Accepts]: Start accepts. Automaton has 109733 states and 453798 transitions. Word has length 13 [2019-12-27 07:38:35,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:38:35,391 INFO L462 AbstractCegarLoop]: Abstraction has 109733 states and 453798 transitions. [2019-12-27 07:38:35,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:38:35,391 INFO L276 IsEmpty]: Start isEmpty. Operand 109733 states and 453798 transitions. [2019-12-27 07:38:35,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:38:35,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:38:35,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:38:35,395 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:38:35,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:38:35,396 INFO L82 PathProgramCache]: Analyzing trace with hash 777110306, now seen corresponding path program 1 times [2019-12-27 07:38:35,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:38:35,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133398545] [2019-12-27 07:38:35,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:38:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:38:35,500 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 07:38:35,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133398545] [2019-12-27 07:38:35,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:38:35,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:38:35,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676614636] [2019-12-27 07:38:35,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:38:35,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:38:35,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:38:35,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:38:35,503 INFO L87 Difference]: Start difference. First operand 109733 states and 453798 transitions. Second operand 4 states. [2019-12-27 07:38:39,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:38:39,828 INFO L93 Difference]: Finished difference Result 151774 states and 613241 transitions. [2019-12-27 07:38:39,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:38:39,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:38:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:38:40,252 INFO L225 Difference]: With dead ends: 151774 [2019-12-27 07:38:40,252 INFO L226 Difference]: Without dead ends: 151670 [2019-12-27 07:38:40,253 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 07:38:44,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151670 states. [2019-12-27 07:38:47,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151670 to 127872. [2019-12-27 07:38:47,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127872 states. [2019-12-27 07:38:47,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127872 states to 127872 states and 526262 transitions. [2019-12-27 07:38:47,453 INFO L78 Accepts]: Start accepts. Automaton has 127872 states and 526262 transitions. Word has length 13 [2019-12-27 07:38:47,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:38:47,454 INFO L462 AbstractCegarLoop]: Abstraction has 127872 states and 526262 transitions. [2019-12-27 07:38:47,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:38:47,454 INFO L276 IsEmpty]: Start isEmpty. Operand 127872 states and 526262 transitions. [2019-12-27 07:38:47,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:38:47,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:38:47,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:38:47,458 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:38:47,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:38:47,458 INFO L82 PathProgramCache]: Analyzing trace with hash -2011904106, now seen corresponding path program 1 times [2019-12-27 07:38:47,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:38:47,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679235923] [2019-12-27 07:38:47,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:38:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:38:47,557 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 07:38:47,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679235923] [2019-12-27 07:38:47,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:38:47,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:38:47,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398631742] [2019-12-27 07:38:47,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:38:47,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:38:47,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:38:47,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:38:47,560 INFO L87 Difference]: Start difference. First operand 127872 states and 526262 transitions. Second operand 5 states. [2019-12-27 07:38:53,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:38:53,383 INFO L93 Difference]: Finished difference Result 172642 states and 696404 transitions. [2019-12-27 07:38:53,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:38:53,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 07:38:53,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:38:53,877 INFO L225 Difference]: With dead ends: 172642 [2019-12-27 07:38:53,877 INFO L226 Difference]: Without dead ends: 172506 [2019-12-27 07:38:53,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:38:57,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172506 states. [2019-12-27 07:39:00,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172506 to 133126. [2019-12-27 07:39:00,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133126 states. [2019-12-27 07:39:01,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133126 states to 133126 states and 547571 transitions. [2019-12-27 07:39:01,040 INFO L78 Accepts]: Start accepts. Automaton has 133126 states and 547571 transitions. Word has length 14 [2019-12-27 07:39:01,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:01,041 INFO L462 AbstractCegarLoop]: Abstraction has 133126 states and 547571 transitions. [2019-12-27 07:39:01,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:39:01,041 INFO L276 IsEmpty]: Start isEmpty. Operand 133126 states and 547571 transitions. [2019-12-27 07:39:01,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 07:39:01,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:01,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:01,063 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:01,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:01,063 INFO L82 PathProgramCache]: Analyzing trace with hash 548423730, now seen corresponding path program 1 times [2019-12-27 07:39:01,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:01,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203724208] [2019-12-27 07:39:01,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:01,131 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 07:39:01,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203724208] [2019-12-27 07:39:01,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:01,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:39:01,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491322241] [2019-12-27 07:39:01,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:39:01,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:01,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:39:01,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:39:01,134 INFO L87 Difference]: Start difference. First operand 133126 states and 547571 transitions. Second operand 3 states. [2019-12-27 07:39:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:01,740 INFO L93 Difference]: Finished difference Result 132731 states and 546022 transitions. [2019-12-27 07:39:01,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:39:01,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 07:39:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:07,429 INFO L225 Difference]: With dead ends: 132731 [2019-12-27 07:39:07,429 INFO L226 Difference]: Without dead ends: 132731 [2019-12-27 07:39:07,429 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 07:39:10,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132731 states. [2019-12-27 07:39:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132731 to 132731. [2019-12-27 07:39:12,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132731 states. [2019-12-27 07:39:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132731 states to 132731 states and 546022 transitions. [2019-12-27 07:39:13,143 INFO L78 Accepts]: Start accepts. Automaton has 132731 states and 546022 transitions. Word has length 18 [2019-12-27 07:39:13,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:13,144 INFO L462 AbstractCegarLoop]: Abstraction has 132731 states and 546022 transitions. [2019-12-27 07:39:13,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:39:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 132731 states and 546022 transitions. [2019-12-27 07:39:13,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 07:39:13,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:13,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:13,167 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:13,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:13,167 INFO L82 PathProgramCache]: Analyzing trace with hash -300265676, now seen corresponding path program 1 times [2019-12-27 07:39:13,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:13,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340255179] [2019-12-27 07:39:13,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:13,230 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 07:39:13,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340255179] [2019-12-27 07:39:13,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:13,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:39:13,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453224186] [2019-12-27 07:39:13,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:39:13,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:13,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:39:13,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:39:13,232 INFO L87 Difference]: Start difference. First operand 132731 states and 546022 transitions. Second operand 4 states. [2019-12-27 07:39:15,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:15,595 INFO L93 Difference]: Finished difference Result 241705 states and 995862 transitions. [2019-12-27 07:39:15,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:39:15,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 07:39:15,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:16,036 INFO L225 Difference]: With dead ends: 241705 [2019-12-27 07:39:16,036 INFO L226 Difference]: Without dead ends: 132095 [2019-12-27 07:39:16,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 07:39:25,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132095 states. [2019-12-27 07:39:27,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132095 to 131335. [2019-12-27 07:39:27,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131335 states. [2019-12-27 07:39:28,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131335 states to 131335 states and 534984 transitions. [2019-12-27 07:39:28,007 INFO L78 Accepts]: Start accepts. Automaton has 131335 states and 534984 transitions. Word has length 19 [2019-12-27 07:39:28,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:28,007 INFO L462 AbstractCegarLoop]: Abstraction has 131335 states and 534984 transitions. [2019-12-27 07:39:28,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:39:28,008 INFO L276 IsEmpty]: Start isEmpty. Operand 131335 states and 534984 transitions. [2019-12-27 07:39:28,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 07:39:28,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:28,021 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:28,021 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:28,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:28,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1452908293, now seen corresponding path program 1 times [2019-12-27 07:39:28,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:28,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512158248] [2019-12-27 07:39:28,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:28,130 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 07:39:28,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512158248] [2019-12-27 07:39:28,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:28,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:39:28,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661135377] [2019-12-27 07:39:28,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:39:28,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:28,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:39:28,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:39:28,132 INFO L87 Difference]: Start difference. First operand 131335 states and 534984 transitions. Second operand 5 states. [2019-12-27 07:39:30,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:30,427 INFO L93 Difference]: Finished difference Result 180323 states and 718868 transitions. [2019-12-27 07:39:30,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:39:30,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 07:39:30,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:30,933 INFO L225 Difference]: With dead ends: 180323 [2019-12-27 07:39:30,934 INFO L226 Difference]: Without dead ends: 178643 [2019-12-27 07:39:30,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:39:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178643 states. [2019-12-27 07:39:42,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178643 to 133631. [2019-12-27 07:39:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133631 states. [2019-12-27 07:39:43,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133631 states to 133631 states and 544219 transitions. [2019-12-27 07:39:43,058 INFO L78 Accepts]: Start accepts. Automaton has 133631 states and 544219 transitions. Word has length 19 [2019-12-27 07:39:43,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:43,059 INFO L462 AbstractCegarLoop]: Abstraction has 133631 states and 544219 transitions. [2019-12-27 07:39:43,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:39:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 133631 states and 544219 transitions. [2019-12-27 07:39:43,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 07:39:43,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:43,076 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] [2019-12-27 07:39:43,076 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:43,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:43,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1235441066, now seen corresponding path program 1 times [2019-12-27 07:39:43,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:43,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109507810] [2019-12-27 07:39:43,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:43,130 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 07:39:43,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109507810] [2019-12-27 07:39:43,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:43,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:39:43,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410419557] [2019-12-27 07:39:43,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:39:43,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:43,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:39:43,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:39:43,132 INFO L87 Difference]: Start difference. First operand 133631 states and 544219 transitions. Second operand 4 states. [2019-12-27 07:39:45,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:45,251 INFO L93 Difference]: Finished difference Result 203091 states and 834358 transitions. [2019-12-27 07:39:45,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:39:45,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-27 07:39:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:45,537 INFO L225 Difference]: With dead ends: 203091 [2019-12-27 07:39:45,538 INFO L226 Difference]: Without dead ends: 92693 [2019-12-27 07:39:45,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 07:39:49,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92693 states. [2019-12-27 07:39:56,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92693 to 86281. [2019-12-27 07:39:56,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86281 states. [2019-12-27 07:39:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86281 states to 86281 states and 352873 transitions. [2019-12-27 07:39:56,777 INFO L78 Accepts]: Start accepts. Automaton has 86281 states and 352873 transitions. Word has length 20 [2019-12-27 07:39:56,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:56,778 INFO L462 AbstractCegarLoop]: Abstraction has 86281 states and 352873 transitions. [2019-12-27 07:39:56,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:39:56,778 INFO L276 IsEmpty]: Start isEmpty. Operand 86281 states and 352873 transitions. [2019-12-27 07:39:56,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 07:39:56,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:56,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] [2019-12-27 07:39:56,794 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:56,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:56,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1125330895, now seen corresponding path program 1 times [2019-12-27 07:39:56,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:56,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684556241] [2019-12-27 07:39:56,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:56,879 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 07:39:56,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684556241] [2019-12-27 07:39:56,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:56,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:39:56,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832925535] [2019-12-27 07:39:56,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:39:56,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:56,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:39:56,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:39:56,882 INFO L87 Difference]: Start difference. First operand 86281 states and 352873 transitions. Second operand 4 states. [2019-12-27 07:39:57,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:57,049 INFO L93 Difference]: Finished difference Result 21255 states and 73968 transitions. [2019-12-27 07:39:57,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:39:57,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-27 07:39:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:57,095 INFO L225 Difference]: With dead ends: 21255 [2019-12-27 07:39:57,095 INFO L226 Difference]: Without dead ends: 17290 [2019-12-27 07:39:57,096 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 07:39:57,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2019-12-27 07:39:58,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 17289. [2019-12-27 07:39:58,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17289 states. [2019-12-27 07:39:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17289 states to 17289 states and 57966 transitions. [2019-12-27 07:39:58,064 INFO L78 Accepts]: Start accepts. Automaton has 17289 states and 57966 transitions. Word has length 21 [2019-12-27 07:39:58,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:58,064 INFO L462 AbstractCegarLoop]: Abstraction has 17289 states and 57966 transitions. [2019-12-27 07:39:58,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:39:58,064 INFO L276 IsEmpty]: Start isEmpty. Operand 17289 states and 57966 transitions. [2019-12-27 07:39:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 07:39:58,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:58,067 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 07:39:58,068 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:58,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:58,068 INFO L82 PathProgramCache]: Analyzing trace with hash 308223967, now seen corresponding path program 1 times [2019-12-27 07:39:58,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:58,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552323607] [2019-12-27 07:39:58,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:58,133 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 07:39:58,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552323607] [2019-12-27 07:39:58,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:58,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:39:58,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418841467] [2019-12-27 07:39:58,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:39:58,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:58,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:39:58,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:39:58,135 INFO L87 Difference]: Start difference. First operand 17289 states and 57966 transitions. Second operand 6 states. [2019-12-27 07:39:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:58,554 INFO L93 Difference]: Finished difference Result 17791 states and 58588 transitions. [2019-12-27 07:39:58,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:39:58,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 07:39:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:58,592 INFO L225 Difference]: With dead ends: 17791 [2019-12-27 07:39:58,592 INFO L226 Difference]: Without dead ends: 17166 [2019-12-27 07:39:58,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:39:58,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17166 states. [2019-12-27 07:39:58,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17166 to 16399. [2019-12-27 07:39:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16399 states. [2019-12-27 07:39:58,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16399 states to 16399 states and 55269 transitions. [2019-12-27 07:39:58,883 INFO L78 Accepts]: Start accepts. Automaton has 16399 states and 55269 transitions. Word has length 22 [2019-12-27 07:39:58,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:58,884 INFO L462 AbstractCegarLoop]: Abstraction has 16399 states and 55269 transitions. [2019-12-27 07:39:58,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:39:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 16399 states and 55269 transitions. [2019-12-27 07:39:58,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 07:39:58,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:58,890 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 07:39:58,890 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:58,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:58,891 INFO L82 PathProgramCache]: Analyzing trace with hash 436815580, now seen corresponding path program 1 times [2019-12-27 07:39:58,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:58,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300541522] [2019-12-27 07:39:58,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:58,965 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 07:39:58,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300541522] [2019-12-27 07:39:58,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:58,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:39:58,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364805117] [2019-12-27 07:39:58,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:39:58,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:58,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:39:58,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:39:58,967 INFO L87 Difference]: Start difference. First operand 16399 states and 55269 transitions. Second operand 6 states. [2019-12-27 07:39:59,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:59,289 INFO L93 Difference]: Finished difference Result 17183 states and 56862 transitions. [2019-12-27 07:39:59,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:39:59,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 07:39:59,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:59,315 INFO L225 Difference]: With dead ends: 17183 [2019-12-27 07:39:59,315 INFO L226 Difference]: Without dead ends: 16450 [2019-12-27 07:39:59,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:39:59,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16450 states. [2019-12-27 07:39:59,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16450 to 16248. [2019-12-27 07:39:59,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16248 states. [2019-12-27 07:39:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16248 states to 16248 states and 54801 transitions. [2019-12-27 07:39:59,602 INFO L78 Accepts]: Start accepts. Automaton has 16248 states and 54801 transitions. Word has length 28 [2019-12-27 07:39:59,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:59,603 INFO L462 AbstractCegarLoop]: Abstraction has 16248 states and 54801 transitions. [2019-12-27 07:39:59,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:39:59,603 INFO L276 IsEmpty]: Start isEmpty. Operand 16248 states and 54801 transitions. [2019-12-27 07:39:59,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 07:39:59,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:59,612 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:59,612 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:59,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:59,613 INFO L82 PathProgramCache]: Analyzing trace with hash -644546207, now seen corresponding path program 1 times [2019-12-27 07:39:59,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:59,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545000369] [2019-12-27 07:39:59,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:40:00,288 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 07:40:00,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545000369] [2019-12-27 07:40:00,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:40:00,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:40:00,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440084763] [2019-12-27 07:40:00,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:40:00,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:40:00,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:40:00,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:40:00,290 INFO L87 Difference]: Start difference. First operand 16248 states and 54801 transitions. Second operand 5 states. [2019-12-27 07:40:00,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:40:00,801 INFO L93 Difference]: Finished difference Result 27826 states and 91774 transitions. [2019-12-27 07:40:00,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:40:00,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 07:40:00,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:40:00,848 INFO L225 Difference]: With dead ends: 27826 [2019-12-27 07:40:00,848 INFO L226 Difference]: Without dead ends: 27826 [2019-12-27 07:40:00,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:40:00,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27826 states. [2019-12-27 07:40:01,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27826 to 23161. [2019-12-27 07:40:01,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23161 states. [2019-12-27 07:40:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23161 states to 23161 states and 76816 transitions. [2019-12-27 07:40:01,292 INFO L78 Accepts]: Start accepts. Automaton has 23161 states and 76816 transitions. Word has length 30 [2019-12-27 07:40:01,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:40:01,293 INFO L462 AbstractCegarLoop]: Abstraction has 23161 states and 76816 transitions. [2019-12-27 07:40:01,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:40:01,293 INFO L276 IsEmpty]: Start isEmpty. Operand 23161 states and 76816 transitions. [2019-12-27 07:40:01,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 07:40:01,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:40:01,307 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:40:01,307 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:40:01,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:40:01,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1317217445, now seen corresponding path program 1 times [2019-12-27 07:40:01,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:40:01,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489365723] [2019-12-27 07:40:01,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:40:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:40:01,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 07:40:01,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489365723] [2019-12-27 07:40:01,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:40:01,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:40:01,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885134568] [2019-12-27 07:40:01,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:40:01,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:40:01,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:40:01,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:40:01,378 INFO L87 Difference]: Start difference. First operand 23161 states and 76816 transitions. Second operand 5 states. [2019-12-27 07:40:01,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:40:01,475 INFO L93 Difference]: Finished difference Result 10282 states and 31302 transitions. [2019-12-27 07:40:01,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:40:01,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-27 07:40:01,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:40:01,493 INFO L225 Difference]: With dead ends: 10282 [2019-12-27 07:40:01,494 INFO L226 Difference]: Without dead ends: 8611 [2019-12-27 07:40:01,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:40:01,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8611 states. [2019-12-27 07:40:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8611 to 8551. [2019-12-27 07:40:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8551 states. [2019-12-27 07:40:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8551 states to 8551 states and 25786 transitions. [2019-12-27 07:40:01,652 INFO L78 Accepts]: Start accepts. Automaton has 8551 states and 25786 transitions. Word has length 31 [2019-12-27 07:40:01,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:40:01,652 INFO L462 AbstractCegarLoop]: Abstraction has 8551 states and 25786 transitions. [2019-12-27 07:40:01,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:40:01,652 INFO L276 IsEmpty]: Start isEmpty. Operand 8551 states and 25786 transitions. [2019-12-27 07:40:01,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 07:40:01,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:40:01,664 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 07:40:01,664 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:40:01,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:40:01,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1811345120, now seen corresponding path program 1 times [2019-12-27 07:40:01,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:40:01,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066645319] [2019-12-27 07:40:01,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:40:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:40:01,836 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 07:40:01,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066645319] [2019-12-27 07:40:01,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:40:01,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:40:01,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606225214] [2019-12-27 07:40:01,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:40:01,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:40:01,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:40:01,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:40:01,839 INFO L87 Difference]: Start difference. First operand 8551 states and 25786 transitions. Second operand 6 states. [2019-12-27 07:40:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:40:02,079 INFO L93 Difference]: Finished difference Result 7616 states and 23344 transitions. [2019-12-27 07:40:02,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:40:02,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 07:40:02,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:40:02,094 INFO L225 Difference]: With dead ends: 7616 [2019-12-27 07:40:02,095 INFO L226 Difference]: Without dead ends: 7058 [2019-12-27 07:40:02,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:40:02,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7058 states. [2019-12-27 07:40:02,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7058 to 6734. [2019-12-27 07:40:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6734 states. [2019-12-27 07:40:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6734 states to 6734 states and 21260 transitions. [2019-12-27 07:40:02,266 INFO L78 Accepts]: Start accepts. Automaton has 6734 states and 21260 transitions. Word has length 40 [2019-12-27 07:40:02,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:40:02,266 INFO L462 AbstractCegarLoop]: Abstraction has 6734 states and 21260 transitions. [2019-12-27 07:40:02,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:40:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 6734 states and 21260 transitions. [2019-12-27 07:40:02,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:40:02,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:40:02,279 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] [2019-12-27 07:40:02,279 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:40:02,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:40:02,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1310502252, now seen corresponding path program 1 times [2019-12-27 07:40:02,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:40:02,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402234129] [2019-12-27 07:40:02,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:40:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:40:02,382 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 07:40:02,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402234129] [2019-12-27 07:40:02,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:40:02,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:40:02,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150210128] [2019-12-27 07:40:02,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:40:02,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:40:02,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:40:02,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:40:02,385 INFO L87 Difference]: Start difference. First operand 6734 states and 21260 transitions. Second operand 8 states. [2019-12-27 07:40:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:40:03,296 INFO L93 Difference]: Finished difference Result 25181 states and 78141 transitions. [2019-12-27 07:40:03,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 07:40:03,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 07:40:03,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:40:03,325 INFO L225 Difference]: With dead ends: 25181 [2019-12-27 07:40:03,325 INFO L226 Difference]: Without dead ends: 17658 [2019-12-27 07:40:03,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2019-12-27 07:40:03,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17658 states. [2019-12-27 07:40:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17658 to 7888. [2019-12-27 07:40:03,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7888 states. [2019-12-27 07:40:03,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7888 states to 7888 states and 25072 transitions. [2019-12-27 07:40:03,508 INFO L78 Accepts]: Start accepts. Automaton has 7888 states and 25072 transitions. Word has length 54 [2019-12-27 07:40:03,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:40:03,509 INFO L462 AbstractCegarLoop]: Abstraction has 7888 states and 25072 transitions. [2019-12-27 07:40:03,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:40:03,509 INFO L276 IsEmpty]: Start isEmpty. Operand 7888 states and 25072 transitions. [2019-12-27 07:40:03,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:40:03,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:40:03,518 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] [2019-12-27 07:40:03,518 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:40:03,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:40:03,518 INFO L82 PathProgramCache]: Analyzing trace with hash 852703704, now seen corresponding path program 2 times [2019-12-27 07:40:03,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:40:03,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991829433] [2019-12-27 07:40:03,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:40:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:40:03,590 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 07:40:03,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991829433] [2019-12-27 07:40:03,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:40:03,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:40:03,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159351675] [2019-12-27 07:40:03,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:40:03,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:40:03,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:40:03,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:40:03,592 INFO L87 Difference]: Start difference. First operand 7888 states and 25072 transitions. Second operand 7 states. [2019-12-27 07:40:03,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:40:03,816 INFO L93 Difference]: Finished difference Result 14032 states and 43598 transitions. [2019-12-27 07:40:03,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:40:03,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:40:03,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:40:03,833 INFO L225 Difference]: With dead ends: 14032 [2019-12-27 07:40:03,833 INFO L226 Difference]: Without dead ends: 9964 [2019-12-27 07:40:03,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:40:03,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9964 states. [2019-12-27 07:40:03,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9964 to 9152. [2019-12-27 07:40:03,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9152 states. [2019-12-27 07:40:03,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9152 states to 9152 states and 28795 transitions. [2019-12-27 07:40:03,974 INFO L78 Accepts]: Start accepts. Automaton has 9152 states and 28795 transitions. Word has length 54 [2019-12-27 07:40:03,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:40:03,975 INFO L462 AbstractCegarLoop]: Abstraction has 9152 states and 28795 transitions. [2019-12-27 07:40:03,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:40:03,975 INFO L276 IsEmpty]: Start isEmpty. Operand 9152 states and 28795 transitions. [2019-12-27 07:40:03,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:40:03,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:40:03,984 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] [2019-12-27 07:40:03,984 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:40:03,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:40:03,985 INFO L82 PathProgramCache]: Analyzing trace with hash 790126390, now seen corresponding path program 1 times [2019-12-27 07:40:03,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:40:03,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607199448] [2019-12-27 07:40:03,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:40:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:40:04,032 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 07:40:04,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607199448] [2019-12-27 07:40:04,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:40:04,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:40:04,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304614732] [2019-12-27 07:40:04,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:40:04,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:40:04,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:40:04,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:40:04,035 INFO L87 Difference]: Start difference. First operand 9152 states and 28795 transitions. Second operand 3 states. [2019-12-27 07:40:04,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:40:04,112 INFO L93 Difference]: Finished difference Result 13220 states and 41470 transitions. [2019-12-27 07:40:04,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:40:04,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 07:40:04,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:40:04,132 INFO L225 Difference]: With dead ends: 13220 [2019-12-27 07:40:04,132 INFO L226 Difference]: Without dead ends: 13220 [2019-12-27 07:40:04,132 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 07:40:04,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13220 states. [2019-12-27 07:40:04,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13220 to 11612. [2019-12-27 07:40:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11612 states. [2019-12-27 07:40:04,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11612 states to 11612 states and 36880 transitions. [2019-12-27 07:40:04,324 INFO L78 Accepts]: Start accepts. Automaton has 11612 states and 36880 transitions. Word has length 54 [2019-12-27 07:40:04,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:40:04,324 INFO L462 AbstractCegarLoop]: Abstraction has 11612 states and 36880 transitions. [2019-12-27 07:40:04,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:40:04,325 INFO L276 IsEmpty]: Start isEmpty. Operand 11612 states and 36880 transitions. [2019-12-27 07:40:04,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:40:04,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:40:04,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] [2019-12-27 07:40:04,339 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:40:04,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:40:04,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1420258542, now seen corresponding path program 3 times [2019-12-27 07:40:04,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:40:04,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130544778] [2019-12-27 07:40:04,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:40:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:40:04,434 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 07:40:04,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130544778] [2019-12-27 07:40:04,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:40:04,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:40:04,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385445339] [2019-12-27 07:40:04,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:40:04,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:40:04,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:40:04,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:40:04,436 INFO L87 Difference]: Start difference. First operand 11612 states and 36880 transitions. Second operand 7 states. [2019-12-27 07:40:04,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:40:04,680 INFO L93 Difference]: Finished difference Result 19797 states and 61868 transitions. [2019-12-27 07:40:04,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:40:04,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:40:04,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:40:04,704 INFO L225 Difference]: With dead ends: 19797 [2019-12-27 07:40:04,704 INFO L226 Difference]: Without dead ends: 14812 [2019-12-27 07:40:04,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:40:04,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14812 states. [2019-12-27 07:40:04,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14812 to 11757. [2019-12-27 07:40:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11757 states. [2019-12-27 07:40:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11757 states to 11757 states and 37334 transitions. [2019-12-27 07:40:04,910 INFO L78 Accepts]: Start accepts. Automaton has 11757 states and 37334 transitions. Word has length 54 [2019-12-27 07:40:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:40:04,910 INFO L462 AbstractCegarLoop]: Abstraction has 11757 states and 37334 transitions. [2019-12-27 07:40:04,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:40:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 11757 states and 37334 transitions. [2019-12-27 07:40:04,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:40:04,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:40:04,928 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] [2019-12-27 07:40:04,928 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:40:04,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:40:04,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1006929596, now seen corresponding path program 4 times [2019-12-27 07:40:04,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:40:04,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893848719] [2019-12-27 07:40:04,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:40:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:40:05,040 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 07:40:05,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893848719] [2019-12-27 07:40:05,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:40:05,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:40:05,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271520426] [2019-12-27 07:40:05,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:40:05,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:40:05,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:40:05,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:40:05,042 INFO L87 Difference]: Start difference. First operand 11757 states and 37334 transitions. Second operand 9 states. [2019-12-27 07:40:06,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:40:06,315 INFO L93 Difference]: Finished difference Result 37053 states and 112377 transitions. [2019-12-27 07:40:06,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 07:40:06,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 07:40:06,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:40:06,377 INFO L225 Difference]: With dead ends: 37053 [2019-12-27 07:40:06,378 INFO L226 Difference]: Without dead ends: 30009 [2019-12-27 07:40:06,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=750, Unknown=0, NotChecked=0, Total=992 [2019-12-27 07:40:06,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30009 states. [2019-12-27 07:40:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30009 to 11568. [2019-12-27 07:40:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11568 states. [2019-12-27 07:40:06,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11568 states to 11568 states and 36672 transitions. [2019-12-27 07:40:06,701 INFO L78 Accepts]: Start accepts. Automaton has 11568 states and 36672 transitions. Word has length 54 [2019-12-27 07:40:06,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:40:06,701 INFO L462 AbstractCegarLoop]: Abstraction has 11568 states and 36672 transitions. [2019-12-27 07:40:06,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:40:06,701 INFO L276 IsEmpty]: Start isEmpty. Operand 11568 states and 36672 transitions. [2019-12-27 07:40:06,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:40:06,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:40:06,720 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] [2019-12-27 07:40:06,720 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:40:06,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:40:06,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1254006828, now seen corresponding path program 5 times [2019-12-27 07:40:06,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:40:06,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500901735] [2019-12-27 07:40:06,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:40:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:40:06,838 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 07:40:06,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500901735] [2019-12-27 07:40:06,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:40:06,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:40:06,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453706783] [2019-12-27 07:40:06,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:40:06,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:40:06,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:40:06,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:40:06,841 INFO L87 Difference]: Start difference. First operand 11568 states and 36672 transitions. Second operand 9 states. [2019-12-27 07:40:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:40:07,940 INFO L93 Difference]: Finished difference Result 43364 states and 131539 transitions. [2019-12-27 07:40:07,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 07:40:07,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 07:40:07,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:40:07,996 INFO L225 Difference]: With dead ends: 43364 [2019-12-27 07:40:07,997 INFO L226 Difference]: Without dead ends: 38964 [2019-12-27 07:40:07,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=590, Unknown=0, NotChecked=0, Total=812 [2019-12-27 07:40:08,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38964 states. [2019-12-27 07:40:08,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38964 to 11596. [2019-12-27 07:40:08,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11596 states. [2019-12-27 07:40:08,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11596 states to 11596 states and 36832 transitions. [2019-12-27 07:40:08,539 INFO L78 Accepts]: Start accepts. Automaton has 11596 states and 36832 transitions. Word has length 54 [2019-12-27 07:40:08,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:40:08,539 INFO L462 AbstractCegarLoop]: Abstraction has 11596 states and 36832 transitions. [2019-12-27 07:40:08,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:40:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 11596 states and 36832 transitions. [2019-12-27 07:40:08,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:40:08,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:40:08,552 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] [2019-12-27 07:40:08,552 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:40:08,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:40:08,552 INFO L82 PathProgramCache]: Analyzing trace with hash 10868734, now seen corresponding path program 6 times [2019-12-27 07:40:08,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:40:08,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243794680] [2019-12-27 07:40:08,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:40:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:40:08,641 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 07:40:08,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243794680] [2019-12-27 07:40:08,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:40:08,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:40:08,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93931316] [2019-12-27 07:40:08,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:40:08,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:40:08,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:40:08,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:40:08,644 INFO L87 Difference]: Start difference. First operand 11596 states and 36832 transitions. Second operand 6 states. [2019-12-27 07:40:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:40:09,432 INFO L93 Difference]: Finished difference Result 21703 states and 66931 transitions. [2019-12-27 07:40:09,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 07:40:09,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 07:40:09,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:40:09,485 INFO L225 Difference]: With dead ends: 21703 [2019-12-27 07:40:09,486 INFO L226 Difference]: Without dead ends: 21593 [2019-12-27 07:40:09,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:40:09,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21593 states. [2019-12-27 07:40:09,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21593 to 14562. [2019-12-27 07:40:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14562 states. [2019-12-27 07:40:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14562 states to 14562 states and 45481 transitions. [2019-12-27 07:40:09,964 INFO L78 Accepts]: Start accepts. Automaton has 14562 states and 45481 transitions. Word has length 54 [2019-12-27 07:40:09,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:40:09,964 INFO L462 AbstractCegarLoop]: Abstraction has 14562 states and 45481 transitions. [2019-12-27 07:40:09,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:40:09,964 INFO L276 IsEmpty]: Start isEmpty. Operand 14562 states and 45481 transitions. [2019-12-27 07:40:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:40:09,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:40:09,987 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] [2019-12-27 07:40:09,987 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:40:09,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:40:09,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2135249694, now seen corresponding path program 7 times [2019-12-27 07:40:09,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:40:09,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386953018] [2019-12-27 07:40:09,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:40:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:40:10,092 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 07:40:10,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386953018] [2019-12-27 07:40:10,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:40:10,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:40:10,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266234258] [2019-12-27 07:40:10,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:40:10,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:40:10,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:40:10,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:40:10,096 INFO L87 Difference]: Start difference. First operand 14562 states and 45481 transitions. Second operand 7 states. [2019-12-27 07:40:10,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:40:10,733 INFO L93 Difference]: Finished difference Result 19854 states and 60129 transitions. [2019-12-27 07:40:10,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:40:10,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:40:10,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:40:10,762 INFO L225 Difference]: With dead ends: 19854 [2019-12-27 07:40:10,762 INFO L226 Difference]: Without dead ends: 19854 [2019-12-27 07:40:10,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:40:10,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19854 states. [2019-12-27 07:40:10,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19854 to 16092. [2019-12-27 07:40:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16092 states. [2019-12-27 07:40:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16092 states to 16092 states and 49660 transitions. [2019-12-27 07:40:11,028 INFO L78 Accepts]: Start accepts. Automaton has 16092 states and 49660 transitions. Word has length 54 [2019-12-27 07:40:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:40:11,028 INFO L462 AbstractCegarLoop]: Abstraction has 16092 states and 49660 transitions. [2019-12-27 07:40:11,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:40:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 16092 states and 49660 transitions. [2019-12-27 07:40:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:40:11,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:40:11,045 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] [2019-12-27 07:40:11,046 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:40:11,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:40:11,046 INFO L82 PathProgramCache]: Analyzing trace with hash -40975946, now seen corresponding path program 8 times [2019-12-27 07:40:11,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:40:11,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476905958] [2019-12-27 07:40:11,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:40:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:40:11,156 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 07:40:11,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476905958] [2019-12-27 07:40:11,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:40:11,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:40:11,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111790666] [2019-12-27 07:40:11,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:40:11,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:40:11,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:40:11,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:40:11,161 INFO L87 Difference]: Start difference. First operand 16092 states and 49660 transitions. Second operand 9 states. [2019-12-27 07:40:12,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:40:12,559 INFO L93 Difference]: Finished difference Result 26268 states and 79552 transitions. [2019-12-27 07:40:12,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 07:40:12,560 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 07:40:12,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:40:12,624 INFO L225 Difference]: With dead ends: 26268 [2019-12-27 07:40:12,624 INFO L226 Difference]: Without dead ends: 26268 [2019-12-27 07:40:12,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:40:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26268 states. [2019-12-27 07:40:13,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26268 to 16160. [2019-12-27 07:40:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16160 states. [2019-12-27 07:40:13,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16160 states to 16160 states and 49871 transitions. [2019-12-27 07:40:13,055 INFO L78 Accepts]: Start accepts. Automaton has 16160 states and 49871 transitions. Word has length 54 [2019-12-27 07:40:13,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:40:13,056 INFO L462 AbstractCegarLoop]: Abstraction has 16160 states and 49871 transitions. [2019-12-27 07:40:13,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:40:13,056 INFO L276 IsEmpty]: Start isEmpty. Operand 16160 states and 49871 transitions. [2019-12-27 07:40:13,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:40:13,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:40:13,074 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] [2019-12-27 07:40:13,074 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:40:13,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:40:13,074 INFO L82 PathProgramCache]: Analyzing trace with hash -615002602, now seen corresponding path program 9 times [2019-12-27 07:40:13,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:40:13,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973912698] [2019-12-27 07:40:13,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:40:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:40:13,126 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 07:40:13,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973912698] [2019-12-27 07:40:13,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:40:13,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:40:13,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999247834] [2019-12-27 07:40:13,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:40:13,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:40:13,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:40:13,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:40:13,128 INFO L87 Difference]: Start difference. First operand 16160 states and 49871 transitions. Second operand 3 states. [2019-12-27 07:40:13,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:40:13,177 INFO L93 Difference]: Finished difference Result 10194 states and 31328 transitions. [2019-12-27 07:40:13,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:40:13,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 07:40:13,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:40:13,195 INFO L225 Difference]: With dead ends: 10194 [2019-12-27 07:40:13,195 INFO L226 Difference]: Without dead ends: 10194 [2019-12-27 07:40:13,196 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 07:40:13,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10194 states. [2019-12-27 07:40:13,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10194 to 9872. [2019-12-27 07:40:13,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9872 states. [2019-12-27 07:40:13,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9872 states to 9872 states and 30344 transitions. [2019-12-27 07:40:13,366 INFO L78 Accepts]: Start accepts. Automaton has 9872 states and 30344 transitions. Word has length 54 [2019-12-27 07:40:13,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:40:13,366 INFO L462 AbstractCegarLoop]: Abstraction has 9872 states and 30344 transitions. [2019-12-27 07:40:13,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:40:13,366 INFO L276 IsEmpty]: Start isEmpty. Operand 9872 states and 30344 transitions. [2019-12-27 07:40:13,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:40:13,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:40:13,376 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] [2019-12-27 07:40:13,376 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:40:13,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:40:13,376 INFO L82 PathProgramCache]: Analyzing trace with hash 229584518, now seen corresponding path program 1 times [2019-12-27 07:40:13,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:40:13,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148557542] [2019-12-27 07:40:13,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:40:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:40:13,535 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 07:40:13,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148557542] [2019-12-27 07:40:13,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:40:13,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:40:13,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983102333] [2019-12-27 07:40:13,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:40:13,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:40:13,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:40:13,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:40:13,538 INFO L87 Difference]: Start difference. First operand 9872 states and 30344 transitions. Second operand 11 states. [2019-12-27 07:40:14,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:40:14,203 INFO L93 Difference]: Finished difference Result 15998 states and 48346 transitions. [2019-12-27 07:40:14,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 07:40:14,204 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-27 07:40:14,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:40:14,218 INFO L225 Difference]: With dead ends: 15998 [2019-12-27 07:40:14,218 INFO L226 Difference]: Without dead ends: 10894 [2019-12-27 07:40:14,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-12-27 07:40:14,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10894 states. [2019-12-27 07:40:14,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10894 to 9890. [2019-12-27 07:40:14,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9890 states. [2019-12-27 07:40:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9890 states to 9890 states and 29907 transitions. [2019-12-27 07:40:14,363 INFO L78 Accepts]: Start accepts. Automaton has 9890 states and 29907 transitions. Word has length 55 [2019-12-27 07:40:14,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:40:14,363 INFO L462 AbstractCegarLoop]: Abstraction has 9890 states and 29907 transitions. [2019-12-27 07:40:14,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:40:14,363 INFO L276 IsEmpty]: Start isEmpty. Operand 9890 states and 29907 transitions. [2019-12-27 07:40:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:40:14,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:40:14,373 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] [2019-12-27 07:40:14,373 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:40:14,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:40:14,373 INFO L82 PathProgramCache]: Analyzing trace with hash 156067680, now seen corresponding path program 2 times [2019-12-27 07:40:14,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:40:14,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672554814] [2019-12-27 07:40:14,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:40:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:40:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:40:14,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672554814] [2019-12-27 07:40:14,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:40:14,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:40:14,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359942659] [2019-12-27 07:40:14,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:40:14,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:40:14,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:40:14,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:40:14,554 INFO L87 Difference]: Start difference. First operand 9890 states and 29907 transitions. Second operand 12 states. [2019-12-27 07:40:15,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:40:15,197 INFO L93 Difference]: Finished difference Result 11421 states and 33741 transitions. [2019-12-27 07:40:15,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 07:40:15,198 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-27 07:40:15,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:40:15,213 INFO L225 Difference]: With dead ends: 11421 [2019-12-27 07:40:15,213 INFO L226 Difference]: Without dead ends: 10704 [2019-12-27 07:40:15,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 07:40:15,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10704 states. [2019-12-27 07:40:15,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10704 to 9572. [2019-12-27 07:40:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9572 states. [2019-12-27 07:40:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9572 states to 9572 states and 29043 transitions. [2019-12-27 07:40:15,424 INFO L78 Accepts]: Start accepts. Automaton has 9572 states and 29043 transitions. Word has length 55 [2019-12-27 07:40:15,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:40:15,425 INFO L462 AbstractCegarLoop]: Abstraction has 9572 states and 29043 transitions. [2019-12-27 07:40:15,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:40:15,425 INFO L276 IsEmpty]: Start isEmpty. Operand 9572 states and 29043 transitions. [2019-12-27 07:40:15,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:40:15,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:40:15,434 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] [2019-12-27 07:40:15,434 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:40:15,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:40:15,435 INFO L82 PathProgramCache]: Analyzing trace with hash 594712828, now seen corresponding path program 3 times [2019-12-27 07:40:15,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:40:15,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996106317] [2019-12-27 07:40:15,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:40:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:40:15,489 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 07:40:15,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996106317] [2019-12-27 07:40:15,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:40:15,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:40:15,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398052057] [2019-12-27 07:40:15,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:40:15,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:40:15,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:40:15,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:40:15,491 INFO L87 Difference]: Start difference. First operand 9572 states and 29043 transitions. Second operand 3 states. [2019-12-27 07:40:15,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:40:15,534 INFO L93 Difference]: Finished difference Result 9570 states and 29038 transitions. [2019-12-27 07:40:15,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:40:15,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 07:40:15,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:40:15,552 INFO L225 Difference]: With dead ends: 9570 [2019-12-27 07:40:15,553 INFO L226 Difference]: Without dead ends: 9570 [2019-12-27 07:40:15,553 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 07:40:15,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9570 states. [2019-12-27 07:40:15,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9570 to 8936. [2019-12-27 07:40:15,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8936 states. [2019-12-27 07:40:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8936 states to 8936 states and 27270 transitions. [2019-12-27 07:40:15,700 INFO L78 Accepts]: Start accepts. Automaton has 8936 states and 27270 transitions. Word has length 55 [2019-12-27 07:40:15,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:40:15,700 INFO L462 AbstractCegarLoop]: Abstraction has 8936 states and 27270 transitions. [2019-12-27 07:40:15,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:40:15,700 INFO L276 IsEmpty]: Start isEmpty. Operand 8936 states and 27270 transitions. [2019-12-27 07:40:15,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:40:15,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:40:15,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:40:15,710 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:40:15,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:40:15,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1554893024, now seen corresponding path program 1 times [2019-12-27 07:40:15,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:40:15,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501846204] [2019-12-27 07:40:15,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:40:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:40:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:40:15,816 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:40:15,816 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:40:15,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2058~0.base_25|) 0) (= v_~main$tmp_guard1~0_16 0) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~__unbuffered_cnt~0_20) (= 0 v_~x$w_buff1~0_25) (= 0 v_~x$r_buff0_thd1~0_72) (= 0 v_~__unbuffered_p0_EAX~0_12) (= 0 v_~x$r_buff0_thd0~0_21) (= v_~x$r_buff1_thd2~0_18 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2058~0.base_25| 4)) (= v_~x$mem_tmp~0_9 0) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_18|) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= 0 v_~x$read_delayed~0_7) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2058~0.base_25|) (= v_~x$flush_delayed~0_12 0) (= 0 v_~__unbuffered_p2_EAX~0_12) (= v_~__unbuffered_p0_EBX~0_12 0) (= |v_#NULL.offset_4| 0) (= 0 v_~x$w_buff0_used~0_114) (= v_~x~0_22 0) (= 0 v_~x$r_buff0_thd2~0_25) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2058~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2058~0.base_25|) |v_ULTIMATE.start_main_~#t2058~0.offset_19| 0)) |v_#memory_int_23|) (= v_~y~0_10 0) (= 0 v_~x$r_buff0_thd3~0_19) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~z~0_8) (= |v_ULTIMATE.start_main_~#t2058~0.offset_19| 0) (= 0 v_~x$w_buff0~0_31) (= v_~x$r_buff1_thd0~0_19 0) (= v_~x$r_buff1_thd3~0_16 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t2058~0.base_25| 1)) (= v_~x$w_buff1_used~0_69 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_31, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ULTIMATE.start_main_~#t2059~0.offset=|v_ULTIMATE.start_main_~#t2059~0.offset_19|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_69, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_22, ULTIMATE.start_main_~#t2058~0.base=|v_ULTIMATE.start_main_~#t2058~0.base_25|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_72, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_17|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_9, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t2058~0.offset=|v_ULTIMATE.start_main_~#t2058~0.offset_19|, ~y~0=v_~y~0_10, ULTIMATE.start_main_~#t2060~0.offset=|v_ULTIMATE.start_main_~#t2060~0.offset_14|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ULTIMATE.start_main_~#t2059~0.base=|v_ULTIMATE.start_main_~#t2059~0.base_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_114, ULTIMATE.start_main_~#t2060~0.base=|v_ULTIMATE.start_main_~#t2060~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ULTIMATE.start_main_~#t2059~0.offset, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2058~0.base, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2058~0.offset, ~y~0, ULTIMATE.start_main_~#t2060~0.offset, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2059~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t2060~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 07:40:15,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L818-1-->L820: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2059~0.base_10| 4) |v_#length_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2059~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t2059~0.base_10|)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2059~0.base_10|) 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2059~0.base_10| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2059~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2059~0.base_10|) |v_ULTIMATE.start_main_~#t2059~0.offset_9| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t2059~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t2059~0.base=|v_ULTIMATE.start_main_~#t2059~0.base_10|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2059~0.offset=|v_ULTIMATE.start_main_~#t2059~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2059~0.base, #length, ULTIMATE.start_main_~#t2059~0.offset] because there is no mapped edge [2019-12-27 07:40:15,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L820-1-->L822: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2060~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2060~0.base_11|) |v_ULTIMATE.start_main_~#t2060~0.offset_10| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t2060~0.base_11| 0)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2060~0.base_11| 4) |v_#length_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2060~0.base_11|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2060~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2060~0.offset_10|) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2060~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2060~0.base=|v_ULTIMATE.start_main_~#t2060~0.base_11|, ULTIMATE.start_main_~#t2060~0.offset=|v_ULTIMATE.start_main_~#t2060~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2060~0.base, ULTIMATE.start_main_~#t2060~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 07:40:15,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x$w_buff1_used~0_42 v_~x$w_buff0_used~0_72) (= 0 (mod v_~x$w_buff1_used~0_42 256)) (= 1 v_~x$w_buff0_used~0_71) (= 1 v_~x$w_buff0~0_16) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff0~0_17 v_~x$w_buff1~0_13) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~x$w_buff1~0=v_~x$w_buff1~0_13, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_42, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 07:40:15,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1607880268 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1607880268 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-1607880268| ~x~0_In-1607880268)) (and (not .cse0) (= ~x$w_buff1~0_In-1607880268 |P2Thread1of1ForFork1_#t~ite32_Out-1607880268|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1607880268, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1607880268, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1607880268, ~x~0=~x~0_In-1607880268} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1607880268|, ~x$w_buff1~0=~x$w_buff1~0_In-1607880268, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1607880268, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1607880268, ~x~0=~x~0_In-1607880268} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 07:40:15,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L795-4-->L796: Formula: (= v_~x~0_14 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 07:40:15,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1910191942 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1910191942 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1910191942|)) (and (= ~x$w_buff0_used~0_In-1910191942 |P2Thread1of1ForFork1_#t~ite34_Out-1910191942|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1910191942, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1910191942} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1910191942|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1910191942, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1910191942} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 07:40:15,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1980324324 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1980324324 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out1980324324| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out1980324324| ~x$w_buff0_used~0_In1980324324)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1980324324, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1980324324} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1980324324, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1980324324|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1980324324} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 07:40:15,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1540814316 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1540814316 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1540814316 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1540814316 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out1540814316|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1540814316 |P1Thread1of1ForFork0_#t~ite29_Out1540814316|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1540814316, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1540814316, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1540814316, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1540814316} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1540814316, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1540814316, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1540814316, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1540814316|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1540814316} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 07:40:15,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1235904351 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite8_In-1235904351| |P0Thread1of1ForFork2_#t~ite8_Out-1235904351|) (= |P0Thread1of1ForFork2_#t~ite9_Out-1235904351| ~x$w_buff0~0_In-1235904351)) (and (= |P0Thread1of1ForFork2_#t~ite9_Out-1235904351| |P0Thread1of1ForFork2_#t~ite8_Out-1235904351|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1235904351 256)))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In-1235904351 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-1235904351 256)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1235904351 256) 0)))) .cse0 (= ~x$w_buff0~0_In-1235904351 |P0Thread1of1ForFork2_#t~ite8_Out-1235904351|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1235904351, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1235904351, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-1235904351|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1235904351, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1235904351, ~weak$$choice2~0=~weak$$choice2~0_In-1235904351, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1235904351} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1235904351, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1235904351, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1235904351|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1235904351, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-1235904351|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1235904351, ~weak$$choice2~0=~weak$$choice2~0_In-1235904351, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1235904351} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 07:40:15,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L742-->L742-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1464902229 256) 0))) (or (and (not .cse0) (= ~x$w_buff0_used~0_In-1464902229 |P0Thread1of1ForFork2_#t~ite15_Out-1464902229|) (= |P0Thread1of1ForFork2_#t~ite14_In-1464902229| |P0Thread1of1ForFork2_#t~ite14_Out-1464902229|)) (and (= |P0Thread1of1ForFork2_#t~ite15_Out-1464902229| |P0Thread1of1ForFork2_#t~ite14_Out-1464902229|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1464902229 256) 0))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1464902229 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-1464902229 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-1464902229 256)) .cse1))) (= ~x$w_buff0_used~0_In-1464902229 |P0Thread1of1ForFork2_#t~ite14_Out-1464902229|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1464902229, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1464902229, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1464902229, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-1464902229|, ~weak$$choice2~0=~weak$$choice2~0_In-1464902229, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1464902229} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1464902229, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1464902229, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-1464902229|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1464902229, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-1464902229|, ~weak$$choice2~0=~weak$$choice2~0_In-1464902229, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1464902229} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 07:40:15,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-508239901 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In-508239901| |P0Thread1of1ForFork2_#t~ite17_Out-508239901|) (= ~x$w_buff1_used~0_In-508239901 |P0Thread1of1ForFork2_#t~ite18_Out-508239901|)) (and (= ~x$w_buff1_used~0_In-508239901 |P0Thread1of1ForFork2_#t~ite17_Out-508239901|) (= |P0Thread1of1ForFork2_#t~ite17_Out-508239901| |P0Thread1of1ForFork2_#t~ite18_Out-508239901|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-508239901 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-508239901 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-508239901 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In-508239901 256)) .cse1))) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-508239901, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-508239901|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-508239901, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-508239901, ~weak$$choice2~0=~weak$$choice2~0_In-508239901, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-508239901} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-508239901, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-508239901|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-508239901|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-508239901, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-508239901, ~weak$$choice2~0=~weak$$choice2~0_In-508239901, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-508239901} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 07:40:15,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_58 v_~x$r_buff0_thd1~0_57) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_23, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 07:40:15,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L745-->L745-8: Formula: (let ((.cse4 (= |P0Thread1of1ForFork2_#t~ite24_Out-2144418306| |P0Thread1of1ForFork2_#t~ite23_Out-2144418306|)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-2144418306 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-2144418306 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-2144418306 256))) (.cse5 (= (mod ~weak$$choice2~0_In-2144418306 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-2144418306 256) 0))) (or (and (or (and (= ~x$r_buff1_thd1~0_In-2144418306 |P0Thread1of1ForFork2_#t~ite23_Out-2144418306|) (or (and .cse0 .cse1) (and .cse1 .cse2) .cse3) .cse4 .cse5) (and (not .cse5) (= |P0Thread1of1ForFork2_#t~ite23_In-2144418306| |P0Thread1of1ForFork2_#t~ite23_Out-2144418306|) (= ~x$r_buff1_thd1~0_In-2144418306 |P0Thread1of1ForFork2_#t~ite24_Out-2144418306|))) (= |P0Thread1of1ForFork2_#t~ite22_In-2144418306| |P0Thread1of1ForFork2_#t~ite22_Out-2144418306|)) (let ((.cse6 (not .cse1))) (and .cse4 (or .cse6 (not .cse0)) (= 0 |P0Thread1of1ForFork2_#t~ite22_Out-2144418306|) (or (not .cse2) .cse6) (not .cse3) .cse5 (= |P0Thread1of1ForFork2_#t~ite23_Out-2144418306| |P0Thread1of1ForFork2_#t~ite22_Out-2144418306|))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2144418306, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2144418306, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2144418306, ~weak$$choice2~0=~weak$$choice2~0_In-2144418306, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-2144418306|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In-2144418306|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2144418306} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2144418306, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2144418306, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2144418306, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-2144418306|, ~weak$$choice2~0=~weak$$choice2~0_In-2144418306, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-2144418306|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out-2144418306|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2144418306} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-27 07:40:15,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L797-->L797-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1464470208 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1464470208 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-1464470208 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1464470208 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1464470208 |P2Thread1of1ForFork1_#t~ite35_Out-1464470208|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-1464470208|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1464470208, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1464470208, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1464470208, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1464470208} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1464470208|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1464470208, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1464470208, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1464470208, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1464470208} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 07:40:15,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1592927941 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1592927941 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out1592927941| ~x$r_buff0_thd3~0_In1592927941) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out1592927941| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1592927941, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1592927941} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1592927941|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1592927941, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1592927941} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 07:40:15,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd3~0_In936001896 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In936001896 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In936001896 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In936001896 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd3~0_In936001896 |P2Thread1of1ForFork1_#t~ite37_Out936001896|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out936001896|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In936001896, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In936001896, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In936001896, ~x$w_buff0_used~0=~x$w_buff0_used~0_In936001896} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out936001896|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In936001896, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In936001896, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In936001896, ~x$w_buff0_used~0=~x$w_buff0_used~0_In936001896} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 07:40:15,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 07:40:15,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L778-->L779: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-458380488 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-458380488 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out-458380488 ~x$r_buff0_thd2~0_In-458380488)) (and (not .cse1) (not .cse0) (= ~x$r_buff0_thd2~0_Out-458380488 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-458380488, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-458380488} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-458380488|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-458380488, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-458380488} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 07:40:15,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In417220525 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In417220525 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In417220525 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In417220525 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out417220525| ~x$r_buff1_thd2~0_In417220525) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out417220525| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In417220525, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In417220525, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In417220525, ~x$w_buff0_used~0=~x$w_buff0_used~0_In417220525} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out417220525|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In417220525, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In417220525, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In417220525, ~x$w_buff0_used~0=~x$w_buff0_used~0_In417220525} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 07:40:15,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L779-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork0_#t~ite31_8|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 07:40:15,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L747-->L755: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= v_~x$mem_tmp~0_4 v_~x~0_16) (not (= 0 (mod v_~x$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 07:40:15,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L826-->L828-2: Formula: (and (or (= (mod v_~x$r_buff0_thd0~0_15 256) 0) (= 0 (mod v_~x$w_buff0_used~0_86 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 07:40:15,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In81179171 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In81179171 256)))) (or (and (= ~x$w_buff1~0_In81179171 |ULTIMATE.start_main_#t~ite41_Out81179171|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In81179171 |ULTIMATE.start_main_#t~ite41_Out81179171|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In81179171, ~x$w_buff1_used~0=~x$w_buff1_used~0_In81179171, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In81179171, ~x~0=~x~0_In81179171} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out81179171|, ~x$w_buff1~0=~x$w_buff1~0_In81179171, ~x$w_buff1_used~0=~x$w_buff1_used~0_In81179171, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In81179171, ~x~0=~x~0_In81179171} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 07:40:15,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L828-4-->L829: Formula: (= v_~x~0_15 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 07:40:15,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In421011999 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In421011999 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out421011999| ~x$w_buff0_used~0_In421011999) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out421011999|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In421011999, ~x$w_buff0_used~0=~x$w_buff0_used~0_In421011999} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In421011999, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out421011999|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In421011999} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 07:40:15,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In-392829936 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-392829936 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-392829936 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-392829936 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-392829936|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-392829936 |ULTIMATE.start_main_#t~ite44_Out-392829936|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-392829936, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-392829936, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-392829936, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392829936} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-392829936, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-392829936, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-392829936, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-392829936|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392829936} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 07:40:15,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In9059635 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In9059635 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In9059635 |ULTIMATE.start_main_#t~ite45_Out9059635|)) (and (= |ULTIMATE.start_main_#t~ite45_Out9059635| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In9059635, ~x$w_buff0_used~0=~x$w_buff0_used~0_In9059635} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In9059635, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out9059635|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In9059635} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 07:40:15,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-722771119 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-722771119 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-722771119 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-722771119 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-722771119|)) (and (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In-722771119 |ULTIMATE.start_main_#t~ite46_Out-722771119|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-722771119, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-722771119, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-722771119, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-722771119} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-722771119, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-722771119|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-722771119, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-722771119, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-722771119} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 07:40:15,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_11 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~x$r_buff1_thd0~0_13 |v_ULTIMATE.start_main_#t~ite46_10|) (= v_~__unbuffered_p0_EBX~0_7 0) (= v_~main$tmp_guard1~0_11 0) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_~__unbuffered_p0_EAX~0_7 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:40:15,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:40:15 BasicIcfg [2019-12-27 07:40:15,939 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:40:15,941 INFO L168 Benchmark]: Toolchain (without parser) took 139786.18 ms. Allocated memory was 147.8 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 104.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 07:40:15,941 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 07:40:15,942 INFO L168 Benchmark]: CACSL2BoogieTranslator took 879.39 ms. Allocated memory was 147.8 MB in the beginning and 205.5 MB in the end (delta: 57.7 MB). Free memory was 104.0 MB in the beginning and 157.7 MB in the end (delta: -53.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 07:40:15,942 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.90 ms. Allocated memory is still 205.5 MB. Free memory was 157.7 MB in the beginning and 155.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:40:15,943 INFO L168 Benchmark]: Boogie Preprocessor took 40.57 ms. Allocated memory is still 205.5 MB. Free memory was 155.0 MB in the beginning and 152.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:40:15,943 INFO L168 Benchmark]: RCFGBuilder took 850.12 ms. Allocated memory is still 205.5 MB. Free memory was 152.4 MB in the beginning and 105.9 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-12-27 07:40:15,944 INFO L168 Benchmark]: TraceAbstraction took 137946.44 ms. Allocated memory was 205.5 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 105.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 07:40:15,947 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.16 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 879.39 ms. Allocated memory was 147.8 MB in the beginning and 205.5 MB in the end (delta: 57.7 MB). Free memory was 104.0 MB in the beginning and 157.7 MB in the end (delta: -53.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.90 ms. Allocated memory is still 205.5 MB. Free memory was 157.7 MB in the beginning and 155.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.57 ms. Allocated memory is still 205.5 MB. Free memory was 155.0 MB in the beginning and 152.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 850.12 ms. Allocated memory is still 205.5 MB. Free memory was 152.4 MB in the beginning and 105.9 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 137946.44 ms. Allocated memory was 205.5 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 105.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 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: 4.1s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 28 ChoiceCompositions, 6736 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 67273 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2058, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2059, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2060, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L732] 1 __unbuffered_p0_EAX = z [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 137.6s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 43.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4334 SDtfs, 7274 SDslu, 12222 SDs, 0 SdLazy, 6347 SolverSat, 384 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 45 SyntacticMatches, 15 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133631occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 74.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 217630 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1054 NumberOfCodeBlocks, 1054 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 971 ConstructedInterpolants, 0 QuantifiedInterpolants, 149278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...