/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:51:57,902 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:51:57,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:51:57,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:51:57,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:51:57,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:51:57,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:51:57,932 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:51:57,934 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:51:57,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:51:57,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:51:57,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:51:57,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:51:57,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:51:57,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:51:57,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:51:57,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:51:57,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:51:57,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:51:57,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:51:57,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:51:57,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:51:57,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:51:57,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:51:57,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:51:57,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:51:57,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:51:57,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:51:57,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:51:57,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:51:57,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:51:57,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:51:57,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:51:57,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:51:57,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:51:57,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:51:57,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:51:57,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:51:57,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:51:57,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:51:57,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:51:57,965 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:51:57,983 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:51:57,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:51:57,985 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:51:57,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:51:57,986 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:51:57,986 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:51:57,986 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:51:57,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:51:57,987 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:51:57,987 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:51:57,987 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:51:57,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:51:57,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:51:57,988 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:51:57,988 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:51:57,988 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:51:57,988 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:51:57,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:51:57,989 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:51:57,989 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:51:57,989 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:51:57,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:51:57,989 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:51:57,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:51:57,991 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:51:57,992 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:51:57,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:51:57,992 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:51:57,992 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:51:58,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:51:58,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:51:58,295 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:51:58,296 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:51:58,296 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:51:58,297 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc.i [2019-12-18 18:51:58,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec5d63ded/f824d2fa9ed6483d8cbc79cb0e687afa/FLAG8b3b34fb3 [2019-12-18 18:51:58,916 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:51:58,918 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.oepc.i [2019-12-18 18:51:58,941 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec5d63ded/f824d2fa9ed6483d8cbc79cb0e687afa/FLAG8b3b34fb3 [2019-12-18 18:51:59,191 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec5d63ded/f824d2fa9ed6483d8cbc79cb0e687afa [2019-12-18 18:51:59,199 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:51:59,201 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:51:59,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:51:59,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:51:59,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:51:59,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:51:59" (1/1) ... [2019-12-18 18:51:59,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2afd1b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:51:59, skipping insertion in model container [2019-12-18 18:51:59,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:51:59" (1/1) ... [2019-12-18 18:51:59,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:51:59,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:51:59,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:51:59,859 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:51:59,933 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:52:00,009 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:52:00,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:00 WrapperNode [2019-12-18 18:52:00,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:52:00,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:52:00,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:52:00,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:52:00,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:00" (1/1) ... [2019-12-18 18:52:00,056 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:00" (1/1) ... [2019-12-18 18:52:00,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:52:00,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:52:00,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:52:00,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:52:00,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:00" (1/1) ... [2019-12-18 18:52:00,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:00" (1/1) ... [2019-12-18 18:52:00,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:00" (1/1) ... [2019-12-18 18:52:00,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:00" (1/1) ... [2019-12-18 18:52:00,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:00" (1/1) ... [2019-12-18 18:52:00,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:00" (1/1) ... [2019-12-18 18:52:00,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:00" (1/1) ... [2019-12-18 18:52:00,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:52:00,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:52:00,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:52:00,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:52:00,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:52:00,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:52:00,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:52:00,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:52:00,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:52:00,192 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:52:00,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:52:00,194 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:52:00,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:52:00,195 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 18:52:00,195 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 18:52:00,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:52:00,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:52:00,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:52:00,202 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:52:00,937 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:52:00,937 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:52:00,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:52:00 BoogieIcfgContainer [2019-12-18 18:52:00,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:52:00,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:52:00,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:52:00,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:52:00,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:51:59" (1/3) ... [2019-12-18 18:52:00,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5415388a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:52:00, skipping insertion in model container [2019-12-18 18:52:00,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:52:00" (2/3) ... [2019-12-18 18:52:00,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5415388a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:52:00, skipping insertion in model container [2019-12-18 18:52:00,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:52:00" (3/3) ... [2019-12-18 18:52:00,949 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc.i [2019-12-18 18:52:00,959 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:52:00,959 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:52:00,969 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:52:00,970 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:52:01,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,012 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,013 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,038 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,038 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,038 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,039 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,039 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,060 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,060 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,068 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,069 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,069 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,074 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,074 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,078 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,079 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:52:01,097 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 18:52:01,118 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:52:01,118 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:52:01,118 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:52:01,118 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:52:01,118 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:52:01,119 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:52:01,119 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:52:01,119 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:52:01,136 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 18:52:01,138 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 18:52:01,221 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 18:52:01,222 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:52:01,241 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 18:52:01,271 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 18:52:01,315 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 18:52:01,315 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:52:01,324 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 18:52:01,347 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 18:52:01,348 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:52:07,146 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 18:52:07,268 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 18:52:07,301 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-18 18:52:07,301 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 18:52:07,305 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-18 18:52:19,846 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-18 18:52:19,848 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-18 18:52:19,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 18:52:19,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:52:19,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 18:52:19,856 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-18 18:52:19,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:52:19,862 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-18 18:52:19,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:52:19,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763098121] [2019-12-18 18:52:19,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:52:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:52:20,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:52:20,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763098121] [2019-12-18 18:52:20,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:52:20,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:52:20,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807553486] [2019-12-18 18:52:20,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:52:20,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:52:20,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:52:20,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:52:20,140 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-18 18:52:24,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:52:24,186 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-18 18:52:24,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:52:24,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 18:52:24,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:52:24,850 INFO L225 Difference]: With dead ends: 87834 [2019-12-18 18:52:24,850 INFO L226 Difference]: Without dead ends: 82738 [2019-12-18 18:52:24,852 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-18 18:52:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-18 18:52:32,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-18 18:52:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-18 18:52:32,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-18 18:52:32,919 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-18 18:52:32,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:52:32,920 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-18 18:52:32,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:52:32,920 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-18 18:52:32,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:52:32,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:52:32,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:52:32,930 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-18 18:52:32,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:52:32,930 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-18 18:52:32,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:52:32,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191568229] [2019-12-18 18:52:32,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:52:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:52:33,088 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-18 18:52:33,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191568229] [2019-12-18 18:52:33,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:52:33,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:52:33,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580114474] [2019-12-18 18:52:33,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:52:33,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:52:33,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:52:33,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:52:33,094 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-18 18:52:37,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:52:37,872 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-18 18:52:37,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:52:37,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 18:52:37,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:52:38,276 INFO L225 Difference]: With dead ends: 127286 [2019-12-18 18:52:38,276 INFO L226 Difference]: Without dead ends: 127202 [2019-12-18 18:52:38,277 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-18 18:52:41,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-18 18:52:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-18 18:52:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-18 18:52:44,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-18 18:52:44,957 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-18 18:52:44,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:52:44,958 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-18 18:52:44,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:52:44,959 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-18 18:52:44,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:52:44,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:52:44,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:52:44,963 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-18 18:52:44,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:52:44,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-18 18:52:44,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:52:44,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874314433] [2019-12-18 18:52:44,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:52:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:52:45,050 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-18 18:52:45,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874314433] [2019-12-18 18:52:45,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:52:45,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:52:45,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085032765] [2019-12-18 18:52:45,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:52:45,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:52:45,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:52:45,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:52:45,055 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-18 18:52:45,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:52:45,175 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-18 18:52:45,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:52:45,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 18:52:45,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:52:45,290 INFO L225 Difference]: With dead ends: 28492 [2019-12-18 18:52:45,290 INFO L226 Difference]: Without dead ends: 28492 [2019-12-18 18:52:45,291 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-18 18:52:49,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-18 18:52:49,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-18 18:52:49,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-18 18:52:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-18 18:52:49,600 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-18 18:52:49,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:52:49,600 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-18 18:52:49,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:52:49,600 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-18 18:52:49,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:52:49,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:52:49,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:52:49,602 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-18 18:52:49,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:52:49,602 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-18 18:52:49,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:52:49,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75434912] [2019-12-18 18:52:49,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:52:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:52:49,720 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-18 18:52:49,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75434912] [2019-12-18 18:52:49,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:52:49,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:52:49,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486221382] [2019-12-18 18:52:49,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:52:49,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:52:49,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:52:49,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:52:49,722 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-18 18:52:50,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:52:50,229 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-18 18:52:50,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:52:50,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 18:52:50,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:52:50,302 INFO L225 Difference]: With dead ends: 41156 [2019-12-18 18:52:50,302 INFO L226 Difference]: Without dead ends: 41141 [2019-12-18 18:52:50,302 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-18 18:52:50,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-18 18:52:50,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-18 18:52:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-18 18:52:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-18 18:52:51,393 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-18 18:52:51,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:52:51,393 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-18 18:52:51,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:52:51,393 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-18 18:52:51,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 18:52:51,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:52:51,404 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-18 18:52:51,404 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-18 18:52:51,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:52:51,405 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-18 18:52:51,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:52:51,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112229052] [2019-12-18 18:52:51,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:52:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:52:51,637 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-18 18:52:51,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112229052] [2019-12-18 18:52:51,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:52:51,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:52:51,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826995078] [2019-12-18 18:52:51,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:52:51,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:52:51,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:52:51,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:52:51,639 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 6 states. [2019-12-18 18:52:52,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:52:52,547 INFO L93 Difference]: Finished difference Result 48363 states and 157775 transitions. [2019-12-18 18:52:52,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:52:52,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 18:52:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:52:52,633 INFO L225 Difference]: With dead ends: 48363 [2019-12-18 18:52:52,634 INFO L226 Difference]: Without dead ends: 48336 [2019-12-18 18:52:52,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:52:52,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-18 18:52:53,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 33272. [2019-12-18 18:52:53,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-18 18:52:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 109841 transitions. [2019-12-18 18:52:53,311 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 109841 transitions. Word has length 22 [2019-12-18 18:52:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:52:53,311 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 109841 transitions. [2019-12-18 18:52:53,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:52:53,311 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 109841 transitions. [2019-12-18 18:52:53,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:52:53,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:52:53,328 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-18 18:52:53,329 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-18 18:52:53,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:52:53,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-18 18:52:53,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:52:53,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900700972] [2019-12-18 18:52:53,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:52:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:52:53,378 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-18 18:52:53,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900700972] [2019-12-18 18:52:53,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:52:53,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:52:53,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219423276] [2019-12-18 18:52:53,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:52:53,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:52:53,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:52:53,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:52:53,380 INFO L87 Difference]: Start difference. First operand 33272 states and 109841 transitions. Second operand 4 states. [2019-12-18 18:52:53,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:52:53,449 INFO L93 Difference]: Finished difference Result 12861 states and 39176 transitions. [2019-12-18 18:52:53,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:52:53,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:52:53,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:52:53,473 INFO L225 Difference]: With dead ends: 12861 [2019-12-18 18:52:53,473 INFO L226 Difference]: Without dead ends: 12861 [2019-12-18 18:52:53,474 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-18 18:52:53,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-12-18 18:52:53,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12721. [2019-12-18 18:52:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12721 states. [2019-12-18 18:52:53,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12721 states to 12721 states and 38766 transitions. [2019-12-18 18:52:53,661 INFO L78 Accepts]: Start accepts. Automaton has 12721 states and 38766 transitions. Word has length 25 [2019-12-18 18:52:53,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:52:53,661 INFO L462 AbstractCegarLoop]: Abstraction has 12721 states and 38766 transitions. [2019-12-18 18:52:53,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:52:53,661 INFO L276 IsEmpty]: Start isEmpty. Operand 12721 states and 38766 transitions. [2019-12-18 18:52:53,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 18:52:53,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:52:53,679 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-18 18:52:53,679 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-18 18:52:53,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:52:53,679 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-18 18:52:53,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:52:53,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334787639] [2019-12-18 18:52:53,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:52:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:52:53,749 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-18 18:52:53,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334787639] [2019-12-18 18:52:53,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:52:53,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:52:53,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90987279] [2019-12-18 18:52:53,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:52:53,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:52:53,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:52:53,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:52:53,751 INFO L87 Difference]: Start difference. First operand 12721 states and 38766 transitions. Second operand 5 states. [2019-12-18 18:52:53,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:52:53,833 INFO L93 Difference]: Finished difference Result 11425 states and 35436 transitions. [2019-12-18 18:52:53,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:52:53,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 18:52:53,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:52:53,852 INFO L225 Difference]: With dead ends: 11425 [2019-12-18 18:52:53,853 INFO L226 Difference]: Without dead ends: 11425 [2019-12-18 18:52:53,853 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-18 18:52:53,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11425 states. [2019-12-18 18:52:54,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11425 to 10977. [2019-12-18 18:52:54,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10977 states. [2019-12-18 18:52:54,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10977 states to 10977 states and 34172 transitions. [2019-12-18 18:52:54,214 INFO L78 Accepts]: Start accepts. Automaton has 10977 states and 34172 transitions. Word has length 39 [2019-12-18 18:52:54,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:52:54,215 INFO L462 AbstractCegarLoop]: Abstraction has 10977 states and 34172 transitions. [2019-12-18 18:52:54,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:52:54,215 INFO L276 IsEmpty]: Start isEmpty. Operand 10977 states and 34172 transitions. [2019-12-18 18:52:54,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:52:54,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:52:54,233 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-18 18:52:54,233 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-18 18:52:54,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:52:54,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829373, now seen corresponding path program 1 times [2019-12-18 18:52:54,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:52:54,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690729129] [2019-12-18 18:52:54,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:52:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:52:54,309 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-18 18:52:54,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690729129] [2019-12-18 18:52:54,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:52:54,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:52:54,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109888361] [2019-12-18 18:52:54,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:52:54,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:52:54,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:52:54,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:52:54,311 INFO L87 Difference]: Start difference. First operand 10977 states and 34172 transitions. Second operand 4 states. [2019-12-18 18:52:54,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:52:54,409 INFO L93 Difference]: Finished difference Result 20009 states and 62260 transitions. [2019-12-18 18:52:54,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:52:54,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-18 18:52:54,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:52:54,429 INFO L225 Difference]: With dead ends: 20009 [2019-12-18 18:52:54,430 INFO L226 Difference]: Without dead ends: 9365 [2019-12-18 18:52:54,430 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-18 18:52:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9365 states. [2019-12-18 18:52:54,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9365 to 9365. [2019-12-18 18:52:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9365 states. [2019-12-18 18:52:54,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 29013 transitions. [2019-12-18 18:52:54,650 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 29013 transitions. Word has length 53 [2019-12-18 18:52:54,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:52:54,650 INFO L462 AbstractCegarLoop]: Abstraction has 9365 states and 29013 transitions. [2019-12-18 18:52:54,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:52:54,650 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 29013 transitions. [2019-12-18 18:52:54,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:52:54,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:52:54,671 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-18 18:52:54,671 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-18 18:52:54,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:52:54,671 INFO L82 PathProgramCache]: Analyzing trace with hash 383407097, now seen corresponding path program 2 times [2019-12-18 18:52:54,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:52:54,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183261950] [2019-12-18 18:52:54,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:52:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:52:54,762 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-18 18:52:54,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183261950] [2019-12-18 18:52:54,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:52:54,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:52:54,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941935228] [2019-12-18 18:52:54,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:52:54,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:52:54,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:52:54,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:52:54,765 INFO L87 Difference]: Start difference. First operand 9365 states and 29013 transitions. Second operand 7 states. [2019-12-18 18:52:55,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:52:55,153 INFO L93 Difference]: Finished difference Result 23182 states and 71788 transitions. [2019-12-18 18:52:55,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:52:55,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 18:52:55,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:52:55,182 INFO L225 Difference]: With dead ends: 23182 [2019-12-18 18:52:55,183 INFO L226 Difference]: Without dead ends: 18276 [2019-12-18 18:52:55,183 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-18 18:52:55,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18276 states. [2019-12-18 18:52:55,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18276 to 11162. [2019-12-18 18:52:55,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11162 states. [2019-12-18 18:52:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11162 states to 11162 states and 34879 transitions. [2019-12-18 18:52:55,415 INFO L78 Accepts]: Start accepts. Automaton has 11162 states and 34879 transitions. Word has length 53 [2019-12-18 18:52:55,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:52:55,416 INFO L462 AbstractCegarLoop]: Abstraction has 11162 states and 34879 transitions. [2019-12-18 18:52:55,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:52:55,416 INFO L276 IsEmpty]: Start isEmpty. Operand 11162 states and 34879 transitions. [2019-12-18 18:52:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:52:55,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:52:55,432 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-18 18:52:55,432 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-18 18:52:55,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:52:55,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1401815865, now seen corresponding path program 3 times [2019-12-18 18:52:55,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:52:55,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918510255] [2019-12-18 18:52:55,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:52:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:52:55,530 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-18 18:52:55,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918510255] [2019-12-18 18:52:55,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:52:55,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:52:55,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303526131] [2019-12-18 18:52:55,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:52:55,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:52:55,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:52:55,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:52:55,532 INFO L87 Difference]: Start difference. First operand 11162 states and 34879 transitions. Second operand 7 states. [2019-12-18 18:52:55,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:52:55,952 INFO L93 Difference]: Finished difference Result 27840 states and 85084 transitions. [2019-12-18 18:52:55,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:52:55,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 18:52:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:52:55,994 INFO L225 Difference]: With dead ends: 27840 [2019-12-18 18:52:55,994 INFO L226 Difference]: Without dead ends: 19924 [2019-12-18 18:52:55,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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-18 18:52:56,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19924 states. [2019-12-18 18:52:56,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19924 to 13020. [2019-12-18 18:52:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13020 states. [2019-12-18 18:52:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 40574 transitions. [2019-12-18 18:52:56,275 INFO L78 Accepts]: Start accepts. Automaton has 13020 states and 40574 transitions. Word has length 53 [2019-12-18 18:52:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:52:56,275 INFO L462 AbstractCegarLoop]: Abstraction has 13020 states and 40574 transitions. [2019-12-18 18:52:56,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:52:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 13020 states and 40574 transitions. [2019-12-18 18:52:56,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:52:56,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:52:56,294 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-18 18:52:56,294 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-18 18:52:56,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:52:56,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1901485579, now seen corresponding path program 4 times [2019-12-18 18:52:56,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:52:56,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400718245] [2019-12-18 18:52:56,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:52:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:52:56,377 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-18 18:52:56,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400718245] [2019-12-18 18:52:56,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:52:56,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:52:56,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777241779] [2019-12-18 18:52:56,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:52:56,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:52:56,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:52:56,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:52:56,379 INFO L87 Difference]: Start difference. First operand 13020 states and 40574 transitions. Second operand 7 states. [2019-12-18 18:52:56,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:52:56,768 INFO L93 Difference]: Finished difference Result 25803 states and 80188 transitions. [2019-12-18 18:52:56,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:52:56,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 18:52:56,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:52:56,806 INFO L225 Difference]: With dead ends: 25803 [2019-12-18 18:52:56,806 INFO L226 Difference]: Without dead ends: 23832 [2019-12-18 18:52:56,807 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-18 18:52:57,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23832 states. [2019-12-18 18:52:57,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23832 to 13086. [2019-12-18 18:52:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13086 states. [2019-12-18 18:52:57,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13086 states to 13086 states and 40859 transitions. [2019-12-18 18:52:57,291 INFO L78 Accepts]: Start accepts. Automaton has 13086 states and 40859 transitions. Word has length 53 [2019-12-18 18:52:57,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:52:57,292 INFO L462 AbstractCegarLoop]: Abstraction has 13086 states and 40859 transitions. [2019-12-18 18:52:57,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:52:57,292 INFO L276 IsEmpty]: Start isEmpty. Operand 13086 states and 40859 transitions. [2019-12-18 18:52:57,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:52:57,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:52:57,308 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-18 18:52:57,308 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-18 18:52:57,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:52:57,308 INFO L82 PathProgramCache]: Analyzing trace with hash -9451933, now seen corresponding path program 1 times [2019-12-18 18:52:57,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:52:57,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955392640] [2019-12-18 18:52:57,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:52:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:52:57,360 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-18 18:52:57,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955392640] [2019-12-18 18:52:57,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:52:57,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:52:57,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130095746] [2019-12-18 18:52:57,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:52:57,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:52:57,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:52:57,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:52:57,363 INFO L87 Difference]: Start difference. First operand 13086 states and 40859 transitions. Second operand 3 states. [2019-12-18 18:52:57,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:52:57,457 INFO L93 Difference]: Finished difference Result 18737 states and 58738 transitions. [2019-12-18 18:52:57,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:52:57,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 18:52:57,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:52:57,484 INFO L225 Difference]: With dead ends: 18737 [2019-12-18 18:52:57,484 INFO L226 Difference]: Without dead ends: 18737 [2019-12-18 18:52:57,484 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-18 18:52:57,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18737 states. [2019-12-18 18:52:57,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18737 to 16909. [2019-12-18 18:52:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16909 states. [2019-12-18 18:52:57,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16909 states to 16909 states and 53533 transitions. [2019-12-18 18:52:57,759 INFO L78 Accepts]: Start accepts. Automaton has 16909 states and 53533 transitions. Word has length 53 [2019-12-18 18:52:57,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:52:57,759 INFO L462 AbstractCegarLoop]: Abstraction has 16909 states and 53533 transitions. [2019-12-18 18:52:57,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:52:57,760 INFO L276 IsEmpty]: Start isEmpty. Operand 16909 states and 53533 transitions. [2019-12-18 18:52:57,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:52:57,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:52:57,780 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-18 18:52:57,781 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-18 18:52:57,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:52:57,781 INFO L82 PathProgramCache]: Analyzing trace with hash 2081547793, now seen corresponding path program 5 times [2019-12-18 18:52:57,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:52:57,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173322169] [2019-12-18 18:52:57,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:52:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:52:57,888 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-18 18:52:57,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173322169] [2019-12-18 18:52:57,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:52:57,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:52:57,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479205534] [2019-12-18 18:52:57,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:52:57,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:52:57,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:52:57,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:52:57,891 INFO L87 Difference]: Start difference. First operand 16909 states and 53533 transitions. Second operand 6 states. [2019-12-18 18:52:58,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:52:58,627 INFO L93 Difference]: Finished difference Result 31543 states and 97867 transitions. [2019-12-18 18:52:58,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:52:58,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-18 18:52:58,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:52:58,676 INFO L225 Difference]: With dead ends: 31543 [2019-12-18 18:52:58,676 INFO L226 Difference]: Without dead ends: 31459 [2019-12-18 18:52:58,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:52:58,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31459 states. [2019-12-18 18:52:59,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31459 to 19853. [2019-12-18 18:52:59,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19853 states. [2019-12-18 18:52:59,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19853 states to 19853 states and 62091 transitions. [2019-12-18 18:52:59,060 INFO L78 Accepts]: Start accepts. Automaton has 19853 states and 62091 transitions. Word has length 53 [2019-12-18 18:52:59,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:52:59,061 INFO L462 AbstractCegarLoop]: Abstraction has 19853 states and 62091 transitions. [2019-12-18 18:52:59,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:52:59,061 INFO L276 IsEmpty]: Start isEmpty. Operand 19853 states and 62091 transitions. [2019-12-18 18:52:59,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:52:59,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:52:59,094 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-18 18:52:59,094 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-18 18:52:59,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:52:59,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1629843107, now seen corresponding path program 6 times [2019-12-18 18:52:59,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:52:59,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737259746] [2019-12-18 18:52:59,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:52:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:52:59,193 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-18 18:52:59,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737259746] [2019-12-18 18:52:59,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:52:59,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:52:59,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482507380] [2019-12-18 18:52:59,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:52:59,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:52:59,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:52:59,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:52:59,196 INFO L87 Difference]: Start difference. First operand 19853 states and 62091 transitions. Second operand 7 states. [2019-12-18 18:53:00,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:00,361 INFO L93 Difference]: Finished difference Result 31464 states and 95079 transitions. [2019-12-18 18:53:00,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 18:53:00,362 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 18:53:00,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:00,405 INFO L225 Difference]: With dead ends: 31464 [2019-12-18 18:53:00,406 INFO L226 Difference]: Without dead ends: 31342 [2019-12-18 18:53:00,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 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-18 18:53:00,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31342 states. [2019-12-18 18:53:00,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31342 to 25003. [2019-12-18 18:53:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25003 states. [2019-12-18 18:53:00,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25003 states to 25003 states and 77213 transitions. [2019-12-18 18:53:00,831 INFO L78 Accepts]: Start accepts. Automaton has 25003 states and 77213 transitions. Word has length 53 [2019-12-18 18:53:00,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:00,831 INFO L462 AbstractCegarLoop]: Abstraction has 25003 states and 77213 transitions. [2019-12-18 18:53:00,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:53:00,831 INFO L276 IsEmpty]: Start isEmpty. Operand 25003 states and 77213 transitions. [2019-12-18 18:53:00,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:53:00,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:00,875 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-18 18:53:00,875 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-18 18:53:00,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:00,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1109995221, now seen corresponding path program 7 times [2019-12-18 18:53:00,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:00,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835742929] [2019-12-18 18:53:00,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:00,999 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-18 18:53:01,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835742929] [2019-12-18 18:53:01,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:01,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:53:01,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431698975] [2019-12-18 18:53:01,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:53:01,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:01,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:53:01,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:53:01,001 INFO L87 Difference]: Start difference. First operand 25003 states and 77213 transitions. Second operand 9 states. [2019-12-18 18:53:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:02,809 INFO L93 Difference]: Finished difference Result 41056 states and 124508 transitions. [2019-12-18 18:53:02,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 18:53:02,810 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 18:53:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:02,878 INFO L225 Difference]: With dead ends: 41056 [2019-12-18 18:53:02,878 INFO L226 Difference]: Without dead ends: 41056 [2019-12-18 18:53:02,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:53:02,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41056 states. [2019-12-18 18:53:03,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41056 to 23556. [2019-12-18 18:53:03,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23556 states. [2019-12-18 18:53:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23556 states to 23556 states and 73044 transitions. [2019-12-18 18:53:03,398 INFO L78 Accepts]: Start accepts. Automaton has 23556 states and 73044 transitions. Word has length 53 [2019-12-18 18:53:03,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:03,398 INFO L462 AbstractCegarLoop]: Abstraction has 23556 states and 73044 transitions. [2019-12-18 18:53:03,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:53:03,398 INFO L276 IsEmpty]: Start isEmpty. Operand 23556 states and 73044 transitions. [2019-12-18 18:53:03,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:53:03,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:03,425 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-18 18:53:03,425 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-18 18:53:03,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:03,425 INFO L82 PathProgramCache]: Analyzing trace with hash 2099294685, now seen corresponding path program 8 times [2019-12-18 18:53:03,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:03,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562425236] [2019-12-18 18:53:03,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:03,490 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-18 18:53:03,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562425236] [2019-12-18 18:53:03,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:03,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:53:03,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009223222] [2019-12-18 18:53:03,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:53:03,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:03,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:53:03,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:53:03,492 INFO L87 Difference]: Start difference. First operand 23556 states and 73044 transitions. Second operand 3 states. [2019-12-18 18:53:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:03,576 INFO L93 Difference]: Finished difference Result 17418 states and 53184 transitions. [2019-12-18 18:53:03,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:53:03,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 18:53:03,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:03,611 INFO L225 Difference]: With dead ends: 17418 [2019-12-18 18:53:03,611 INFO L226 Difference]: Without dead ends: 17418 [2019-12-18 18:53:03,612 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-18 18:53:03,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17418 states. [2019-12-18 18:53:04,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17418 to 16845. [2019-12-18 18:53:04,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16845 states. [2019-12-18 18:53:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16845 states to 16845 states and 51304 transitions. [2019-12-18 18:53:04,146 INFO L78 Accepts]: Start accepts. Automaton has 16845 states and 51304 transitions. Word has length 53 [2019-12-18 18:53:04,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:04,146 INFO L462 AbstractCegarLoop]: Abstraction has 16845 states and 51304 transitions. [2019-12-18 18:53:04,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:53:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 16845 states and 51304 transitions. [2019-12-18 18:53:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:53:04,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:04,164 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-18 18:53:04,164 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-18 18:53:04,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:04,164 INFO L82 PathProgramCache]: Analyzing trace with hash -2130494140, now seen corresponding path program 1 times [2019-12-18 18:53:04,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:04,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661177154] [2019-12-18 18:53:04,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:04,336 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-18 18:53:04,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661177154] [2019-12-18 18:53:04,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:04,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:53:04,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236079467] [2019-12-18 18:53:04,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:53:04,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:04,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:53:04,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:53:04,339 INFO L87 Difference]: Start difference. First operand 16845 states and 51304 transitions. Second operand 11 states. [2019-12-18 18:53:05,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:05,597 INFO L93 Difference]: Finished difference Result 34904 states and 106417 transitions. [2019-12-18 18:53:05,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 18:53:05,598 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-18 18:53:05,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:05,655 INFO L225 Difference]: With dead ends: 34904 [2019-12-18 18:53:05,655 INFO L226 Difference]: Without dead ends: 33854 [2019-12-18 18:53:05,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 18:53:05,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33854 states. [2019-12-18 18:53:06,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33854 to 21618. [2019-12-18 18:53:06,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21618 states. [2019-12-18 18:53:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21618 states to 21618 states and 65921 transitions. [2019-12-18 18:53:06,069 INFO L78 Accepts]: Start accepts. Automaton has 21618 states and 65921 transitions. Word has length 54 [2019-12-18 18:53:06,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:06,069 INFO L462 AbstractCegarLoop]: Abstraction has 21618 states and 65921 transitions. [2019-12-18 18:53:06,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:53:06,069 INFO L276 IsEmpty]: Start isEmpty. Operand 21618 states and 65921 transitions. [2019-12-18 18:53:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:53:06,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 18:53:06,092 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-18 18:53:06,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:06,092 INFO L82 PathProgramCache]: Analyzing trace with hash 211798304, now seen corresponding path program 2 times [2019-12-18 18:53:06,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:06,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156380301] [2019-12-18 18:53:06,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:06,272 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-18 18:53:06,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156380301] [2019-12-18 18:53:06,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:06,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:53:06,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469191411] [2019-12-18 18:53:06,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:53:06,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:06,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:53:06,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:53:06,277 INFO L87 Difference]: Start difference. First operand 21618 states and 65921 transitions. Second operand 11 states. [2019-12-18 18:53:07,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:07,256 INFO L93 Difference]: Finished difference Result 34597 states and 104764 transitions. [2019-12-18 18:53:07,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 18:53:07,257 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-18 18:53:07,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:07,294 INFO L225 Difference]: With dead ends: 34597 [2019-12-18 18:53:07,294 INFO L226 Difference]: Without dead ends: 25901 [2019-12-18 18:53:07,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:53:07,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25901 states. [2019-12-18 18:53:07,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25901 to 16668. [2019-12-18 18:53:07,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16668 states. [2019-12-18 18:53:07,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16668 states to 16668 states and 50247 transitions. [2019-12-18 18:53:07,602 INFO L78 Accepts]: Start accepts. Automaton has 16668 states and 50247 transitions. Word has length 54 [2019-12-18 18:53:07,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:07,603 INFO L462 AbstractCegarLoop]: Abstraction has 16668 states and 50247 transitions. [2019-12-18 18:53:07,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:53:07,603 INFO L276 IsEmpty]: Start isEmpty. Operand 16668 states and 50247 transitions. [2019-12-18 18:53:07,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:53:07,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:07,620 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-18 18:53:07,620 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-18 18:53:07,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:07,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1398179606, now seen corresponding path program 3 times [2019-12-18 18:53:07,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:07,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599434173] [2019-12-18 18:53:07,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:07,752 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-18 18:53:07,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599434173] [2019-12-18 18:53:07,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:07,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:53:07,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370292323] [2019-12-18 18:53:07,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 18:53:07,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:07,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 18:53:07,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:53:07,754 INFO L87 Difference]: Start difference. First operand 16668 states and 50247 transitions. Second operand 8 states. [2019-12-18 18:53:09,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:09,896 INFO L93 Difference]: Finished difference Result 24076 states and 70785 transitions. [2019-12-18 18:53:09,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 18:53:09,897 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-18 18:53:09,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:09,929 INFO L225 Difference]: With dead ends: 24076 [2019-12-18 18:53:09,929 INFO L226 Difference]: Without dead ends: 23940 [2019-12-18 18:53:09,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-18 18:53:09,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23940 states. [2019-12-18 18:53:10,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23940 to 16411. [2019-12-18 18:53:10,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16411 states. [2019-12-18 18:53:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16411 states to 16411 states and 49483 transitions. [2019-12-18 18:53:10,221 INFO L78 Accepts]: Start accepts. Automaton has 16411 states and 49483 transitions. Word has length 54 [2019-12-18 18:53:10,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:10,221 INFO L462 AbstractCegarLoop]: Abstraction has 16411 states and 49483 transitions. [2019-12-18 18:53:10,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 18:53:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 16411 states and 49483 transitions. [2019-12-18 18:53:10,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:53:10,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:10,239 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-18 18:53:10,239 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-18 18:53:10,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:10,240 INFO L82 PathProgramCache]: Analyzing trace with hash 2123645396, now seen corresponding path program 4 times [2019-12-18 18:53:10,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:10,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322155631] [2019-12-18 18:53:10,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:10,351 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-18 18:53:10,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322155631] [2019-12-18 18:53:10,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:10,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:53:10,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498352026] [2019-12-18 18:53:10,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:53:10,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:10,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:53:10,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:53:10,353 INFO L87 Difference]: Start difference. First operand 16411 states and 49483 transitions. Second operand 9 states. [2019-12-18 18:53:11,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:11,483 INFO L93 Difference]: Finished difference Result 23561 states and 70449 transitions. [2019-12-18 18:53:11,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 18:53:11,483 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 18:53:11,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:11,550 INFO L225 Difference]: With dead ends: 23561 [2019-12-18 18:53:11,551 INFO L226 Difference]: Without dead ends: 22790 [2019-12-18 18:53:11,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-18 18:53:11,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22790 states. [2019-12-18 18:53:12,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22790 to 16167. [2019-12-18 18:53:12,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16167 states. [2019-12-18 18:53:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16167 states to 16167 states and 48790 transitions. [2019-12-18 18:53:12,116 INFO L78 Accepts]: Start accepts. Automaton has 16167 states and 48790 transitions. Word has length 54 [2019-12-18 18:53:12,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:12,116 INFO L462 AbstractCegarLoop]: Abstraction has 16167 states and 48790 transitions. [2019-12-18 18:53:12,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:53:12,116 INFO L276 IsEmpty]: Start isEmpty. Operand 16167 states and 48790 transitions. [2019-12-18 18:53:12,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:53:12,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:12,146 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-18 18:53:12,146 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-18 18:53:12,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:12,147 INFO L82 PathProgramCache]: Analyzing trace with hash -139497916, now seen corresponding path program 5 times [2019-12-18 18:53:12,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:12,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672138181] [2019-12-18 18:53:12,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:12,249 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-18 18:53:12,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672138181] [2019-12-18 18:53:12,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:12,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:53:12,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116913958] [2019-12-18 18:53:12,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:53:12,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:12,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:53:12,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:53:12,253 INFO L87 Difference]: Start difference. First operand 16167 states and 48790 transitions. Second operand 3 states. [2019-12-18 18:53:12,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:12,349 INFO L93 Difference]: Finished difference Result 16165 states and 48785 transitions. [2019-12-18 18:53:12,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:53:12,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 18:53:12,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:12,381 INFO L225 Difference]: With dead ends: 16165 [2019-12-18 18:53:12,381 INFO L226 Difference]: Without dead ends: 16165 [2019-12-18 18:53:12,382 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-18 18:53:12,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16165 states. [2019-12-18 18:53:12,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16165 to 14735. [2019-12-18 18:53:12,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14735 states. [2019-12-18 18:53:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14735 states to 14735 states and 44821 transitions. [2019-12-18 18:53:12,710 INFO L78 Accepts]: Start accepts. Automaton has 14735 states and 44821 transitions. Word has length 54 [2019-12-18 18:53:12,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:12,710 INFO L462 AbstractCegarLoop]: Abstraction has 14735 states and 44821 transitions. [2019-12-18 18:53:12,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:53:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 14735 states and 44821 transitions. [2019-12-18 18:53:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:53:12,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:12,726 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-18 18:53:12,726 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-18 18:53:12,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:12,726 INFO L82 PathProgramCache]: Analyzing trace with hash -2043347127, now seen corresponding path program 1 times [2019-12-18 18:53:12,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:12,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894176688] [2019-12-18 18:53:12,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:53:12,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:53:12,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894176688] [2019-12-18 18:53:12,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:53:12,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:53:12,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545276981] [2019-12-18 18:53:12,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 18:53:12,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:53:12,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 18:53:12,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:53:12,882 INFO L87 Difference]: Start difference. First operand 14735 states and 44821 transitions. Second operand 12 states. [2019-12-18 18:53:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:53:14,006 INFO L93 Difference]: Finished difference Result 23016 states and 69828 transitions. [2019-12-18 18:53:14,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 18:53:14,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-18 18:53:14,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:53:14,039 INFO L225 Difference]: With dead ends: 23016 [2019-12-18 18:53:14,039 INFO L226 Difference]: Without dead ends: 22740 [2019-12-18 18:53:14,040 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-18 18:53:14,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22740 states. [2019-12-18 18:53:14,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22740 to 14589. [2019-12-18 18:53:14,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14589 states. [2019-12-18 18:53:14,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14589 states to 14589 states and 44479 transitions. [2019-12-18 18:53:14,303 INFO L78 Accepts]: Start accepts. Automaton has 14589 states and 44479 transitions. Word has length 55 [2019-12-18 18:53:14,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:53:14,304 INFO L462 AbstractCegarLoop]: Abstraction has 14589 states and 44479 transitions. [2019-12-18 18:53:14,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 18:53:14,304 INFO L276 IsEmpty]: Start isEmpty. Operand 14589 states and 44479 transitions. [2019-12-18 18:53:14,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:53:14,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:53:14,321 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-18 18:53:14,321 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-18 18:53:14,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:53:14,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 2 times [2019-12-18 18:53:14,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:53:14,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469514480] [2019-12-18 18:53:14,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:53:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:53:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:53:14,434 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:53:14,434 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:53:14,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2345~0.base_24|) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2345~0.base_24| 4)) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t2345~0.base_24|) 0) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= (store .cse0 |v_ULTIMATE.start_main_~#t2345~0.base_24| 1) |v_#valid_59|) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2345~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2345~0.base_24|) |v_ULTIMATE.start_main_~#t2345~0.offset_18| 0)) |v_#memory_int_23|) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= 0 |v_ULTIMATE.start_main_~#t2345~0.offset_18|) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ULTIMATE.start_main_~#t2345~0.offset=|v_ULTIMATE.start_main_~#t2345~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t2347~0.base=|v_ULTIMATE.start_main_~#t2347~0.base_26|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_~#t2346~0.offset=|v_ULTIMATE.start_main_~#t2346~0.offset_19|, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_~#t2346~0.base=|v_ULTIMATE.start_main_~#t2346~0.base_26|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ULTIMATE.start_main_~#t2345~0.base=|v_ULTIMATE.start_main_~#t2345~0.base_24|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t2347~0.offset=|v_ULTIMATE.start_main_~#t2347~0.offset_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #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, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2345~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2347~0.base, 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, ULTIMATE.start_main_~#t2346~0.offset, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_~#t2346~0.base, 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, ULTIMATE.start_main_~#t2345~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2347~0.offset, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 18:53:14,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2346~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2346~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2346~0.offset_11|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2346~0.base_13| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2346~0.base_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2346~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2346~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2346~0.base_13|) |v_ULTIMATE.start_main_~#t2346~0.offset_11| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2346~0.offset=|v_ULTIMATE.start_main_~#t2346~0.offset_11|, ULTIMATE.start_main_~#t2346~0.base=|v_ULTIMATE.start_main_~#t2346~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2346~0.offset, ULTIMATE.start_main_~#t2346~0.base] because there is no mapped edge [2019-12-18 18:53:14,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2347~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2347~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2347~0.base_13| 0)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2347~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2347~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2347~0.base_13|) |v_ULTIMATE.start_main_~#t2347~0.offset_11| 2)) |v_#memory_int_17|) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2347~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2347~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2347~0.base=|v_ULTIMATE.start_main_~#t2347~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t2347~0.offset=|v_ULTIMATE.start_main_~#t2347~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2347~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2347~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 18:53:14,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= ~x$w_buff1_used~0_Out-515565015 ~x$w_buff0_used~0_In-515565015) (= P1Thread1of1ForFork0_~arg.base_Out-515565015 |P1Thread1of1ForFork0_#in~arg.base_In-515565015|) (= 1 ~x$w_buff0_used~0_Out-515565015) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-515565015| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-515565015) (= |P1Thread1of1ForFork0_#in~arg.offset_In-515565015| P1Thread1of1ForFork0_~arg.offset_Out-515565015) (= ~x$w_buff0~0_Out-515565015 1) (= ~x$w_buff1~0_Out-515565015 ~x$w_buff0~0_In-515565015) (= 0 (mod ~x$w_buff1_used~0_Out-515565015 256)) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-515565015| 1)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-515565015, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-515565015|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-515565015|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-515565015} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-515565015, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-515565015, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-515565015, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-515565015, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-515565015|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-515565015|, ~x$w_buff1~0=~x$w_buff1~0_Out-515565015, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-515565015|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-515565015, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-515565015} 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-18 18:53:14,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1639751730 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1639751730 256)))) (or (and (= ~x~0_In-1639751730 |P2Thread1of1ForFork1_#t~ite32_Out-1639751730|) (or .cse0 .cse1)) (and (not .cse0) (= ~x$w_buff1~0_In-1639751730 |P2Thread1of1ForFork1_#t~ite32_Out-1639751730|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1639751730, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1639751730, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1639751730, ~x~0=~x~0_In-1639751730} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1639751730|, ~x$w_buff1~0=~x$w_buff1~0_In-1639751730, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1639751730, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1639751730, ~x~0=~x~0_In-1639751730} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 18:53:14,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_29|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 18:53:14,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1607610860 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1607610860 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out-1607610860| ~x$w_buff0_used~0_In-1607610860) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out-1607610860| 0) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1607610860, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1607610860} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1607610860|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1607610860, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1607610860} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 18:53:14,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1511362707 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1511362707 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-1511362707| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-1511362707| ~x$w_buff0_used~0_In-1511362707)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1511362707, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1511362707} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1511362707, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1511362707|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1511362707} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 18:53:14,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1642289596 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1642289596 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1642289596 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1642289596 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1642289596 |P1Thread1of1ForFork0_#t~ite29_Out1642289596|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out1642289596|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1642289596, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1642289596, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1642289596, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1642289596} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1642289596, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1642289596, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1642289596, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1642289596|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1642289596} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 18:53:14,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-432290772 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-432290772 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out-432290772 0)) (and (= ~x$r_buff0_thd2~0_Out-432290772 ~x$r_buff0_thd2~0_In-432290772) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-432290772, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-432290772} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-432290772|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-432290772, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-432290772} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 18:53:14,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1256877078 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1256877078 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1256877078 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1256877078 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-1256877078| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite31_Out-1256877078| ~x$r_buff1_thd2~0_In-1256877078) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1256877078, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1256877078, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1256877078, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1256877078} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1256877078|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1256877078, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1256877078, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1256877078, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1256877078} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 18:53:14,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, 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-18 18:53:14,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1846857814 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite11_Out-1846857814| ~x$w_buff1~0_In-1846857814) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1846857814 256)))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In-1846857814 256)) .cse0) (= (mod ~x$w_buff0_used~0_In-1846857814 256) 0) (and (= (mod ~x$w_buff1_used~0_In-1846857814 256) 0) .cse0))) .cse1 (= |P0Thread1of1ForFork2_#t~ite11_Out-1846857814| |P0Thread1of1ForFork2_#t~ite12_Out-1846857814|)) (and (= |P0Thread1of1ForFork2_#t~ite11_In-1846857814| |P0Thread1of1ForFork2_#t~ite11_Out-1846857814|) (= ~x$w_buff1~0_In-1846857814 |P0Thread1of1ForFork2_#t~ite12_Out-1846857814|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1846857814, ~x$w_buff1~0=~x$w_buff1~0_In-1846857814, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1846857814, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1846857814, ~weak$$choice2~0=~weak$$choice2~0_In-1846857814, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1846857814|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1846857814} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1846857814, ~x$w_buff1~0=~x$w_buff1~0_In-1846857814, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1846857814, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1846857814, ~weak$$choice2~0=~weak$$choice2~0_In-1846857814, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1846857814|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1846857814|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1846857814} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 18:53:14,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In89069912 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite15_Out89069912| ~x$w_buff0_used~0_In89069912) (= |P0Thread1of1ForFork2_#t~ite14_In89069912| |P0Thread1of1ForFork2_#t~ite14_Out89069912|)) (and (= |P0Thread1of1ForFork2_#t~ite15_Out89069912| |P0Thread1of1ForFork2_#t~ite14_Out89069912|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In89069912 256)))) (or (= (mod ~x$w_buff0_used~0_In89069912 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In89069912 256))) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In89069912 256))))) .cse0 (= |P0Thread1of1ForFork2_#t~ite14_Out89069912| ~x$w_buff0_used~0_In89069912)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In89069912, ~x$w_buff1_used~0=~x$w_buff1_used~0_In89069912, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In89069912, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In89069912|, ~weak$$choice2~0=~weak$$choice2~0_In89069912, ~x$w_buff0_used~0=~x$w_buff0_used~0_In89069912} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In89069912, ~x$w_buff1_used~0=~x$w_buff1_used~0_In89069912, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out89069912|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In89069912, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out89069912|, ~weak$$choice2~0=~weak$$choice2~0_In89069912, ~x$w_buff0_used~0=~x$w_buff0_used~0_In89069912} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 18:53:14,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1175764565 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_Out1175764565| |P0Thread1of1ForFork2_#t~ite18_Out1175764565|) .cse0 (= |P0Thread1of1ForFork2_#t~ite17_Out1175764565| ~x$w_buff1_used~0_In1175764565) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1175764565 256) 0))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In1175764565 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In1175764565 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1175764565 256)))))) (and (= |P0Thread1of1ForFork2_#t~ite18_Out1175764565| ~x$w_buff1_used~0_In1175764565) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In1175764565| |P0Thread1of1ForFork2_#t~ite17_Out1175764565|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1175764565, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1175764565|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1175764565, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1175764565, ~weak$$choice2~0=~weak$$choice2~0_In1175764565, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1175764565} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1175764565, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1175764565|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1175764565|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1175764565, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1175764565, ~weak$$choice2~0=~weak$$choice2~0_In1175764565, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1175764565} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 18:53:14,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite23_39| |v_P0Thread1of1ForFork2_#t~ite23_40|) (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_35|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (not (= 0 (mod v_~weak$$choice2~0_142 256))) (= |v_P0Thread1of1ForFork2_#t~ite22_36| |v_P0Thread1of1ForFork2_#t~ite22_35|)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_40|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_36|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_35|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_39|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_35|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 18:53:14,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 18:53:14,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd3~0_In-1193496601 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1193496601 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1193496601 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-1193496601 256) 0))) (or (and (= ~x$w_buff1_used~0_In-1193496601 |P2Thread1of1ForFork1_#t~ite35_Out-1193496601|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-1193496601|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1193496601, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1193496601, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1193496601, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1193496601} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1193496601|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1193496601, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1193496601, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1193496601, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1193496601} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 18:53:14,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In1904603213 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1904603213 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out1904603213| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out1904603213| ~x$r_buff0_thd3~0_In1904603213) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1904603213, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1904603213} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1904603213|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1904603213, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1904603213} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 18:53:14,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-1092195200 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-1092195200 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1092195200 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1092195200 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-1092195200|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite37_Out-1092195200| ~x$r_buff1_thd3~0_In-1092195200)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1092195200, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1092195200, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1092195200, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1092195200} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1092195200|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1092195200, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1092195200, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1092195200, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1092195200} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 18:53:14,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_40|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_39|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, 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-18 18:53:14,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= 3 v_~__unbuffered_cnt~0_39) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 18:53:14,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-1685566468 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1685566468 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In-1685566468 |ULTIMATE.start_main_#t~ite41_Out-1685566468|)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1685566468 |ULTIMATE.start_main_#t~ite41_Out-1685566468|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1685566468, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1685566468, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1685566468, ~x~0=~x~0_In-1685566468} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1685566468|, ~x$w_buff1~0=~x$w_buff1~0_In-1685566468, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1685566468, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1685566468, ~x~0=~x~0_In-1685566468} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 18:53:14,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 18:53:14,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In427396738 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In427396738 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out427396738|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out427396738| ~x$w_buff0_used~0_In427396738) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In427396738, ~x$w_buff0_used~0=~x$w_buff0_used~0_In427396738} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In427396738, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out427396738|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In427396738} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 18:53:14,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In693765291 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In693765291 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In693765291 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In693765291 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out693765291|)) (and (= ~x$w_buff1_used~0_In693765291 |ULTIMATE.start_main_#t~ite44_Out693765291|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In693765291, ~x$w_buff1_used~0=~x$w_buff1_used~0_In693765291, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In693765291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In693765291} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In693765291, ~x$w_buff1_used~0=~x$w_buff1_used~0_In693765291, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In693765291, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out693765291|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In693765291} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 18:53:14,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-913625881 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-913625881 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-913625881| ~x$r_buff0_thd0~0_In-913625881) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-913625881| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-913625881, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-913625881} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-913625881, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-913625881|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-913625881} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 18:53:14,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-420885224 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-420885224 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-420885224 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-420885224 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In-420885224 |ULTIMATE.start_main_#t~ite46_Out-420885224|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-420885224|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-420885224, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-420885224, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-420885224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-420885224} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-420885224, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-420885224|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-420885224, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-420885224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-420885224} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 18:53:14,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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-18 18:53:14,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:53:14 BasicIcfg [2019-12-18 18:53:14,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:53:14,603 INFO L168 Benchmark]: Toolchain (without parser) took 75401.37 ms. Allocated memory was 146.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 102.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 18:53:14,603 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 18:53:14,604 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.07 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.7 MB in the beginning and 159.5 MB in the end (delta: -56.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 18:53:14,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.19 ms. Allocated memory is still 204.5 MB. Free memory was 159.5 MB in the beginning and 156.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:53:14,605 INFO L168 Benchmark]: Boogie Preprocessor took 37.44 ms. Allocated memory is still 204.5 MB. Free memory was 156.9 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:53:14,605 INFO L168 Benchmark]: RCFGBuilder took 812.69 ms. Allocated memory is still 204.5 MB. Free memory was 154.3 MB in the beginning and 107.9 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-12-18 18:53:14,608 INFO L168 Benchmark]: TraceAbstraction took 73659.57 ms. Allocated memory was 204.5 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 107.2 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 18:53:14,613 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 808.07 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.7 MB in the beginning and 159.5 MB in the end (delta: -56.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.19 ms. Allocated memory is still 204.5 MB. Free memory was 159.5 MB in the beginning and 156.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.44 ms. Allocated memory is still 204.5 MB. Free memory was 156.9 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 812.69 ms. Allocated memory is still 204.5 MB. Free memory was 154.3 MB in the beginning and 107.9 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 73659.57 ms. Allocated memory was 204.5 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 107.2 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2345, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2346, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, 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 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, 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] [L824] FCALL, FORK 0 pthread_create(&t2347, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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] [L732] 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_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=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=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)=0, __unbuffered_cnt=0, __unbuffered_p0_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=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [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 [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_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=8, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [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] 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)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [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_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=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 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 [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 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_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=8, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 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 [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 73.3s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 24.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4649 SDtfs, 5642 SDslu, 16178 SDs, 0 SdLazy, 8215 SolverSat, 236 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 56 SyntacticMatches, 17 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 26.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 144226 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 988 NumberOfCodeBlocks, 988 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 911 ConstructedInterpolants, 0 QuantifiedInterpolants, 166101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...