/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:39:17,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:39:17,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:39:17,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:39:17,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:39:17,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:39:17,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:39:17,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:39:17,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:39:17,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:39:17,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:39:17,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:39:17,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:39:17,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:39:17,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:39:17,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:39:17,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:39:17,948 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:39:17,950 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:39:17,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:39:17,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:39:17,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:39:17,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:39:17,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:39:17,958 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:39:17,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:39:17,959 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:39:17,960 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:39:17,960 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:39:17,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:39:17,961 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:39:17,962 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:39:17,963 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:39:17,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:39:17,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:39:17,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:39:17,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:39:17,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:39:17,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:39:17,967 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:39:17,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:39:17,968 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:39:17,994 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:39:17,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:39:17,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:39:17,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:39:17,999 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:39:17,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:39:17,999 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:39:17,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:39:17,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:39:18,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:39:18,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:39:18,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:39:18,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:39:18,000 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:39:18,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:39:18,001 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:39:18,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:39:18,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:39:18,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:39:18,002 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:39:18,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:39:18,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:39:18,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:39:18,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:39:18,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:39:18,004 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:39:18,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:39:18,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:39:18,005 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:39:18,005 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:39:18,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:39:18,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:39:18,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:39:18,312 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:39:18,312 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:39:18,313 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_rmo.opt.i [2019-12-26 21:39:18,378 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f79e16eb/1ff70058a2a3470996b0920af907ee1f/FLAG4c65e601b [2019-12-26 21:39:18,930 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:39:18,930 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_rmo.opt.i [2019-12-26 21:39:18,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f79e16eb/1ff70058a2a3470996b0920af907ee1f/FLAG4c65e601b [2019-12-26 21:39:19,250 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f79e16eb/1ff70058a2a3470996b0920af907ee1f [2019-12-26 21:39:19,259 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:39:19,261 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:39:19,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:39:19,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:39:19,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:39:19,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:39:19" (1/1) ... [2019-12-26 21:39:19,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2717e766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:39:19, skipping insertion in model container [2019-12-26 21:39:19,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:39:19" (1/1) ... [2019-12-26 21:39:19,280 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:39:19,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:39:19,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:39:19,892 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:39:19,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:39:20,062 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:39:20,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:39:20 WrapperNode [2019-12-26 21:39:20,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:39:20,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:39:20,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:39:20,064 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:39:20,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:39:20" (1/1) ... [2019-12-26 21:39:20,098 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:39:20" (1/1) ... [2019-12-26 21:39:20,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:39:20,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:39:20,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:39:20,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:39:20,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:39:20" (1/1) ... [2019-12-26 21:39:20,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:39:20" (1/1) ... [2019-12-26 21:39:20,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:39:20" (1/1) ... [2019-12-26 21:39:20,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:39:20" (1/1) ... [2019-12-26 21:39:20,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:39:20" (1/1) ... [2019-12-26 21:39:20,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:39:20" (1/1) ... [2019-12-26 21:39:20,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:39:20" (1/1) ... [2019-12-26 21:39:20,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:39:20,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:39:20,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:39:20,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:39:20,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:39:20" (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-26 21:39:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:39:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:39:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:39:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:39:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:39:20,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:39:20,264 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:39:20,264 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:39:20,265 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:39:20,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:39:20,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:39:20,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:39:20,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:39:20,268 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:39:21,117 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:39:21,118 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:39:21,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:39:21 BoogieIcfgContainer [2019-12-26 21:39:21,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:39:21,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:39:21,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:39:21,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:39:21,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:39:19" (1/3) ... [2019-12-26 21:39:21,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f643728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:39:21, skipping insertion in model container [2019-12-26 21:39:21,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:39:20" (2/3) ... [2019-12-26 21:39:21,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f643728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:39:21, skipping insertion in model container [2019-12-26 21:39:21,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:39:21" (3/3) ... [2019-12-26 21:39:21,129 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_rmo.opt.i [2019-12-26 21:39:21,140 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:39:21,140 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:39:21,148 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:39:21,149 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:39:21,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,191 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,192 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,244 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,244 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,244 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,245 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,245 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,263 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,264 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,272 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,273 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,273 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,278 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,278 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,283 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,284 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:39:21,305 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:39:21,327 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:39:21,328 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:39:21,328 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:39:21,328 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:39:21,328 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:39:21,328 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:39:21,328 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:39:21,328 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:39:21,351 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-26 21:39:21,353 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-26 21:39:21,453 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-26 21:39:21,453 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:39:21,473 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 21:39:21,499 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-26 21:39:21,549 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-26 21:39:21,550 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:39:21,557 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 21:39:21,576 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-26 21:39:21,578 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:39:26,450 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-12-26 21:39:27,064 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-26 21:39:27,185 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-26 21:39:27,217 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75392 [2019-12-26 21:39:27,217 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-26 21:39:27,221 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 91 transitions [2019-12-26 21:39:38,448 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86190 states. [2019-12-26 21:39:38,450 INFO L276 IsEmpty]: Start isEmpty. Operand 86190 states. [2019-12-26 21:39:38,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 21:39:38,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:38,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 21:39:38,459 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-26 21:39:38,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:38,465 INFO L82 PathProgramCache]: Analyzing trace with hash 802149997, now seen corresponding path program 1 times [2019-12-26 21:39:38,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:38,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895009498] [2019-12-26 21:39:38,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:38,712 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-26 21:39:38,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895009498] [2019-12-26 21:39:38,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:38,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:39:38,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207657969] [2019-12-26 21:39:38,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:39:38,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:38,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:39:38,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:39:38,737 INFO L87 Difference]: Start difference. First operand 86190 states. Second operand 3 states. [2019-12-26 21:39:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:39,607 INFO L93 Difference]: Finished difference Result 85100 states and 365324 transitions. [2019-12-26 21:39:39,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:39:39,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 21:39:39,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:42,647 INFO L225 Difference]: With dead ends: 85100 [2019-12-26 21:39:42,647 INFO L226 Difference]: Without dead ends: 79822 [2019-12-26 21:39:42,649 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-26 21:39:45,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79822 states. [2019-12-26 21:39:47,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79822 to 79822. [2019-12-26 21:39:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79822 states. [2019-12-26 21:39:48,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79822 states to 79822 states and 342168 transitions. [2019-12-26 21:39:48,381 INFO L78 Accepts]: Start accepts. Automaton has 79822 states and 342168 transitions. Word has length 5 [2019-12-26 21:39:48,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:48,382 INFO L462 AbstractCegarLoop]: Abstraction has 79822 states and 342168 transitions. [2019-12-26 21:39:48,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:39:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand 79822 states and 342168 transitions. [2019-12-26 21:39:48,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:39:48,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:48,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:39:48,391 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-26 21:39:48,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:48,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1460490103, now seen corresponding path program 1 times [2019-12-26 21:39:48,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:48,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381557297] [2019-12-26 21:39:48,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:48,487 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-26 21:39:48,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381557297] [2019-12-26 21:39:48,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:48,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:39:48,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093872063] [2019-12-26 21:39:48,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:39:48,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:48,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:39:48,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:39:48,491 INFO L87 Difference]: Start difference. First operand 79822 states and 342168 transitions. Second operand 3 states. [2019-12-26 21:39:48,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:48,647 INFO L93 Difference]: Finished difference Result 21012 states and 72403 transitions. [2019-12-26 21:39:48,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:39:48,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 21:39:48,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:48,712 INFO L225 Difference]: With dead ends: 21012 [2019-12-26 21:39:48,712 INFO L226 Difference]: Without dead ends: 21012 [2019-12-26 21:39:48,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:39:48,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21012 states. [2019-12-26 21:39:49,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21012 to 21012. [2019-12-26 21:39:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21012 states. [2019-12-26 21:39:49,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21012 states to 21012 states and 72403 transitions. [2019-12-26 21:39:49,169 INFO L78 Accepts]: Start accepts. Automaton has 21012 states and 72403 transitions. Word has length 13 [2019-12-26 21:39:49,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:49,169 INFO L462 AbstractCegarLoop]: Abstraction has 21012 states and 72403 transitions. [2019-12-26 21:39:49,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:39:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 21012 states and 72403 transitions. [2019-12-26 21:39:49,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:39:49,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:49,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:39:49,171 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-26 21:39:49,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:49,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1843446667, now seen corresponding path program 1 times [2019-12-26 21:39:49,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:49,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813219145] [2019-12-26 21:39:49,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:49,248 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-26 21:39:49,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813219145] [2019-12-26 21:39:49,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:49,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:39:49,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102514935] [2019-12-26 21:39:49,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:39:49,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:49,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:39:49,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:39:49,252 INFO L87 Difference]: Start difference. First operand 21012 states and 72403 transitions. Second operand 4 states. [2019-12-26 21:39:51,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:51,267 INFO L93 Difference]: Finished difference Result 31168 states and 104167 transitions. [2019-12-26 21:39:51,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:39:51,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 21:39:51,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:51,359 INFO L225 Difference]: With dead ends: 31168 [2019-12-26 21:39:51,359 INFO L226 Difference]: Without dead ends: 31154 [2019-12-26 21:39:51,359 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-26 21:39:51,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31154 states. [2019-12-26 21:39:52,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31154 to 27751. [2019-12-26 21:39:52,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27751 states. [2019-12-26 21:39:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27751 states to 27751 states and 93636 transitions. [2019-12-26 21:39:52,162 INFO L78 Accepts]: Start accepts. Automaton has 27751 states and 93636 transitions. Word has length 13 [2019-12-26 21:39:52,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:52,162 INFO L462 AbstractCegarLoop]: Abstraction has 27751 states and 93636 transitions. [2019-12-26 21:39:52,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:39:52,163 INFO L276 IsEmpty]: Start isEmpty. Operand 27751 states and 93636 transitions. [2019-12-26 21:39:52,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 21:39:52,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:52,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:39:52,165 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-26 21:39:52,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:52,166 INFO L82 PathProgramCache]: Analyzing trace with hash 890356816, now seen corresponding path program 1 times [2019-12-26 21:39:52,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:52,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782749060] [2019-12-26 21:39:52,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:52,287 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-26 21:39:52,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782749060] [2019-12-26 21:39:52,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:52,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:39:52,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728323734] [2019-12-26 21:39:52,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:39:52,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:52,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:39:52,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:39:52,289 INFO L87 Difference]: Start difference. First operand 27751 states and 93636 transitions. Second operand 5 states. [2019-12-26 21:39:52,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:52,781 INFO L93 Difference]: Finished difference Result 40618 states and 134851 transitions. [2019-12-26 21:39:52,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:39:52,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-26 21:39:52,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:52,905 INFO L225 Difference]: With dead ends: 40618 [2019-12-26 21:39:52,905 INFO L226 Difference]: Without dead ends: 40602 [2019-12-26 21:39:52,905 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-26 21:39:53,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40602 states. [2019-12-26 21:39:54,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40602 to 32075. [2019-12-26 21:39:54,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32075 states. [2019-12-26 21:39:54,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32075 states to 32075 states and 107493 transitions. [2019-12-26 21:39:54,078 INFO L78 Accepts]: Start accepts. Automaton has 32075 states and 107493 transitions. Word has length 14 [2019-12-26 21:39:54,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:54,079 INFO L462 AbstractCegarLoop]: Abstraction has 32075 states and 107493 transitions. [2019-12-26 21:39:54,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:39:54,079 INFO L276 IsEmpty]: Start isEmpty. Operand 32075 states and 107493 transitions. [2019-12-26 21:39:54,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:39:54,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:54,091 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-26 21:39:54,091 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-26 21:39:54,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:54,092 INFO L82 PathProgramCache]: Analyzing trace with hash 454702152, now seen corresponding path program 1 times [2019-12-26 21:39:54,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:54,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681656266] [2019-12-26 21:39:54,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:54,218 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-26 21:39:54,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681656266] [2019-12-26 21:39:54,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:54,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:39:54,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356949573] [2019-12-26 21:39:54,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:39:54,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:54,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:39:54,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:39:54,221 INFO L87 Difference]: Start difference. First operand 32075 states and 107493 transitions. Second operand 6 states. [2019-12-26 21:39:55,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:55,138 INFO L93 Difference]: Finished difference Result 48617 states and 159685 transitions. [2019-12-26 21:39:55,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:39:55,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 21:39:55,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:55,225 INFO L225 Difference]: With dead ends: 48617 [2019-12-26 21:39:55,225 INFO L226 Difference]: Without dead ends: 48589 [2019-12-26 21:39:55,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:39:55,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48589 states. [2019-12-26 21:39:55,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48589 to 33099. [2019-12-26 21:39:55,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33099 states. [2019-12-26 21:39:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33099 states to 33099 states and 109984 transitions. [2019-12-26 21:39:55,917 INFO L78 Accepts]: Start accepts. Automaton has 33099 states and 109984 transitions. Word has length 22 [2019-12-26 21:39:55,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:55,918 INFO L462 AbstractCegarLoop]: Abstraction has 33099 states and 109984 transitions. [2019-12-26 21:39:55,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:39:55,918 INFO L276 IsEmpty]: Start isEmpty. Operand 33099 states and 109984 transitions. [2019-12-26 21:39:55,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:39:55,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:55,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:39:55,937 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-26 21:39:55,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:55,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1218687100, now seen corresponding path program 1 times [2019-12-26 21:39:55,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:55,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463395390] [2019-12-26 21:39:55,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:55,983 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-26 21:39:55,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463395390] [2019-12-26 21:39:55,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:55,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:39:55,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318589533] [2019-12-26 21:39:55,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:39:55,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:55,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:39:55,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:39:55,985 INFO L87 Difference]: Start difference. First operand 33099 states and 109984 transitions. Second operand 4 states. [2019-12-26 21:39:56,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:56,219 INFO L93 Difference]: Finished difference Result 13493 states and 41620 transitions. [2019-12-26 21:39:56,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:39:56,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 21:39:56,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:56,247 INFO L225 Difference]: With dead ends: 13493 [2019-12-26 21:39:56,247 INFO L226 Difference]: Without dead ends: 13493 [2019-12-26 21:39:56,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:39:56,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2019-12-26 21:39:56,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13273. [2019-12-26 21:39:56,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13273 states. [2019-12-26 21:39:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13273 states to 13273 states and 40970 transitions. [2019-12-26 21:39:56,469 INFO L78 Accepts]: Start accepts. Automaton has 13273 states and 40970 transitions. Word has length 25 [2019-12-26 21:39:56,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:56,469 INFO L462 AbstractCegarLoop]: Abstraction has 13273 states and 40970 transitions. [2019-12-26 21:39:56,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:39:56,469 INFO L276 IsEmpty]: Start isEmpty. Operand 13273 states and 40970 transitions. [2019-12-26 21:39:56,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:39:56,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:56,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:39:56,490 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-26 21:39:56,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:56,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1155983199, now seen corresponding path program 1 times [2019-12-26 21:39:56,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:56,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225499303] [2019-12-26 21:39:56,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:56,567 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-26 21:39:56,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225499303] [2019-12-26 21:39:56,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:56,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:39:56,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817060262] [2019-12-26 21:39:56,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:39:56,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:56,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:39:56,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:39:56,571 INFO L87 Difference]: Start difference. First operand 13273 states and 40970 transitions. Second operand 5 states. [2019-12-26 21:39:56,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:56,644 INFO L93 Difference]: Finished difference Result 12040 states and 37785 transitions. [2019-12-26 21:39:56,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:39:56,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-26 21:39:56,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:56,666 INFO L225 Difference]: With dead ends: 12040 [2019-12-26 21:39:56,666 INFO L226 Difference]: Without dead ends: 11998 [2019-12-26 21:39:56,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:39:56,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11998 states. [2019-12-26 21:39:56,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11998 to 11419. [2019-12-26 21:39:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11419 states. [2019-12-26 21:39:56,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11419 states to 11419 states and 36001 transitions. [2019-12-26 21:39:56,914 INFO L78 Accepts]: Start accepts. Automaton has 11419 states and 36001 transitions. Word has length 39 [2019-12-26 21:39:56,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:56,914 INFO L462 AbstractCegarLoop]: Abstraction has 11419 states and 36001 transitions. [2019-12-26 21:39:56,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:39:56,914 INFO L276 IsEmpty]: Start isEmpty. Operand 11419 states and 36001 transitions. [2019-12-26 21:39:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 21:39:56,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:56,935 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] [2019-12-26 21:39:56,935 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-26 21:39:56,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:56,936 INFO L82 PathProgramCache]: Analyzing trace with hash 588132615, now seen corresponding path program 1 times [2019-12-26 21:39:56,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:56,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723808410] [2019-12-26 21:39:56,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:57,019 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-26 21:39:57,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723808410] [2019-12-26 21:39:57,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:57,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:39:57,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086487284] [2019-12-26 21:39:57,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:39:57,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:57,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:39:57,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:39:57,022 INFO L87 Difference]: Start difference. First operand 11419 states and 36001 transitions. Second operand 4 states. [2019-12-26 21:39:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:57,122 INFO L93 Difference]: Finished difference Result 20766 states and 65459 transitions. [2019-12-26 21:39:57,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:39:57,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-26 21:39:57,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:57,143 INFO L225 Difference]: With dead ends: 20766 [2019-12-26 21:39:57,143 INFO L226 Difference]: Without dead ends: 9680 [2019-12-26 21:39:57,144 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-26 21:39:57,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9680 states. [2019-12-26 21:39:57,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9680 to 9680. [2019-12-26 21:39:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9680 states. [2019-12-26 21:39:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9680 states to 9680 states and 30383 transitions. [2019-12-26 21:39:57,337 INFO L78 Accepts]: Start accepts. Automaton has 9680 states and 30383 transitions. Word has length 53 [2019-12-26 21:39:57,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:57,338 INFO L462 AbstractCegarLoop]: Abstraction has 9680 states and 30383 transitions. [2019-12-26 21:39:57,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:39:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 9680 states and 30383 transitions. [2019-12-26 21:39:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 21:39:57,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:57,354 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] [2019-12-26 21:39:57,354 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-26 21:39:57,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:57,354 INFO L82 PathProgramCache]: Analyzing trace with hash 104371591, now seen corresponding path program 2 times [2019-12-26 21:39:57,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:57,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325269406] [2019-12-26 21:39:57,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:57,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:39:57,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325269406] [2019-12-26 21:39:57,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:57,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:39:57,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899157909] [2019-12-26 21:39:57,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:39:57,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:57,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:39:57,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:39:57,459 INFO L87 Difference]: Start difference. First operand 9680 states and 30383 transitions. Second operand 7 states. [2019-12-26 21:39:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:57,860 INFO L93 Difference]: Finished difference Result 24579 states and 76915 transitions. [2019-12-26 21:39:57,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:39:57,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-26 21:39:57,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:57,901 INFO L225 Difference]: With dead ends: 24579 [2019-12-26 21:39:57,901 INFO L226 Difference]: Without dead ends: 19443 [2019-12-26 21:39:57,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:39:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19443 states. [2019-12-26 21:39:58,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19443 to 11624. [2019-12-26 21:39:58,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11624 states. [2019-12-26 21:39:58,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11624 states to 11624 states and 36702 transitions. [2019-12-26 21:39:58,141 INFO L78 Accepts]: Start accepts. Automaton has 11624 states and 36702 transitions. Word has length 53 [2019-12-26 21:39:58,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:58,141 INFO L462 AbstractCegarLoop]: Abstraction has 11624 states and 36702 transitions. [2019-12-26 21:39:58,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:39:58,141 INFO L276 IsEmpty]: Start isEmpty. Operand 11624 states and 36702 transitions. [2019-12-26 21:39:58,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 21:39:58,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:58,160 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] [2019-12-26 21:39:58,160 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-26 21:39:58,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:58,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1667433135, now seen corresponding path program 3 times [2019-12-26 21:39:58,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:58,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088705428] [2019-12-26 21:39:58,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:58,257 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-26 21:39:58,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088705428] [2019-12-26 21:39:58,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:58,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:39:58,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528969918] [2019-12-26 21:39:58,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:39:58,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:58,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:39:58,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:39:58,259 INFO L87 Difference]: Start difference. First operand 11624 states and 36702 transitions. Second operand 7 states. [2019-12-26 21:39:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:58,741 INFO L93 Difference]: Finished difference Result 29614 states and 91402 transitions. [2019-12-26 21:39:58,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:39:58,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-26 21:39:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:58,782 INFO L225 Difference]: With dead ends: 29614 [2019-12-26 21:39:58,782 INFO L226 Difference]: Without dead ends: 21210 [2019-12-26 21:39:58,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:39:58,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21210 states. [2019-12-26 21:39:59,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21210 to 13657. [2019-12-26 21:39:59,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13657 states. [2019-12-26 21:39:59,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13657 states to 13657 states and 42965 transitions. [2019-12-26 21:39:59,060 INFO L78 Accepts]: Start accepts. Automaton has 13657 states and 42965 transitions. Word has length 53 [2019-12-26 21:39:59,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:59,060 INFO L462 AbstractCegarLoop]: Abstraction has 13657 states and 42965 transitions. [2019-12-26 21:39:59,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:39:59,060 INFO L276 IsEmpty]: Start isEmpty. Operand 13657 states and 42965 transitions. [2019-12-26 21:39:59,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 21:39:59,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:59,078 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] [2019-12-26 21:39:59,078 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-26 21:39:59,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:59,079 INFO L82 PathProgramCache]: Analyzing trace with hash 750976839, now seen corresponding path program 4 times [2019-12-26 21:39:59,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:59,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410337256] [2019-12-26 21:39:59,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:59,158 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-26 21:39:59,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410337256] [2019-12-26 21:39:59,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:59,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:39:59,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325538122] [2019-12-26 21:39:59,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:39:59,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:59,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:39:59,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:39:59,160 INFO L87 Difference]: Start difference. First operand 13657 states and 42965 transitions. Second operand 7 states. [2019-12-26 21:39:59,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:59,533 INFO L93 Difference]: Finished difference Result 27460 states and 85976 transitions. [2019-12-26 21:39:59,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 21:39:59,534 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-26 21:39:59,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:59,572 INFO L225 Difference]: With dead ends: 27460 [2019-12-26 21:39:59,572 INFO L226 Difference]: Without dead ends: 25402 [2019-12-26 21:39:59,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:39:59,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25402 states. [2019-12-26 21:39:59,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25402 to 13726. [2019-12-26 21:39:59,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13726 states. [2019-12-26 21:39:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13726 states to 13726 states and 43266 transitions. [2019-12-26 21:39:59,870 INFO L78 Accepts]: Start accepts. Automaton has 13726 states and 43266 transitions. Word has length 53 [2019-12-26 21:39:59,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:59,870 INFO L462 AbstractCegarLoop]: Abstraction has 13726 states and 43266 transitions. [2019-12-26 21:39:59,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:39:59,870 INFO L276 IsEmpty]: Start isEmpty. Operand 13726 states and 43266 transitions. [2019-12-26 21:39:59,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 21:39:59,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:59,887 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] [2019-12-26 21:39:59,887 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-26 21:39:59,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:59,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1191615376, now seen corresponding path program 1 times [2019-12-26 21:39:59,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:59,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954719073] [2019-12-26 21:39:59,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:59,931 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-26 21:39:59,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954719073] [2019-12-26 21:39:59,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:59,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:39:59,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977979196] [2019-12-26 21:39:59,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:39:59,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:59,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:39:59,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:39:59,934 INFO L87 Difference]: Start difference. First operand 13726 states and 43266 transitions. Second operand 3 states. [2019-12-26 21:40:00,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:00,038 INFO L93 Difference]: Finished difference Result 18812 states and 59147 transitions. [2019-12-26 21:40:00,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:40:00,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-26 21:40:00,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:00,069 INFO L225 Difference]: With dead ends: 18812 [2019-12-26 21:40:00,069 INFO L226 Difference]: Without dead ends: 18812 [2019-12-26 21:40:00,069 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-26 21:40:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18812 states. [2019-12-26 21:40:00,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18812 to 16902. [2019-12-26 21:40:00,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16902 states. [2019-12-26 21:40:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16902 states to 16902 states and 53223 transitions. [2019-12-26 21:40:00,373 INFO L78 Accepts]: Start accepts. Automaton has 16902 states and 53223 transitions. Word has length 53 [2019-12-26 21:40:00,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:00,374 INFO L462 AbstractCegarLoop]: Abstraction has 16902 states and 53223 transitions. [2019-12-26 21:40:00,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:40:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand 16902 states and 53223 transitions. [2019-12-26 21:40:00,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 21:40:00,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:00,399 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] [2019-12-26 21:40:00,399 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-26 21:40:00,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:00,399 INFO L82 PathProgramCache]: Analyzing trace with hash 2090423977, now seen corresponding path program 5 times [2019-12-26 21:40:00,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:00,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382443861] [2019-12-26 21:40:00,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:40:00,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382443861] [2019-12-26 21:40:00,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:00,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:40:00,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99709473] [2019-12-26 21:40:00,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:40:00,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:00,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:40:00,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:40:00,462 INFO L87 Difference]: Start difference. First operand 16902 states and 53223 transitions. Second operand 3 states. [2019-12-26 21:40:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:00,578 INFO L93 Difference]: Finished difference Result 18773 states and 56435 transitions. [2019-12-26 21:40:00,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:40:00,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-26 21:40:00,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:00,608 INFO L225 Difference]: With dead ends: 18773 [2019-12-26 21:40:00,609 INFO L226 Difference]: Without dead ends: 18104 [2019-12-26 21:40:00,609 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-26 21:40:00,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18104 states. [2019-12-26 21:40:01,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18104 to 15749. [2019-12-26 21:40:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15749 states. [2019-12-26 21:40:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15749 states to 15749 states and 47846 transitions. [2019-12-26 21:40:01,030 INFO L78 Accepts]: Start accepts. Automaton has 15749 states and 47846 transitions. Word has length 53 [2019-12-26 21:40:01,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:01,030 INFO L462 AbstractCegarLoop]: Abstraction has 15749 states and 47846 transitions. [2019-12-26 21:40:01,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:40:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 15749 states and 47846 transitions. [2019-12-26 21:40:01,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 21:40:01,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:01,051 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] [2019-12-26 21:40:01,051 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-26 21:40:01,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:01,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1578630746, now seen corresponding path program 1 times [2019-12-26 21:40:01,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:01,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503608045] [2019-12-26 21:40:01,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:01,164 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-26 21:40:01,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503608045] [2019-12-26 21:40:01,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:01,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:40:01,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265479271] [2019-12-26 21:40:01,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:40:01,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:01,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:40:01,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:40:01,166 INFO L87 Difference]: Start difference. First operand 15749 states and 47846 transitions. Second operand 7 states. [2019-12-26 21:40:02,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:02,084 INFO L93 Difference]: Finished difference Result 26751 states and 78312 transitions. [2019-12-26 21:40:02,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 21:40:02,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-26 21:40:02,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:02,125 INFO L225 Difference]: With dead ends: 26751 [2019-12-26 21:40:02,125 INFO L226 Difference]: Without dead ends: 26641 [2019-12-26 21:40:02,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-26 21:40:02,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26641 states. [2019-12-26 21:40:02,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26641 to 19681. [2019-12-26 21:40:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19681 states. [2019-12-26 21:40:02,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19681 states to 19681 states and 59031 transitions. [2019-12-26 21:40:02,521 INFO L78 Accepts]: Start accepts. Automaton has 19681 states and 59031 transitions. Word has length 53 [2019-12-26 21:40:02,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:02,522 INFO L462 AbstractCegarLoop]: Abstraction has 19681 states and 59031 transitions. [2019-12-26 21:40:02,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:40:02,522 INFO L276 IsEmpty]: Start isEmpty. Operand 19681 states and 59031 transitions. [2019-12-26 21:40:02,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 21:40:02,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:02,551 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] [2019-12-26 21:40:02,551 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-26 21:40:02,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:02,551 INFO L82 PathProgramCache]: Analyzing trace with hash -74918758, now seen corresponding path program 2 times [2019-12-26 21:40:02,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:02,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879983053] [2019-12-26 21:40:02,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:02,665 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-26 21:40:02,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879983053] [2019-12-26 21:40:02,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:02,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:40:02,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270518071] [2019-12-26 21:40:02,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:40:02,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:02,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:40:02,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:40:02,668 INFO L87 Difference]: Start difference. First operand 19681 states and 59031 transitions. Second operand 8 states. [2019-12-26 21:40:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:04,000 INFO L93 Difference]: Finished difference Result 38250 states and 112084 transitions. [2019-12-26 21:40:04,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 21:40:04,000 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-26 21:40:04,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:04,052 INFO L225 Difference]: With dead ends: 38250 [2019-12-26 21:40:04,053 INFO L226 Difference]: Without dead ends: 38140 [2019-12-26 21:40:04,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-12-26 21:40:04,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38140 states. [2019-12-26 21:40:04,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38140 to 20676. [2019-12-26 21:40:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20676 states. [2019-12-26 21:40:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20676 states to 20676 states and 61780 transitions. [2019-12-26 21:40:04,490 INFO L78 Accepts]: Start accepts. Automaton has 20676 states and 61780 transitions. Word has length 53 [2019-12-26 21:40:04,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:04,490 INFO L462 AbstractCegarLoop]: Abstraction has 20676 states and 61780 transitions. [2019-12-26 21:40:04,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:40:04,491 INFO L276 IsEmpty]: Start isEmpty. Operand 20676 states and 61780 transitions. [2019-12-26 21:40:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 21:40:04,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:04,513 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] [2019-12-26 21:40:04,513 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-26 21:40:04,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:04,513 INFO L82 PathProgramCache]: Analyzing trace with hash 638104790, now seen corresponding path program 3 times [2019-12-26 21:40:04,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:04,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574662055] [2019-12-26 21:40:04,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:04,581 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-26 21:40:04,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574662055] [2019-12-26 21:40:04,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:04,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:40:04,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848920987] [2019-12-26 21:40:04,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:40:04,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:04,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:40:04,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:40:04,583 INFO L87 Difference]: Start difference. First operand 20676 states and 61780 transitions. Second operand 3 states. [2019-12-26 21:40:04,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:04,778 INFO L93 Difference]: Finished difference Result 15660 states and 46308 transitions. [2019-12-26 21:40:04,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:40:04,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-26 21:40:04,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:04,809 INFO L225 Difference]: With dead ends: 15660 [2019-12-26 21:40:04,809 INFO L226 Difference]: Without dead ends: 15660 [2019-12-26 21:40:04,810 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-26 21:40:04,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15660 states. [2019-12-26 21:40:05,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15660 to 15112. [2019-12-26 21:40:05,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15112 states. [2019-12-26 21:40:05,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15112 states to 15112 states and 44682 transitions. [2019-12-26 21:40:05,142 INFO L78 Accepts]: Start accepts. Automaton has 15112 states and 44682 transitions. Word has length 53 [2019-12-26 21:40:05,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:05,142 INFO L462 AbstractCegarLoop]: Abstraction has 15112 states and 44682 transitions. [2019-12-26 21:40:05,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:40:05,143 INFO L276 IsEmpty]: Start isEmpty. Operand 15112 states and 44682 transitions. [2019-12-26 21:40:05,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 21:40:05,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:05,166 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-26 21:40:05,167 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-26 21:40:05,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:05,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1778661443, now seen corresponding path program 1 times [2019-12-26 21:40:05,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:05,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90058203] [2019-12-26 21:40:05,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:05,283 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-26 21:40:05,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90058203] [2019-12-26 21:40:05,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:05,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:40:05,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439969646] [2019-12-26 21:40:05,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:40:05,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:05,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:40:05,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:40:05,286 INFO L87 Difference]: Start difference. First operand 15112 states and 44682 transitions. Second operand 8 states. [2019-12-26 21:40:06,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:06,380 INFO L93 Difference]: Finished difference Result 28470 states and 83597 transitions. [2019-12-26 21:40:06,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 21:40:06,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-26 21:40:06,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:06,410 INFO L225 Difference]: With dead ends: 28470 [2019-12-26 21:40:06,410 INFO L226 Difference]: Without dead ends: 22680 [2019-12-26 21:40:06,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-26 21:40:06,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22680 states. [2019-12-26 21:40:06,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22680 to 15669. [2019-12-26 21:40:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15669 states. [2019-12-26 21:40:06,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15669 states to 15669 states and 45972 transitions. [2019-12-26 21:40:06,692 INFO L78 Accepts]: Start accepts. Automaton has 15669 states and 45972 transitions. Word has length 54 [2019-12-26 21:40:06,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:06,692 INFO L462 AbstractCegarLoop]: Abstraction has 15669 states and 45972 transitions. [2019-12-26 21:40:06,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:40:06,692 INFO L276 IsEmpty]: Start isEmpty. Operand 15669 states and 45972 transitions. [2019-12-26 21:40:06,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 21:40:06,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:06,708 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-26 21:40:06,708 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-26 21:40:06,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:06,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1289880453, now seen corresponding path program 2 times [2019-12-26 21:40:06,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:06,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314576586] [2019-12-26 21:40:06,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:06,816 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-26 21:40:06,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314576586] [2019-12-26 21:40:06,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:06,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:40:06,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696527478] [2019-12-26 21:40:06,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:40:06,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:06,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:40:06,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:40:06,825 INFO L87 Difference]: Start difference. First operand 15669 states and 45972 transitions. Second operand 9 states. [2019-12-26 21:40:07,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:07,746 INFO L93 Difference]: Finished difference Result 26340 states and 76806 transitions. [2019-12-26 21:40:07,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 21:40:07,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-26 21:40:07,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:07,775 INFO L225 Difference]: With dead ends: 26340 [2019-12-26 21:40:07,775 INFO L226 Difference]: Without dead ends: 22226 [2019-12-26 21:40:07,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-26 21:40:07,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22226 states. [2019-12-26 21:40:08,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22226 to 15493. [2019-12-26 21:40:08,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15493 states. [2019-12-26 21:40:08,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15493 states to 15493 states and 45424 transitions. [2019-12-26 21:40:08,033 INFO L78 Accepts]: Start accepts. Automaton has 15493 states and 45424 transitions. Word has length 54 [2019-12-26 21:40:08,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:08,034 INFO L462 AbstractCegarLoop]: Abstraction has 15493 states and 45424 transitions. [2019-12-26 21:40:08,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:40:08,034 INFO L276 IsEmpty]: Start isEmpty. Operand 15493 states and 45424 transitions. [2019-12-26 21:40:08,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 21:40:08,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:08,049 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-26 21:40:08,049 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-26 21:40:08,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:08,049 INFO L82 PathProgramCache]: Analyzing trace with hash -588074843, now seen corresponding path program 3 times [2019-12-26 21:40:08,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:08,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691551138] [2019-12-26 21:40:08,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:08,211 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-26 21:40:08,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691551138] [2019-12-26 21:40:08,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:08,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:40:08,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018164700] [2019-12-26 21:40:08,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:40:08,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:08,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:40:08,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:40:08,213 INFO L87 Difference]: Start difference. First operand 15493 states and 45424 transitions. Second operand 10 states. [2019-12-26 21:40:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:10,744 INFO L93 Difference]: Finished difference Result 28505 states and 81464 transitions. [2019-12-26 21:40:10,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-26 21:40:10,744 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-26 21:40:10,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:10,804 INFO L225 Difference]: With dead ends: 28505 [2019-12-26 21:40:10,805 INFO L226 Difference]: Without dead ends: 28301 [2019-12-26 21:40:10,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2019-12-26 21:40:10,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28301 states. [2019-12-26 21:40:11,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28301 to 17980. [2019-12-26 21:40:11,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17980 states. [2019-12-26 21:40:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17980 states to 17980 states and 52359 transitions. [2019-12-26 21:40:11,297 INFO L78 Accepts]: Start accepts. Automaton has 17980 states and 52359 transitions. Word has length 54 [2019-12-26 21:40:11,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:11,297 INFO L462 AbstractCegarLoop]: Abstraction has 17980 states and 52359 transitions. [2019-12-26 21:40:11,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:40:11,298 INFO L276 IsEmpty]: Start isEmpty. Operand 17980 states and 52359 transitions. [2019-12-26 21:40:11,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 21:40:11,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:11,317 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-26 21:40:11,318 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-26 21:40:11,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:11,318 INFO L82 PathProgramCache]: Analyzing trace with hash 648112209, now seen corresponding path program 4 times [2019-12-26 21:40:11,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:11,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300134176] [2019-12-26 21:40:11,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:11,494 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-26 21:40:11,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300134176] [2019-12-26 21:40:11,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:11,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 21:40:11,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480056827] [2019-12-26 21:40:11,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:40:11,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:11,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:40:11,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:40:11,496 INFO L87 Difference]: Start difference. First operand 17980 states and 52359 transitions. Second operand 11 states. [2019-12-26 21:40:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:13,677 INFO L93 Difference]: Finished difference Result 29517 states and 84342 transitions. [2019-12-26 21:40:13,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-26 21:40:13,678 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-26 21:40:13,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:13,721 INFO L225 Difference]: With dead ends: 29517 [2019-12-26 21:40:13,721 INFO L226 Difference]: Without dead ends: 29517 [2019-12-26 21:40:13,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2019-12-26 21:40:13,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29517 states. [2019-12-26 21:40:14,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29517 to 18214. [2019-12-26 21:40:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18214 states. [2019-12-26 21:40:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18214 states to 18214 states and 53034 transitions. [2019-12-26 21:40:14,074 INFO L78 Accepts]: Start accepts. Automaton has 18214 states and 53034 transitions. Word has length 54 [2019-12-26 21:40:14,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:14,075 INFO L462 AbstractCegarLoop]: Abstraction has 18214 states and 53034 transitions. [2019-12-26 21:40:14,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:40:14,075 INFO L276 IsEmpty]: Start isEmpty. Operand 18214 states and 53034 transitions. [2019-12-26 21:40:14,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 21:40:14,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:14,098 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-26 21:40:14,098 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-26 21:40:14,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:14,099 INFO L82 PathProgramCache]: Analyzing trace with hash -2064888735, now seen corresponding path program 5 times [2019-12-26 21:40:14,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:14,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489798519] [2019-12-26 21:40:14,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:14,237 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-26 21:40:14,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489798519] [2019-12-26 21:40:14,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:14,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:40:14,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421722975] [2019-12-26 21:40:14,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:40:14,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:14,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:40:14,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:40:14,239 INFO L87 Difference]: Start difference. First operand 18214 states and 53034 transitions. Second operand 10 states. [2019-12-26 21:40:16,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:16,983 INFO L93 Difference]: Finished difference Result 29831 states and 84983 transitions. [2019-12-26 21:40:16,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-26 21:40:16,984 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-26 21:40:16,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:17,020 INFO L225 Difference]: With dead ends: 29831 [2019-12-26 21:40:17,020 INFO L226 Difference]: Without dead ends: 29831 [2019-12-26 21:40:17,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=1107, Unknown=0, NotChecked=0, Total=1332 [2019-12-26 21:40:17,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29831 states. [2019-12-26 21:40:17,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29831 to 16328. [2019-12-26 21:40:17,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16328 states. [2019-12-26 21:40:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16328 states to 16328 states and 47756 transitions. [2019-12-26 21:40:17,348 INFO L78 Accepts]: Start accepts. Automaton has 16328 states and 47756 transitions. Word has length 54 [2019-12-26 21:40:17,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:17,348 INFO L462 AbstractCegarLoop]: Abstraction has 16328 states and 47756 transitions. [2019-12-26 21:40:17,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:40:17,348 INFO L276 IsEmpty]: Start isEmpty. Operand 16328 states and 47756 transitions. [2019-12-26 21:40:17,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 21:40:17,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:17,366 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-26 21:40:17,366 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-26 21:40:17,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:17,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1252782527, now seen corresponding path program 6 times [2019-12-26 21:40:17,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:17,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370652700] [2019-12-26 21:40:17,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:17,694 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-26 21:40:17,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370652700] [2019-12-26 21:40:17,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:17,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 21:40:17,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252660128] [2019-12-26 21:40:17,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-26 21:40:17,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:17,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-26 21:40:17,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-26 21:40:17,696 INFO L87 Difference]: Start difference. First operand 16328 states and 47756 transitions. Second operand 15 states. [2019-12-26 21:40:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:20,496 INFO L93 Difference]: Finished difference Result 29666 states and 87300 transitions. [2019-12-26 21:40:20,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-26 21:40:20,497 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-26 21:40:20,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:20,546 INFO L225 Difference]: With dead ends: 29666 [2019-12-26 21:40:20,546 INFO L226 Difference]: Without dead ends: 28742 [2019-12-26 21:40:20,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=993, Unknown=0, NotChecked=0, Total=1190 [2019-12-26 21:40:20,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28742 states. [2019-12-26 21:40:20,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28742 to 16986. [2019-12-26 21:40:20,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16986 states. [2019-12-26 21:40:20,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16986 states to 16986 states and 49587 transitions. [2019-12-26 21:40:20,857 INFO L78 Accepts]: Start accepts. Automaton has 16986 states and 49587 transitions. Word has length 54 [2019-12-26 21:40:20,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:20,857 INFO L462 AbstractCegarLoop]: Abstraction has 16986 states and 49587 transitions. [2019-12-26 21:40:20,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-26 21:40:20,858 INFO L276 IsEmpty]: Start isEmpty. Operand 16986 states and 49587 transitions. [2019-12-26 21:40:20,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 21:40:20,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:20,873 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-26 21:40:20,874 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-26 21:40:20,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:20,874 INFO L82 PathProgramCache]: Analyzing trace with hash -627580535, now seen corresponding path program 7 times [2019-12-26 21:40:20,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:20,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810105066] [2019-12-26 21:40:20,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:21,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-26 21:40:21,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810105066] [2019-12-26 21:40:21,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:21,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:40:21,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424829603] [2019-12-26 21:40:21,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:40:21,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:21,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:40:21,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:40:21,036 INFO L87 Difference]: Start difference. First operand 16986 states and 49587 transitions. Second operand 11 states. [2019-12-26 21:40:22,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:22,055 INFO L93 Difference]: Finished difference Result 31860 states and 92519 transitions. [2019-12-26 21:40:22,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 21:40:22,055 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-26 21:40:22,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:22,093 INFO L225 Difference]: With dead ends: 31860 [2019-12-26 21:40:22,093 INFO L226 Difference]: Without dead ends: 30808 [2019-12-26 21:40:22,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-26 21:40:22,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30808 states. [2019-12-26 21:40:22,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30808 to 18560. [2019-12-26 21:40:22,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18560 states. [2019-12-26 21:40:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18560 states to 18560 states and 53856 transitions. [2019-12-26 21:40:22,421 INFO L78 Accepts]: Start accepts. Automaton has 18560 states and 53856 transitions. Word has length 54 [2019-12-26 21:40:22,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:22,422 INFO L462 AbstractCegarLoop]: Abstraction has 18560 states and 53856 transitions. [2019-12-26 21:40:22,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:40:22,422 INFO L276 IsEmpty]: Start isEmpty. Operand 18560 states and 53856 transitions. [2019-12-26 21:40:22,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 21:40:22,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:22,439 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-26 21:40:22,439 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-26 21:40:22,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:22,440 INFO L82 PathProgramCache]: Analyzing trace with hash -519813887, now seen corresponding path program 8 times [2019-12-26 21:40:22,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:22,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049470670] [2019-12-26 21:40:22,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:40:22,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049470670] [2019-12-26 21:40:22,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:22,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:40:22,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493366949] [2019-12-26 21:40:22,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:40:22,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:22,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:40:22,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:40:22,736 INFO L87 Difference]: Start difference. First operand 18560 states and 53856 transitions. Second operand 11 states. [2019-12-26 21:40:23,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:23,703 INFO L93 Difference]: Finished difference Result 30300 states and 87269 transitions. [2019-12-26 21:40:23,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:40:23,703 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-26 21:40:23,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:23,736 INFO L225 Difference]: With dead ends: 30300 [2019-12-26 21:40:23,736 INFO L226 Difference]: Without dead ends: 24815 [2019-12-26 21:40:23,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:40:23,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24815 states. [2019-12-26 21:40:23,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24815 to 15580. [2019-12-26 21:40:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15580 states. [2019-12-26 21:40:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15580 states to 15580 states and 45599 transitions. [2019-12-26 21:40:24,013 INFO L78 Accepts]: Start accepts. Automaton has 15580 states and 45599 transitions. Word has length 54 [2019-12-26 21:40:24,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:24,013 INFO L462 AbstractCegarLoop]: Abstraction has 15580 states and 45599 transitions. [2019-12-26 21:40:24,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:40:24,013 INFO L276 IsEmpty]: Start isEmpty. Operand 15580 states and 45599 transitions. [2019-12-26 21:40:24,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 21:40:24,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:24,029 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-26 21:40:24,029 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-26 21:40:24,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:24,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1403519087, now seen corresponding path program 9 times [2019-12-26 21:40:24,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:24,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692101160] [2019-12-26 21:40:24,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:24,178 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-26 21:40:24,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692101160] [2019-12-26 21:40:24,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:24,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:40:24,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600869259] [2019-12-26 21:40:24,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:40:24,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:24,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:40:24,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:40:24,180 INFO L87 Difference]: Start difference. First operand 15580 states and 45599 transitions. Second operand 9 states. [2019-12-26 21:40:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:25,462 INFO L93 Difference]: Finished difference Result 24678 states and 70952 transitions. [2019-12-26 21:40:25,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 21:40:25,462 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-26 21:40:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:25,495 INFO L225 Difference]: With dead ends: 24678 [2019-12-26 21:40:25,495 INFO L226 Difference]: Without dead ends: 24678 [2019-12-26 21:40:25,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:40:25,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24678 states. [2019-12-26 21:40:25,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24678 to 15779. [2019-12-26 21:40:25,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15779 states. [2019-12-26 21:40:25,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15779 states to 15779 states and 46209 transitions. [2019-12-26 21:40:25,761 INFO L78 Accepts]: Start accepts. Automaton has 15779 states and 46209 transitions. Word has length 54 [2019-12-26 21:40:25,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:25,761 INFO L462 AbstractCegarLoop]: Abstraction has 15779 states and 46209 transitions. [2019-12-26 21:40:25,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:40:25,761 INFO L276 IsEmpty]: Start isEmpty. Operand 15779 states and 46209 transitions. [2019-12-26 21:40:25,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 21:40:25,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:25,781 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-26 21:40:25,781 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-26 21:40:25,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:25,781 INFO L82 PathProgramCache]: Analyzing trace with hash -636204591, now seen corresponding path program 10 times [2019-12-26 21:40:25,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:25,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068750254] [2019-12-26 21:40:25,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:25,854 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-26 21:40:25,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068750254] [2019-12-26 21:40:25,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:25,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:40:25,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593161335] [2019-12-26 21:40:25,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:40:25,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:25,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:40:25,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:40:25,855 INFO L87 Difference]: Start difference. First operand 15779 states and 46209 transitions. Second operand 3 states. [2019-12-26 21:40:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:25,914 INFO L93 Difference]: Finished difference Result 15779 states and 46207 transitions. [2019-12-26 21:40:25,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:40:25,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-26 21:40:25,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:25,941 INFO L225 Difference]: With dead ends: 15779 [2019-12-26 21:40:25,941 INFO L226 Difference]: Without dead ends: 15779 [2019-12-26 21:40:25,942 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-26 21:40:26,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15779 states. [2019-12-26 21:40:26,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15779 to 11941. [2019-12-26 21:40:26,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11941 states. [2019-12-26 21:40:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11941 states to 11941 states and 35563 transitions. [2019-12-26 21:40:26,164 INFO L78 Accepts]: Start accepts. Automaton has 11941 states and 35563 transitions. Word has length 54 [2019-12-26 21:40:26,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:26,164 INFO L462 AbstractCegarLoop]: Abstraction has 11941 states and 35563 transitions. [2019-12-26 21:40:26,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:40:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 11941 states and 35563 transitions. [2019-12-26 21:40:26,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 21:40:26,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:26,178 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-26 21:40:26,178 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-26 21:40:26,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:26,178 INFO L82 PathProgramCache]: Analyzing trace with hash -767893923, now seen corresponding path program 1 times [2019-12-26 21:40:26,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:26,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557774269] [2019-12-26 21:40:26,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:26,320 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-26 21:40:26,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557774269] [2019-12-26 21:40:26,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:26,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:40:26,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404827991] [2019-12-26 21:40:26,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:40:26,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:26,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:40:26,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:40:26,322 INFO L87 Difference]: Start difference. First operand 11941 states and 35563 transitions. Second operand 12 states. [2019-12-26 21:40:27,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:27,188 INFO L93 Difference]: Finished difference Result 18712 states and 55295 transitions. [2019-12-26 21:40:27,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:40:27,189 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-26 21:40:27,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:27,216 INFO L225 Difference]: With dead ends: 18712 [2019-12-26 21:40:27,216 INFO L226 Difference]: Without dead ends: 18432 [2019-12-26 21:40:27,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-26 21:40:27,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18432 states. [2019-12-26 21:40:27,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18432 to 11795. [2019-12-26 21:40:27,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11795 states. [2019-12-26 21:40:27,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11795 states to 11795 states and 35219 transitions. [2019-12-26 21:40:27,436 INFO L78 Accepts]: Start accepts. Automaton has 11795 states and 35219 transitions. Word has length 55 [2019-12-26 21:40:27,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:27,437 INFO L462 AbstractCegarLoop]: Abstraction has 11795 states and 35219 transitions. [2019-12-26 21:40:27,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:40:27,437 INFO L276 IsEmpty]: Start isEmpty. Operand 11795 states and 35219 transitions. [2019-12-26 21:40:27,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 21:40:27,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:27,450 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-26 21:40:27,450 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-26 21:40:27,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:27,450 INFO L82 PathProgramCache]: Analyzing trace with hash -238462213, now seen corresponding path program 2 times [2019-12-26 21:40:27,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:27,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129441648] [2019-12-26 21:40:27,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:40:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:40:27,712 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:40:27,712 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:40:27,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t424~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t424~0.base_40|) |v_ULTIMATE.start_main_~#t424~0.offset_28| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p2_EAX~0_40) (= 0 v_~__unbuffered_p0_EAX~0_50) (= 0 v_~x$w_buff0~0_407) (= 0 v_~weak$$choice0~0_14) (= v_~__unbuffered_cnt~0_133 0) (= 0 v_~x$w_buff0_used~0_981) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~x$r_buff1_thd1~0_402 0) (= 0 v_~x$w_buff1~0_314) (= v_~x$flush_delayed~0_48 0) (= 0 v_~x$read_delayed_var~0.base_8) (= 0 v_~x~0_233) (= 0 v_~x$r_buff0_thd2~0_329) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$r_buff0_thd3~0_134) (= v_~__unbuffered_p1_EAX~0_219 0) (= 0 v_~x$w_buff1_used~0_593) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= v_~x$r_buff0_thd1~0_388 0) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~x$read_delayed_var~0.offset_8) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_17 0) (= v_~main$tmp_guard0~0_20 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t424~0.base_40|)) (= v_~x$r_buff0_thd0~0_141 0) (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t424~0.base_40| 1)) (= 0 |v_ULTIMATE.start_main_~#t424~0.offset_28|) (= |v_#NULL.offset_4| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t424~0.base_40|) (= v_~weak$$choice2~0_186 0) (= v_~y~0_68 0) (= 0 v_~x$r_buff1_thd3~0_275) (= v_~__unbuffered_p2_EBX~0_40 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t424~0.base_40| 4) |v_#length_21|) (= v_~x$r_buff1_thd0~0_274 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_407, ULTIMATE.start_main_~#t425~0.offset=|v_ULTIMATE.start_main_~#t425~0.offset_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_48, ULTIMATE.start_main_~#t426~0.base=|v_ULTIMATE.start_main_~#t426~0.base_19|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_402, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_43|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_37|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_50, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_219, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_593, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ULTIMATE.start_main_~#t426~0.offset=|v_ULTIMATE.start_main_~#t426~0.offset_16|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, ~x~0=v_~x~0_233, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_388, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_73|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~x$mem_tmp~0=v_~x$mem_tmp~0_17, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_127|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_49|, ULTIMATE.start_main_~#t424~0.offset=|v_ULTIMATE.start_main_~#t424~0.offset_28|, ULTIMATE.start_main_~#t425~0.base=|v_ULTIMATE.start_main_~#t425~0.base_32|, ~y~0=v_~y~0_68, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_274, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_329, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_981, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_77|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_186, ULTIMATE.start_main_~#t424~0.base=|v_ULTIMATE.start_main_~#t424~0.base_40|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t425~0.offset, ~x$flush_delayed~0, ULTIMATE.start_main_~#t426~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t426~0.offset, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~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_~#t424~0.offset, ULTIMATE.start_main_~#t425~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, 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, ULTIMATE.start_main_~#t424~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 21:40:27,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L823-1-->L825: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t425~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t425~0.base_11|) |v_ULTIMATE.start_main_~#t425~0.offset_10| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t425~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t425~0.offset_10|) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t425~0.base_11|) 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t425~0.base_11| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t425~0.base_11|)) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t425~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t425~0.offset=|v_ULTIMATE.start_main_~#t425~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t425~0.base=|v_ULTIMATE.start_main_~#t425~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t425~0.offset, ULTIMATE.start_main_~#t425~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-26 21:40:27,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_11 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_9|) (= v_~x$w_buff1_used~0_59 v_~x$w_buff0_used~0_123) (= 1 v_~x$w_buff0~0_27) (= v_P1Thread1of1ForFork0_~arg.offset_9 |v_P1Thread1of1ForFork0_#in~arg.offset_9|) (= 1 v_~x$w_buff0_used~0_122) (= 0 (mod v_~x$w_buff1_used~0_59 256)) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_9|) (= v_P1Thread1of1ForFork0_~arg.base_9 |v_P1Thread1of1ForFork0_#in~arg.base_9|) (= v_~x$w_buff0~0_28 v_~x$w_buff1~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_28, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_27, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_11, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_9|, ~x$w_buff1~0=v_~x$w_buff1~0_20, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_122} 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-26 21:40:27,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L825-1-->L827: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t426~0.offset_10|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t426~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t426~0.base_11|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t426~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t426~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t426~0.base_11|) |v_ULTIMATE.start_main_~#t426~0.offset_10| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t426~0.base_11| 4)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t426~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t426~0.base=|v_ULTIMATE.start_main_~#t426~0.base_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t426~0.offset=|v_ULTIMATE.start_main_~#t426~0.offset_10|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t426~0.base, #length, ULTIMATE.start_main_~#t426~0.offset, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-26 21:40:27,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L800-2-->L800-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1148242014 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1148242014 256)))) (or (and (= ~x~0_In1148242014 |P2Thread1of1ForFork1_#t~ite32_Out1148242014|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In1148242014 |P2Thread1of1ForFork1_#t~ite32_Out1148242014|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1148242014, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1148242014, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1148242014, ~x~0=~x~0_In1148242014} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1148242014|, ~x$w_buff1~0=~x$w_buff1~0_In1148242014, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1148242014, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1148242014, ~x~0=~x~0_In1148242014} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 21:40:27,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1602406252 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1602406252 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1602406252|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1602406252 |P1Thread1of1ForFork0_#t~ite28_Out1602406252|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1602406252, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1602406252} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1602406252, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1602406252|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1602406252} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-26 21:40:27,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2130756519 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-2130756519 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-2130756519 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2130756519 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-2130756519|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-2130756519 |P1Thread1of1ForFork0_#t~ite29_Out-2130756519|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2130756519, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2130756519, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2130756519, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2130756519} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2130756519, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2130756519, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2130756519, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-2130756519|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2130756519} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 21:40:27,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L780-->L781: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1722010204 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1722010204 256)))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out1722010204 0)) (and (= ~x$r_buff0_thd2~0_Out1722010204 ~x$r_buff0_thd2~0_In1722010204) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1722010204, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1722010204} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1722010204|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1722010204, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1722010204} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 21:40:27,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-1413586776 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1413586776 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1413586776 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1413586776 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out-1413586776| ~x$r_buff1_thd2~0_In-1413586776)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite31_Out-1413586776| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1413586776, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1413586776, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1413586776, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1413586776} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1413586776|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1413586776, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1413586776, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1413586776, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1413586776} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 21:40:27,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_51 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-26 21:40:27,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L744-->L744-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1992655253 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite15_Out1992655253| ~x$w_buff0_used~0_In1992655253) (= |P0Thread1of1ForFork2_#t~ite14_In1992655253| |P0Thread1of1ForFork2_#t~ite14_Out1992655253|) (not .cse0)) (and (= |P0Thread1of1ForFork2_#t~ite15_Out1992655253| |P0Thread1of1ForFork2_#t~ite14_Out1992655253|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1992655253 256)))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In1992655253 256) 0)) (and (= 0 (mod ~x$w_buff1_used~0_In1992655253 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1992655253 256)))) (= ~x$w_buff0_used~0_In1992655253 |P0Thread1of1ForFork2_#t~ite14_Out1992655253|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1992655253, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1992655253, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1992655253, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1992655253|, ~weak$$choice2~0=~weak$$choice2~0_In1992655253, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1992655253} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1992655253, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1992655253, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1992655253|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1992655253, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1992655253|, ~weak$$choice2~0=~weak$$choice2~0_In1992655253, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1992655253} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 21:40:27,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L745-->L745-8: Formula: (let ((.cse4 (= (mod ~weak$$choice2~0_In-1437876137 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1437876137 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1437876137 256))) (.cse6 (= (mod ~x$r_buff0_thd1~0_In-1437876137 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-1437876137 256) 0)) (.cse5 (= |P0Thread1of1ForFork2_#t~ite18_Out-1437876137| |P0Thread1of1ForFork2_#t~ite17_Out-1437876137|))) (or (let ((.cse0 (not .cse6))) (and (or .cse0 (not .cse1)) (or .cse0 (not .cse2)) (not .cse3) .cse4 (= |P0Thread1of1ForFork2_#t~ite17_Out-1437876137| |P0Thread1of1ForFork2_#t~ite16_Out-1437876137|) .cse5 (= 0 |P0Thread1of1ForFork2_#t~ite16_Out-1437876137|))) (and (or (and (= |P0Thread1of1ForFork2_#t~ite17_In-1437876137| |P0Thread1of1ForFork2_#t~ite17_Out-1437876137|) (not .cse4) (= ~x$w_buff1_used~0_In-1437876137 |P0Thread1of1ForFork2_#t~ite18_Out-1437876137|)) (and .cse4 (or .cse3 (and .cse6 .cse2) (and .cse6 .cse1)) .cse5 (= ~x$w_buff1_used~0_In-1437876137 |P0Thread1of1ForFork2_#t~ite17_Out-1437876137|))) (= |P0Thread1of1ForFork2_#t~ite16_In-1437876137| |P0Thread1of1ForFork2_#t~ite16_Out-1437876137|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1437876137, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-1437876137|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1437876137, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_In-1437876137|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1437876137, ~weak$$choice2~0=~weak$$choice2~0_In-1437876137, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1437876137} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1437876137, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-1437876137|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-1437876137|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1437876137, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_Out-1437876137|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1437876137, ~weak$$choice2~0=~weak$$choice2~0_In-1437876137, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1437876137} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, P0Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-26 21:40:27,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L745-8-->L747: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite18_55| v_~x$w_buff1_used~0_577) (not (= 0 (mod v_~weak$$choice2~0_176 256))) (= v_~x$r_buff0_thd1~0_373 v_~x$r_buff0_thd1~0_372)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_373, P0Thread1of1ForFork2_#t~ite18=|v_P0Thread1of1ForFork2_#t~ite18_55|, ~weak$$choice2~0=v_~weak$$choice2~0_176} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_39|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_372, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, P0Thread1of1ForFork2_#t~ite18=|v_P0Thread1of1ForFork2_#t~ite18_54|, P0Thread1of1ForFork2_#t~ite17=|v_P0Thread1of1ForFork2_#t~ite17_48|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_577, P0Thread1of1ForFork2_#t~ite16=|v_P0Thread1of1ForFork2_#t~ite16_44|, ~weak$$choice2~0=v_~weak$$choice2~0_176, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, ~x$w_buff1_used~0, P0Thread1of1ForFork2_#t~ite16, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-26 21:40:27,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L800-4-->L801: Formula: (= v_~x~0_36 |v_P2Thread1of1ForFork1_#t~ite32_14|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_14|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_13|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_21|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-26 21:40:27,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L749-->L757: Formula: (and (= v_~x$flush_delayed~0_13 0) (not (= (mod v_~x$flush_delayed~0_14 256) 0)) (= v_~x$mem_tmp~0_5 v_~x~0_56) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-26 21:40:27,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In744425099 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In744425099 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out744425099| ~x$w_buff0_used~0_In744425099) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out744425099| 0) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In744425099, ~x$w_buff0_used~0=~x$w_buff0_used~0_In744425099} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out744425099|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In744425099, ~x$w_buff0_used~0=~x$w_buff0_used~0_In744425099} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 21:40:27,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L802-->L802-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd3~0_In1885409057 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1885409057 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1885409057 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In1885409057 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out1885409057|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1885409057 |P2Thread1of1ForFork1_#t~ite35_Out1885409057|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1885409057, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1885409057, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1885409057, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1885409057} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1885409057|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1885409057, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1885409057, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1885409057, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1885409057} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 21:40:27,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In214385383 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In214385383 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In214385383 |P2Thread1of1ForFork1_#t~ite36_Out214385383|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out214385383|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In214385383, ~x$w_buff0_used~0=~x$w_buff0_used~0_In214385383} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out214385383|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In214385383, ~x$w_buff0_used~0=~x$w_buff0_used~0_In214385383} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 21:40:27,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1471937779 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1471937779 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In1471937779 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1471937779 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out1471937779|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd3~0_In1471937779 |P2Thread1of1ForFork1_#t~ite37_Out1471937779|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1471937779, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1471937779, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1471937779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1471937779} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1471937779|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1471937779, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1471937779, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1471937779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1471937779} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 21:40:27,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L804-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82) (= |v_P2Thread1of1ForFork1_#t~ite37_42| v_~x$r_buff1_thd3~0_144)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_41|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_144, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, 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-26 21:40:27,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L827-1-->L833: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:40:27,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L833-2-->L833-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1440059728 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite42_Out-1440059728| |ULTIMATE.start_main_#t~ite41_Out-1440059728|)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1440059728 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-1440059728| ~x~0_In-1440059728) (or .cse0 .cse1) .cse2) (and (= ~x$w_buff1~0_In-1440059728 |ULTIMATE.start_main_#t~ite41_Out-1440059728|) (not .cse1) .cse2 (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1440059728, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1440059728, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1440059728, ~x~0=~x~0_In-1440059728} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1440059728|, ~x$w_buff1~0=~x$w_buff1~0_In-1440059728, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1440059728, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1440059728, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1440059728|, ~x~0=~x~0_In-1440059728} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 21:40:27,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In271631903 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In271631903 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out271631903| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out271631903| ~x$w_buff0_used~0_In271631903)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In271631903, ~x$w_buff0_used~0=~x$w_buff0_used~0_In271631903} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In271631903, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out271631903|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In271631903} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 21:40:27,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L835-->L835-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-171644355 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-171644355 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-171644355 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-171644355 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out-171644355| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-171644355 |ULTIMATE.start_main_#t~ite44_Out-171644355|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-171644355, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-171644355, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-171644355, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-171644355} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-171644355, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-171644355, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-171644355, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-171644355|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-171644355} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 21:40:27,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1499497475 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1499497475 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1499497475| ~x$r_buff0_thd0~0_In1499497475) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out1499497475|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1499497475, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1499497475} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1499497475, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1499497475|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1499497475} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 21:40:27,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L837-->L837-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In1916087436 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1916087436 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1916087436 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1916087436 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite46_Out1916087436| ~x$r_buff1_thd0~0_In1916087436) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite46_Out1916087436| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1916087436, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1916087436, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1916087436, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1916087436} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1916087436, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1916087436|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1916087436, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1916087436, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1916087436} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-26 21:40:27,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L837-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_22 256)) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~__unbuffered_p1_EAX~0_205 0) (= v_~__unbuffered_p2_EBX~0_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~x$r_buff1_thd0~0_258 |v_ULTIMATE.start_main_#t~ite46_45|) (= 0 v_~__unbuffered_p0_EAX~0_34) (= v_~main$tmp_guard1~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_205, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_45|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_205, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_44|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_258, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} 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-26 21:40:27,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:40:27 BasicIcfg [2019-12-26 21:40:27,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:40:27,841 INFO L168 Benchmark]: Toolchain (without parser) took 68580.32 ms. Allocated memory was 138.9 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 101.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-26 21:40:27,842 INFO L168 Benchmark]: CDTParser took 1.66 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-26 21:40:27,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 801.26 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 101.4 MB in the beginning and 156.0 MB in the end (delta: -54.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-26 21:40:27,843 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.39 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 153.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:40:27,843 INFO L168 Benchmark]: Boogie Preprocessor took 41.76 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 151.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-26 21:40:27,843 INFO L168 Benchmark]: RCFGBuilder took 948.78 ms. Allocated memory is still 202.4 MB. Free memory was 151.4 MB in the beginning and 104.6 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-26 21:40:27,844 INFO L168 Benchmark]: TraceAbstraction took 66717.96 ms. Allocated memory was 202.4 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 103.9 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-26 21:40:27,847 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.66 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 801.26 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 101.4 MB in the beginning and 156.0 MB in the end (delta: -54.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.39 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 153.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.76 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 151.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 948.78 ms. Allocated memory is still 202.4 MB. Free memory was 151.4 MB in the beginning and 104.6 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 66717.96 ms. Allocated memory was 202.4 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 103.9 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 165 ProgramPointsBefore, 83 ProgramPointsAfterwards, 196 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 6986 VarBasedMoverChecksPositive, 284 VarBasedMoverChecksNegative, 112 SemBasedMoverChecksPositive, 261 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 75392 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t424, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] FCALL, FORK 0 pthread_create(&t425, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=0, z=0] [L777] 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=0, z=0] [L827] FCALL, FORK 0 pthread_create(&t426, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] 3 y = 1 [L794] 3 __unbuffered_p2_EAX = y [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L800] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L777] 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) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L734] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=1, 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_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L741] 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)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=1, 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_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L779] 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 [L741] 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) [L742] EXPR 1 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? 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))=1, x=1, x$flush_delayed=1, x$mem_tmp=1, 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_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L742] 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)) [L743] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? 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=1, x$flush_delayed=1, x$mem_tmp=1, 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_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L743] 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)) [L744] 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)) [L747] EXPR 1 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? 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))=0, x=1, x$flush_delayed=1, x$mem_tmp=1, 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_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L747] 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)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=1, 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_buff1=0, x$w_buff1_used=0, y=1, z=1] [L801] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L802] 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 [L803] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=1, 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_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L835] 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 [L836] 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, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 66.3s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 29.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6125 SDtfs, 7880 SDslu, 23901 SDs, 0 SdLazy, 16504 SolverSat, 347 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 432 GetRequests, 64 SyntacticMatches, 19 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86190occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 185988 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1258 NumberOfCodeBlocks, 1258 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1176 ConstructedInterpolants, 0 QuantifiedInterpolants, 266872 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...