/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:36:19,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:36:19,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:36:19,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:36:19,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:36:19,891 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:36:19,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:36:19,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:36:19,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:36:19,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:36:19,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:36:19,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:36:19,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:36:19,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:36:19,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:36:19,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:36:19,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:36:19,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:36:19,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:36:19,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:36:19,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:36:19,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:36:19,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:36:19,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:36:19,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:36:19,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:36:19,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:36:19,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:36:19,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:36:19,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:36:19,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:36:19,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:36:19,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:36:19,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:36:19,943 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:36:19,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:36:19,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:36:19,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:36:19,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:36:19,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:36:19,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:36:19,950 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:36:19,966 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:36:19,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:36:19,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:36:19,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:36:19,968 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:36:19,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:36:19,969 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:36:19,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:36:19,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:36:19,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:36:19,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:36:19,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:36:19,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:36:19,970 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:36:19,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:36:19,971 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:36:19,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:36:19,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:36:19,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:36:19,971 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:36:19,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:36:19,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:36:19,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:36:19,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:36:19,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:36:19,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:36:19,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:36:19,973 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:36:19,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:36:19,973 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:36:20,277 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:36:20,299 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:36:20,304 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:36:20,305 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:36:20,305 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:36:20,306 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2019-12-27 07:36:20,367 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/641ec42cf/e59c30aeb4c84a959b66329e09873af8/FLAG6c7ecd329 [2019-12-27 07:36:20,937 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:36:20,937 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2019-12-27 07:36:20,952 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/641ec42cf/e59c30aeb4c84a959b66329e09873af8/FLAG6c7ecd329 [2019-12-27 07:36:21,235 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/641ec42cf/e59c30aeb4c84a959b66329e09873af8 [2019-12-27 07:36:21,245 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:36:21,248 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:36:21,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:36:21,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:36:21,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:36:21,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:36:21" (1/1) ... [2019-12-27 07:36:21,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2717e766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:21, skipping insertion in model container [2019-12-27 07:36:21,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:36:21" (1/1) ... [2019-12-27 07:36:21,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:36:21,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:36:21,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:36:21,807 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:36:21,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:36:22,009 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:36:22,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:22 WrapperNode [2019-12-27 07:36:22,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:36:22,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:36:22,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:36:22,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:36:22,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:22" (1/1) ... [2019-12-27 07:36:22,043 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:22" (1/1) ... [2019-12-27 07:36:22,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:36:22,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:36:22,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:36:22,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:36:22,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:22" (1/1) ... [2019-12-27 07:36:22,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:22" (1/1) ... [2019-12-27 07:36:22,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:22" (1/1) ... [2019-12-27 07:36:22,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:22" (1/1) ... [2019-12-27 07:36:22,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:22" (1/1) ... [2019-12-27 07:36:22,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:22" (1/1) ... [2019-12-27 07:36:22,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:22" (1/1) ... [2019-12-27 07:36:22,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:36:22,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:36:22,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:36:22,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:36:22,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:36:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:36:22,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:36:22,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:36:22,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:36:22,182 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:36:22,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:36:22,182 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:36:22,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:36:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:36:22,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:36:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:36:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:36:22,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:36:22,186 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:36:22,954 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:36:22,955 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:36:22,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:36:22 BoogieIcfgContainer [2019-12-27 07:36:22,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:36:22,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:36:22,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:36:22,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:36:22,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:36:21" (1/3) ... [2019-12-27 07:36:22,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547a8e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:36:22, skipping insertion in model container [2019-12-27 07:36:22,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:22" (2/3) ... [2019-12-27 07:36:22,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547a8e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:36:22, skipping insertion in model container [2019-12-27 07:36:22,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:36:22" (3/3) ... [2019-12-27 07:36:22,971 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_pso.oepc.i [2019-12-27 07:36:22,982 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:36:22,982 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:36:22,992 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:36:22,993 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:36:23,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,034 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,034 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,034 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,035 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,035 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,044 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,044 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,081 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,081 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,092 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,093 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,093 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,096 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,096 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,100 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,100 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:23,117 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:36:23,139 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:36:23,139 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:36:23,140 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:36:23,140 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:36:23,140 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:36:23,140 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:36:23,140 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:36:23,140 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:36:23,158 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 07:36:23,160 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 07:36:23,276 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 07:36:23,276 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:36:23,295 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:36:23,318 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 07:36:23,401 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 07:36:23,401 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:36:23,409 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:36:23,429 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 07:36:23,430 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:36:26,661 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 07:36:26,784 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 07:36:26,807 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81758 [2019-12-27 07:36:26,807 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 07:36:26,811 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 109 transitions [2019-12-27 07:36:45,860 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 117812 states. [2019-12-27 07:36:45,862 INFO L276 IsEmpty]: Start isEmpty. Operand 117812 states. [2019-12-27 07:36:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:36:45,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:45,868 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:36:45,868 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:45,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:45,873 INFO L82 PathProgramCache]: Analyzing trace with hash 839664, now seen corresponding path program 1 times [2019-12-27 07:36:45,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:45,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214584630] [2019-12-27 07:36:45,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:46,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:36:46,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214584630] [2019-12-27 07:36:46,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:46,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:36:46,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541853401] [2019-12-27 07:36:46,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:36:46,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:46,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:36:46,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:36:46,162 INFO L87 Difference]: Start difference. First operand 117812 states. Second operand 3 states. [2019-12-27 07:36:50,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:50,069 INFO L93 Difference]: Finished difference Result 117510 states and 507540 transitions. [2019-12-27 07:36:50,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:36:50,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:36:50,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:50,875 INFO L225 Difference]: With dead ends: 117510 [2019-12-27 07:36:50,876 INFO L226 Difference]: Without dead ends: 115144 [2019-12-27 07:36:50,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:36:54,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115144 states. [2019-12-27 07:36:57,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115144 to 115144. [2019-12-27 07:36:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115144 states. [2019-12-27 07:37:01,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115144 states to 115144 states and 497894 transitions. [2019-12-27 07:37:01,094 INFO L78 Accepts]: Start accepts. Automaton has 115144 states and 497894 transitions. Word has length 3 [2019-12-27 07:37:01,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:01,094 INFO L462 AbstractCegarLoop]: Abstraction has 115144 states and 497894 transitions. [2019-12-27 07:37:01,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:37:01,094 INFO L276 IsEmpty]: Start isEmpty. Operand 115144 states and 497894 transitions. [2019-12-27 07:37:01,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:37:01,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:01,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:01,102 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:01,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:01,102 INFO L82 PathProgramCache]: Analyzing trace with hash -79799111, now seen corresponding path program 1 times [2019-12-27 07:37:01,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:01,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585449692] [2019-12-27 07:37:01,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:01,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585449692] [2019-12-27 07:37:01,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:01,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:37:01,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477530733] [2019-12-27 07:37:01,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:37:01,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:01,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:37:01,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:37:01,229 INFO L87 Difference]: Start difference. First operand 115144 states and 497894 transitions. Second operand 4 states. [2019-12-27 07:37:06,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:06,884 INFO L93 Difference]: Finished difference Result 185114 states and 767412 transitions. [2019-12-27 07:37:06,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:37:06,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:37:06,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:07,832 INFO L225 Difference]: With dead ends: 185114 [2019-12-27 07:37:07,832 INFO L226 Difference]: Without dead ends: 185065 [2019-12-27 07:37:07,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:37:12,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185065 states. [2019-12-27 07:37:16,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185065 to 169989. [2019-12-27 07:37:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169989 states. [2019-12-27 07:37:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169989 states to 169989 states and 713980 transitions. [2019-12-27 07:37:17,357 INFO L78 Accepts]: Start accepts. Automaton has 169989 states and 713980 transitions. Word has length 11 [2019-12-27 07:37:17,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:17,358 INFO L462 AbstractCegarLoop]: Abstraction has 169989 states and 713980 transitions. [2019-12-27 07:37:17,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:37:17,358 INFO L276 IsEmpty]: Start isEmpty. Operand 169989 states and 713980 transitions. [2019-12-27 07:37:17,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:37:17,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:17,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:17,365 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:17,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:17,366 INFO L82 PathProgramCache]: Analyzing trace with hash -676042940, now seen corresponding path program 1 times [2019-12-27 07:37:17,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:17,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658973183] [2019-12-27 07:37:17,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:17,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:17,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658973183] [2019-12-27 07:37:17,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:17,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:37:17,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693751856] [2019-12-27 07:37:17,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:37:17,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:17,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:37:17,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:37:17,446 INFO L87 Difference]: Start difference. First operand 169989 states and 713980 transitions. Second operand 4 states. [2019-12-27 07:37:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:24,533 INFO L93 Difference]: Finished difference Result 241878 states and 992054 transitions. [2019-12-27 07:37:24,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:37:24,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:37:24,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:26,035 INFO L225 Difference]: With dead ends: 241878 [2019-12-27 07:37:26,035 INFO L226 Difference]: Without dead ends: 241815 [2019-12-27 07:37:26,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:37:31,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241815 states. [2019-12-27 07:37:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241815 to 205075. [2019-12-27 07:37:40,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205075 states. [2019-12-27 07:37:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205075 states to 205075 states and 855408 transitions. [2019-12-27 07:37:41,158 INFO L78 Accepts]: Start accepts. Automaton has 205075 states and 855408 transitions. Word has length 13 [2019-12-27 07:37:41,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:41,158 INFO L462 AbstractCegarLoop]: Abstraction has 205075 states and 855408 transitions. [2019-12-27 07:37:41,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:37:41,158 INFO L276 IsEmpty]: Start isEmpty. Operand 205075 states and 855408 transitions. [2019-12-27 07:37:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:37:41,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:41,162 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:41,163 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:41,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:41,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1689712693, now seen corresponding path program 1 times [2019-12-27 07:37:41,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:41,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879620067] [2019-12-27 07:37:41,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:41,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:41,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879620067] [2019-12-27 07:37:41,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:41,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:37:41,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225423107] [2019-12-27 07:37:41,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:37:41,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:41,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:37:41,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:41,236 INFO L87 Difference]: Start difference. First operand 205075 states and 855408 transitions. Second operand 3 states. [2019-12-27 07:37:41,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:41,408 INFO L93 Difference]: Finished difference Result 40406 states and 132180 transitions. [2019-12-27 07:37:41,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:37:41,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 07:37:41,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:41,471 INFO L225 Difference]: With dead ends: 40406 [2019-12-27 07:37:41,471 INFO L226 Difference]: Without dead ends: 40406 [2019-12-27 07:37:41,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:41,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40406 states. [2019-12-27 07:37:43,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40406 to 40406. [2019-12-27 07:37:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40406 states. [2019-12-27 07:37:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40406 states to 40406 states and 132180 transitions. [2019-12-27 07:37:43,677 INFO L78 Accepts]: Start accepts. Automaton has 40406 states and 132180 transitions. Word has length 13 [2019-12-27 07:37:43,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:43,677 INFO L462 AbstractCegarLoop]: Abstraction has 40406 states and 132180 transitions. [2019-12-27 07:37:43,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:37:43,678 INFO L276 IsEmpty]: Start isEmpty. Operand 40406 states and 132180 transitions. [2019-12-27 07:37:43,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 07:37:43,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:43,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:43,683 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:43,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:43,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1531561803, now seen corresponding path program 1 times [2019-12-27 07:37:43,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:43,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765586388] [2019-12-27 07:37:43,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:43,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:43,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765586388] [2019-12-27 07:37:43,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:43,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:37:43,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122784695] [2019-12-27 07:37:43,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:37:43,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:43,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:37:43,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:37:43,803 INFO L87 Difference]: Start difference. First operand 40406 states and 132180 transitions. Second operand 5 states. [2019-12-27 07:37:44,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:44,600 INFO L93 Difference]: Finished difference Result 54550 states and 174566 transitions. [2019-12-27 07:37:44,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:37:44,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 07:37:44,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:44,695 INFO L225 Difference]: With dead ends: 54550 [2019-12-27 07:37:44,695 INFO L226 Difference]: Without dead ends: 54537 [2019-12-27 07:37:44,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:37:44,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54537 states. [2019-12-27 07:37:45,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54537 to 40777. [2019-12-27 07:37:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40777 states. [2019-12-27 07:37:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40777 states to 40777 states and 133064 transitions. [2019-12-27 07:37:48,996 INFO L78 Accepts]: Start accepts. Automaton has 40777 states and 133064 transitions. Word has length 19 [2019-12-27 07:37:48,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:48,997 INFO L462 AbstractCegarLoop]: Abstraction has 40777 states and 133064 transitions. [2019-12-27 07:37:48,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:37:48,997 INFO L276 IsEmpty]: Start isEmpty. Operand 40777 states and 133064 transitions. [2019-12-27 07:37:49,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:37:49,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:49,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:49,007 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:49,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:49,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1034032563, now seen corresponding path program 1 times [2019-12-27 07:37:49,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:49,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990266321] [2019-12-27 07:37:49,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:49,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990266321] [2019-12-27 07:37:49,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:49,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:37:49,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631441576] [2019-12-27 07:37:49,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:37:49,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:49,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:37:49,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:37:49,064 INFO L87 Difference]: Start difference. First operand 40777 states and 133064 transitions. Second operand 4 states. [2019-12-27 07:37:49,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:49,105 INFO L93 Difference]: Finished difference Result 7638 states and 20735 transitions. [2019-12-27 07:37:49,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:37:49,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:37:49,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:49,118 INFO L225 Difference]: With dead ends: 7638 [2019-12-27 07:37:49,118 INFO L226 Difference]: Without dead ends: 7638 [2019-12-27 07:37:49,119 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-27 07:37:49,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7638 states. [2019-12-27 07:37:49,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7638 to 7498. [2019-12-27 07:37:49,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7498 states. [2019-12-27 07:37:49,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7498 states to 7498 states and 20363 transitions. [2019-12-27 07:37:49,217 INFO L78 Accepts]: Start accepts. Automaton has 7498 states and 20363 transitions. Word has length 25 [2019-12-27 07:37:49,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:49,217 INFO L462 AbstractCegarLoop]: Abstraction has 7498 states and 20363 transitions. [2019-12-27 07:37:49,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:37:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 7498 states and 20363 transitions. [2019-12-27 07:37:49,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 07:37:49,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:49,228 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] [2019-12-27 07:37:49,228 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:49,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:49,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2065802623, now seen corresponding path program 1 times [2019-12-27 07:37:49,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:49,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756300596] [2019-12-27 07:37:49,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:49,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756300596] [2019-12-27 07:37:49,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:49,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:37:49,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233095572] [2019-12-27 07:37:49,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:37:49,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:49,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:37:49,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:37:49,315 INFO L87 Difference]: Start difference. First operand 7498 states and 20363 transitions. Second operand 5 states. [2019-12-27 07:37:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:49,349 INFO L93 Difference]: Finished difference Result 5405 states and 15353 transitions. [2019-12-27 07:37:49,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:37:49,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 07:37:49,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:49,358 INFO L225 Difference]: With dead ends: 5405 [2019-12-27 07:37:49,358 INFO L226 Difference]: Without dead ends: 5025 [2019-12-27 07:37:49,358 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-27 07:37:49,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2019-12-27 07:37:49,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 4661. [2019-12-27 07:37:49,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2019-12-27 07:37:49,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 13441 transitions. [2019-12-27 07:37:49,428 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 13441 transitions. Word has length 37 [2019-12-27 07:37:49,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:49,428 INFO L462 AbstractCegarLoop]: Abstraction has 4661 states and 13441 transitions. [2019-12-27 07:37:49,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:37:49,428 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 13441 transitions. [2019-12-27 07:37:49,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:37:49,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:49,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:49,436 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:49,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:49,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1806952947, now seen corresponding path program 1 times [2019-12-27 07:37:49,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:49,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249339405] [2019-12-27 07:37:49,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:49,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249339405] [2019-12-27 07:37:49,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:49,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:37:49,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901935180] [2019-12-27 07:37:49,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:37:49,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:49,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:37:49,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:49,520 INFO L87 Difference]: Start difference. First operand 4661 states and 13441 transitions. Second operand 3 states. [2019-12-27 07:37:49,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:49,577 INFO L93 Difference]: Finished difference Result 4670 states and 13455 transitions. [2019-12-27 07:37:49,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:37:49,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:37:49,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:49,585 INFO L225 Difference]: With dead ends: 4670 [2019-12-27 07:37:49,586 INFO L226 Difference]: Without dead ends: 4670 [2019-12-27 07:37:49,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:49,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-27 07:37:49,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-27 07:37:49,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-27 07:37:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13451 transitions. [2019-12-27 07:37:49,698 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13451 transitions. Word has length 65 [2019-12-27 07:37:49,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:49,699 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13451 transitions. [2019-12-27 07:37:49,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:37:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13451 transitions. [2019-12-27 07:37:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:37:49,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:49,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:49,710 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:49,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:49,711 INFO L82 PathProgramCache]: Analyzing trace with hash -736030129, now seen corresponding path program 1 times [2019-12-27 07:37:49,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:49,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578615390] [2019-12-27 07:37:49,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:49,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:49,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578615390] [2019-12-27 07:37:49,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:49,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:37:49,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537296151] [2019-12-27 07:37:49,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:37:49,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:49,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:37:49,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:49,780 INFO L87 Difference]: Start difference. First operand 4666 states and 13451 transitions. Second operand 3 states. [2019-12-27 07:37:49,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:49,833 INFO L93 Difference]: Finished difference Result 4670 states and 13445 transitions. [2019-12-27 07:37:49,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:37:49,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:37:49,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:49,840 INFO L225 Difference]: With dead ends: 4670 [2019-12-27 07:37:49,840 INFO L226 Difference]: Without dead ends: 4670 [2019-12-27 07:37:49,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-27 07:37:49,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-27 07:37:49,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-27 07:37:49,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13441 transitions. [2019-12-27 07:37:49,920 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13441 transitions. Word has length 65 [2019-12-27 07:37:49,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:49,921 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13441 transitions. [2019-12-27 07:37:49,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:37:49,921 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13441 transitions. [2019-12-27 07:37:49,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:37:49,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:49,927 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:49,928 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:49,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:49,928 INFO L82 PathProgramCache]: Analyzing trace with hash -743654703, now seen corresponding path program 1 times [2019-12-27 07:37:49,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:49,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818615649] [2019-12-27 07:37:49,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:50,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:50,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818615649] [2019-12-27 07:37:50,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:50,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:37:50,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517613145] [2019-12-27 07:37:50,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:37:50,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:50,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:37:50,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:37:50,049 INFO L87 Difference]: Start difference. First operand 4666 states and 13441 transitions. Second operand 5 states. [2019-12-27 07:37:50,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:50,373 INFO L93 Difference]: Finished difference Result 7090 states and 20230 transitions. [2019-12-27 07:37:50,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:37:50,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 07:37:50,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:50,385 INFO L225 Difference]: With dead ends: 7090 [2019-12-27 07:37:50,385 INFO L226 Difference]: Without dead ends: 7090 [2019-12-27 07:37:50,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:37:50,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7090 states. [2019-12-27 07:37:50,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7090 to 5981. [2019-12-27 07:37:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5981 states. [2019-12-27 07:37:50,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5981 states to 5981 states and 17235 transitions. [2019-12-27 07:37:50,515 INFO L78 Accepts]: Start accepts. Automaton has 5981 states and 17235 transitions. Word has length 65 [2019-12-27 07:37:50,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:50,515 INFO L462 AbstractCegarLoop]: Abstraction has 5981 states and 17235 transitions. [2019-12-27 07:37:50,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:37:50,515 INFO L276 IsEmpty]: Start isEmpty. Operand 5981 states and 17235 transitions. [2019-12-27 07:37:50,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:37:50,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:50,527 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:50,527 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:50,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:50,527 INFO L82 PathProgramCache]: Analyzing trace with hash 326503145, now seen corresponding path program 2 times [2019-12-27 07:37:50,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:50,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057034817] [2019-12-27 07:37:50,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:50,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:50,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057034817] [2019-12-27 07:37:50,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:50,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:37:50,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810249632] [2019-12-27 07:37:50,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:37:50,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:50,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:37:50,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:37:50,654 INFO L87 Difference]: Start difference. First operand 5981 states and 17235 transitions. Second operand 5 states. [2019-12-27 07:37:50,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:50,979 INFO L93 Difference]: Finished difference Result 9069 states and 25840 transitions. [2019-12-27 07:37:50,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:37:50,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 07:37:50,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:50,996 INFO L225 Difference]: With dead ends: 9069 [2019-12-27 07:37:50,996 INFO L226 Difference]: Without dead ends: 9069 [2019-12-27 07:37:50,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:37:51,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9069 states. [2019-12-27 07:37:51,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9069 to 6733. [2019-12-27 07:37:51,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6733 states. [2019-12-27 07:37:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6733 states to 6733 states and 19502 transitions. [2019-12-27 07:37:51,151 INFO L78 Accepts]: Start accepts. Automaton has 6733 states and 19502 transitions. Word has length 65 [2019-12-27 07:37:51,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:51,151 INFO L462 AbstractCegarLoop]: Abstraction has 6733 states and 19502 transitions. [2019-12-27 07:37:51,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:37:51,151 INFO L276 IsEmpty]: Start isEmpty. Operand 6733 states and 19502 transitions. [2019-12-27 07:37:51,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:37:51,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:51,164 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:51,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:51,164 INFO L82 PathProgramCache]: Analyzing trace with hash 737396099, now seen corresponding path program 3 times [2019-12-27 07:37:51,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:51,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208229086] [2019-12-27 07:37:51,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:51,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208229086] [2019-12-27 07:37:51,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:51,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:37:51,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970764817] [2019-12-27 07:37:51,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:37:51,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:51,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:37:51,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:37:51,251 INFO L87 Difference]: Start difference. First operand 6733 states and 19502 transitions. Second operand 6 states. [2019-12-27 07:37:51,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:51,851 INFO L93 Difference]: Finished difference Result 10887 states and 31295 transitions. [2019-12-27 07:37:51,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:37:51,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 07:37:51,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:51,868 INFO L225 Difference]: With dead ends: 10887 [2019-12-27 07:37:51,868 INFO L226 Difference]: Without dead ends: 10887 [2019-12-27 07:37:51,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:37:51,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2019-12-27 07:37:52,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 7256. [2019-12-27 07:37:52,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7256 states. [2019-12-27 07:37:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7256 states to 7256 states and 21081 transitions. [2019-12-27 07:37:52,058 INFO L78 Accepts]: Start accepts. Automaton has 7256 states and 21081 transitions. Word has length 65 [2019-12-27 07:37:52,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:52,058 INFO L462 AbstractCegarLoop]: Abstraction has 7256 states and 21081 transitions. [2019-12-27 07:37:52,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:37:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 7256 states and 21081 transitions. [2019-12-27 07:37:52,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:37:52,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:52,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:52,156 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:52,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:52,157 INFO L82 PathProgramCache]: Analyzing trace with hash 156309423, now seen corresponding path program 4 times [2019-12-27 07:37:52,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:52,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19578010] [2019-12-27 07:37:52,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:52,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:52,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19578010] [2019-12-27 07:37:52,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:52,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:37:52,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358556620] [2019-12-27 07:37:52,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:37:52,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:52,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:37:52,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:52,296 INFO L87 Difference]: Start difference. First operand 7256 states and 21081 transitions. Second operand 3 states. [2019-12-27 07:37:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:52,363 INFO L93 Difference]: Finished difference Result 7256 states and 21080 transitions. [2019-12-27 07:37:52,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:37:52,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:37:52,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:52,374 INFO L225 Difference]: With dead ends: 7256 [2019-12-27 07:37:52,375 INFO L226 Difference]: Without dead ends: 7256 [2019-12-27 07:37:52,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:52,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7256 states. [2019-12-27 07:37:52,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7256 to 4657. [2019-12-27 07:37:52,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4657 states. [2019-12-27 07:37:52,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4657 states to 4657 states and 13801 transitions. [2019-12-27 07:37:52,461 INFO L78 Accepts]: Start accepts. Automaton has 4657 states and 13801 transitions. Word has length 65 [2019-12-27 07:37:52,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:52,461 INFO L462 AbstractCegarLoop]: Abstraction has 4657 states and 13801 transitions. [2019-12-27 07:37:52,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:37:52,462 INFO L276 IsEmpty]: Start isEmpty. Operand 4657 states and 13801 transitions. [2019-12-27 07:37:52,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:37:52,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:52,468 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:52,468 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:52,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:52,468 INFO L82 PathProgramCache]: Analyzing trace with hash 939416227, now seen corresponding path program 1 times [2019-12-27 07:37:52,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:52,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846441639] [2019-12-27 07:37:52,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:52,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846441639] [2019-12-27 07:37:52,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:52,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:37:52,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951157968] [2019-12-27 07:37:52,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:37:52,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:52,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:37:52,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:52,527 INFO L87 Difference]: Start difference. First operand 4657 states and 13801 transitions. Second operand 3 states. [2019-12-27 07:37:52,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:52,553 INFO L93 Difference]: Finished difference Result 4277 states and 12382 transitions. [2019-12-27 07:37:52,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:37:52,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 07:37:52,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:52,561 INFO L225 Difference]: With dead ends: 4277 [2019-12-27 07:37:52,561 INFO L226 Difference]: Without dead ends: 4277 [2019-12-27 07:37:52,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:52,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4277 states. [2019-12-27 07:37:52,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4277 to 3561. [2019-12-27 07:37:52,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3561 states. [2019-12-27 07:37:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3561 states to 3561 states and 10350 transitions. [2019-12-27 07:37:52,647 INFO L78 Accepts]: Start accepts. Automaton has 3561 states and 10350 transitions. Word has length 66 [2019-12-27 07:37:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:52,647 INFO L462 AbstractCegarLoop]: Abstraction has 3561 states and 10350 transitions. [2019-12-27 07:37:52,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:37:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3561 states and 10350 transitions. [2019-12-27 07:37:52,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:37:52,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:52,655 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:52,656 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:52,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:52,656 INFO L82 PathProgramCache]: Analyzing trace with hash -9053315, now seen corresponding path program 1 times [2019-12-27 07:37:52,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:52,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309522411] [2019-12-27 07:37:52,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:52,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:52,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309522411] [2019-12-27 07:37:52,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:52,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:37:52,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054851954] [2019-12-27 07:37:52,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:37:52,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:52,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:37:52,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:37:52,795 INFO L87 Difference]: Start difference. First operand 3561 states and 10350 transitions. Second operand 6 states. [2019-12-27 07:37:53,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:53,339 INFO L93 Difference]: Finished difference Result 6091 states and 17309 transitions. [2019-12-27 07:37:53,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:37:53,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 07:37:53,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:53,350 INFO L225 Difference]: With dead ends: 6091 [2019-12-27 07:37:53,350 INFO L226 Difference]: Without dead ends: 6091 [2019-12-27 07:37:53,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:37:53,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6091 states. [2019-12-27 07:37:53,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6091 to 3561. [2019-12-27 07:37:53,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3561 states. [2019-12-27 07:37:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3561 states to 3561 states and 10350 transitions. [2019-12-27 07:37:53,461 INFO L78 Accepts]: Start accepts. Automaton has 3561 states and 10350 transitions. Word has length 67 [2019-12-27 07:37:53,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:53,462 INFO L462 AbstractCegarLoop]: Abstraction has 3561 states and 10350 transitions. [2019-12-27 07:37:53,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:37:53,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3561 states and 10350 transitions. [2019-12-27 07:37:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:37:53,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:53,470 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:53,470 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:53,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:53,471 INFO L82 PathProgramCache]: Analyzing trace with hash -631043911, now seen corresponding path program 2 times [2019-12-27 07:37:53,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:53,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976534334] [2019-12-27 07:37:53,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:53,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976534334] [2019-12-27 07:37:53,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:53,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:37:53,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866889826] [2019-12-27 07:37:53,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:37:53,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:53,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:37:53,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:53,574 INFO L87 Difference]: Start difference. First operand 3561 states and 10350 transitions. Second operand 3 states. [2019-12-27 07:37:53,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:53,598 INFO L93 Difference]: Finished difference Result 3385 states and 9561 transitions. [2019-12-27 07:37:53,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:37:53,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 07:37:53,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:53,604 INFO L225 Difference]: With dead ends: 3385 [2019-12-27 07:37:53,604 INFO L226 Difference]: Without dead ends: 3385 [2019-12-27 07:37:53,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:53,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2019-12-27 07:37:53,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 2989. [2019-12-27 07:37:53,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-12-27 07:37:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 8455 transitions. [2019-12-27 07:37:53,675 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 8455 transitions. Word has length 67 [2019-12-27 07:37:53,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:53,676 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 8455 transitions. [2019-12-27 07:37:53,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:37:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 8455 transitions. [2019-12-27 07:37:53,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:37:53,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:53,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:53,685 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:53,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:53,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1113013633, now seen corresponding path program 1 times [2019-12-27 07:37:53,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:53,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109756608] [2019-12-27 07:37:53,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:53,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:53,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109756608] [2019-12-27 07:37:53,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:53,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:37:53,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186695353] [2019-12-27 07:37:53,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:37:53,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:53,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:37:53,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:37:53,807 INFO L87 Difference]: Start difference. First operand 2989 states and 8455 transitions. Second operand 6 states. [2019-12-27 07:37:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:53,875 INFO L93 Difference]: Finished difference Result 5222 states and 14730 transitions. [2019-12-27 07:37:53,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:37:53,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 07:37:53,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:53,880 INFO L225 Difference]: With dead ends: 5222 [2019-12-27 07:37:53,880 INFO L226 Difference]: Without dead ends: 2817 [2019-12-27 07:37:53,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:37:53,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2019-12-27 07:37:53,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2817. [2019-12-27 07:37:53,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2019-12-27 07:37:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 7940 transitions. [2019-12-27 07:37:53,924 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 7940 transitions. Word has length 68 [2019-12-27 07:37:53,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:53,924 INFO L462 AbstractCegarLoop]: Abstraction has 2817 states and 7940 transitions. [2019-12-27 07:37:53,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:37:53,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 7940 transitions. [2019-12-27 07:37:53,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:37:53,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:53,928 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:53,928 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:53,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:53,928 INFO L82 PathProgramCache]: Analyzing trace with hash -539233385, now seen corresponding path program 2 times [2019-12-27 07:37:53,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:53,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186425927] [2019-12-27 07:37:53,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:54,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:54,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186425927] [2019-12-27 07:37:54,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:54,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 07:37:54,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926837213] [2019-12-27 07:37:54,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 07:37:54,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:54,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 07:37:54,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-12-27 07:37:54,647 INFO L87 Difference]: Start difference. First operand 2817 states and 7940 transitions. Second operand 20 states. [2019-12-27 07:37:58,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:58,605 INFO L93 Difference]: Finished difference Result 9050 states and 25658 transitions. [2019-12-27 07:37:58,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 07:37:58,605 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2019-12-27 07:37:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:58,619 INFO L225 Difference]: With dead ends: 9050 [2019-12-27 07:37:58,619 INFO L226 Difference]: Without dead ends: 9018 [2019-12-27 07:37:58,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=673, Invalid=3749, Unknown=0, NotChecked=0, Total=4422 [2019-12-27 07:37:58,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9018 states. [2019-12-27 07:37:58,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9018 to 4420. [2019-12-27 07:37:58,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4420 states. [2019-12-27 07:37:58,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4420 states to 4420 states and 12367 transitions. [2019-12-27 07:37:58,715 INFO L78 Accepts]: Start accepts. Automaton has 4420 states and 12367 transitions. Word has length 68 [2019-12-27 07:37:58,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:58,715 INFO L462 AbstractCegarLoop]: Abstraction has 4420 states and 12367 transitions. [2019-12-27 07:37:58,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 07:37:58,715 INFO L276 IsEmpty]: Start isEmpty. Operand 4420 states and 12367 transitions. [2019-12-27 07:37:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:37:58,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:58,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:58,720 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:58,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:58,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1581706345, now seen corresponding path program 3 times [2019-12-27 07:37:58,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:58,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804877906] [2019-12-27 07:37:58,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:59,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804877906] [2019-12-27 07:37:59,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:59,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 07:37:59,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216061304] [2019-12-27 07:37:59,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 07:37:59,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:59,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 07:37:59,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-27 07:37:59,215 INFO L87 Difference]: Start difference. First operand 4420 states and 12367 transitions. Second operand 19 states. [2019-12-27 07:38:02,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:38:02,035 INFO L93 Difference]: Finished difference Result 12154 states and 33664 transitions. [2019-12-27 07:38:02,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 07:38:02,036 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-12-27 07:38:02,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:38:02,051 INFO L225 Difference]: With dead ends: 12154 [2019-12-27 07:38:02,052 INFO L226 Difference]: Without dead ends: 12122 [2019-12-27 07:38:02,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=473, Invalid=2719, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 07:38:02,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12122 states. [2019-12-27 07:38:02,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12122 to 4916. [2019-12-27 07:38:02,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4916 states. [2019-12-27 07:38:02,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4916 states to 4916 states and 13776 transitions. [2019-12-27 07:38:02,161 INFO L78 Accepts]: Start accepts. Automaton has 4916 states and 13776 transitions. Word has length 68 [2019-12-27 07:38:02,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:38:02,161 INFO L462 AbstractCegarLoop]: Abstraction has 4916 states and 13776 transitions. [2019-12-27 07:38:02,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 07:38:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand 4916 states and 13776 transitions. [2019-12-27 07:38:02,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:38:02,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:38:02,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:38:02,167 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:38:02,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:38:02,167 INFO L82 PathProgramCache]: Analyzing trace with hash -829527087, now seen corresponding path program 4 times [2019-12-27 07:38:02,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:38:02,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769048836] [2019-12-27 07:38:02,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:38:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:38:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:38:02,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769048836] [2019-12-27 07:38:02,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:38:02,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 07:38:02,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523336045] [2019-12-27 07:38:02,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 07:38:02,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:38:02,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 07:38:02,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-12-27 07:38:02,789 INFO L87 Difference]: Start difference. First operand 4916 states and 13776 transitions. Second operand 20 states. [2019-12-27 07:38:06,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:38:06,773 INFO L93 Difference]: Finished difference Result 13304 states and 37276 transitions. [2019-12-27 07:38:06,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 07:38:06,774 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2019-12-27 07:38:06,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:38:06,792 INFO L225 Difference]: With dead ends: 13304 [2019-12-27 07:38:06,792 INFO L226 Difference]: Without dead ends: 13272 [2019-12-27 07:38:06,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1205 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=698, Invalid=3858, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 07:38:06,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13272 states. [2019-12-27 07:38:06,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13272 to 5151. [2019-12-27 07:38:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5151 states. [2019-12-27 07:38:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5151 states to 5151 states and 14441 transitions. [2019-12-27 07:38:06,902 INFO L78 Accepts]: Start accepts. Automaton has 5151 states and 14441 transitions. Word has length 68 [2019-12-27 07:38:06,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:38:06,902 INFO L462 AbstractCegarLoop]: Abstraction has 5151 states and 14441 transitions. [2019-12-27 07:38:06,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 07:38:06,902 INFO L276 IsEmpty]: Start isEmpty. Operand 5151 states and 14441 transitions. [2019-12-27 07:38:06,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:38:06,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:38:06,907 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:38:06,907 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:38:06,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:38:06,907 INFO L82 PathProgramCache]: Analyzing trace with hash -691349817, now seen corresponding path program 5 times [2019-12-27 07:38:06,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:38:06,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062724467] [2019-12-27 07:38:06,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:38:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:38:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:38:07,020 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:38:07,021 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:38:07,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2031~0.base_21| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2031~0.base_21|) |v_ULTIMATE.start_main_~#t2031~0.offset_17| 0)) |v_#memory_int_21|) (= v_~z$w_buff0_used~0_115 0) (= 0 v_~z$r_buff1_thd0~0_47) (= v_~main$tmp_guard0~0_10 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z~0_28 0) (= v_~z$r_buff0_thd3~0_20 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t2031~0.base_21|) (= 0 v_~z$w_buff0~0_27) (= (store .cse0 |v_ULTIMATE.start_main_~#t2031~0.base_21| 1) |v_#valid_55|) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (< 0 |v_#StackHeapBarrier_19|) (= |v_ULTIMATE.start_main_~#t2031~0.offset_17| 0) (= 0 v_~z$r_buff1_thd2~0_18) (= 0 v_~z$mem_tmp~0_9) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff0_thd1~0_25 0) (= 0 v_~z$flush_delayed~0_14) (= 0 v_~z$w_buff1_used~0_72) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed~0_7 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2031~0.base_21|)) (= |v_#NULL.offset_5| 0) (= v_~__unbuffered_p2_EAX~0_9 0) (= 0 v_~z$r_buff1_thd1~0_19) (= v_~z$r_buff0_thd0~0_77 0) (= v_~x~0_12 0) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~weak$$choice2~0_31) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2031~0.base_21| 4)) (= 0 v_~z$w_buff1~0_26) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 |v_#NULL.base_5|) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ULTIMATE.start_main_~#t2032~0.base=|v_ULTIMATE.start_main_~#t2032~0.base_20|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_77, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start_main_~#t2031~0.offset=|v_ULTIMATE.start_main_~#t2031~0.offset_17|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ~z$flush_delayed~0=v_~z$flush_delayed~0_14, ULTIMATE.start_main_~#t2033~0.base=|v_ULTIMATE.start_main_~#t2033~0.base_20|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_12, ULTIMATE.start_main_~#t2033~0.offset=|v_ULTIMATE.start_main_~#t2033~0.offset_16|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_~#t2032~0.offset=|v_ULTIMATE.start_main_~#t2032~0.offset_17|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_47, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_27, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ULTIMATE.start_main_~#t2031~0.base=|v_ULTIMATE.start_main_~#t2031~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_28, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2032~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2031~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t2033~0.base, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2033~0.offset, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t2032~0.offset, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t2031~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:38:07,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L805-1-->L807: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2032~0.base_12| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2032~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2032~0.base_12|) |v_ULTIMATE.start_main_~#t2032~0.offset_11| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2032~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2032~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t2032~0.base_12|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2032~0.base_12| 4)) (= |v_ULTIMATE.start_main_~#t2032~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2032~0.base=|v_ULTIMATE.start_main_~#t2032~0.base_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2032~0.offset=|v_ULTIMATE.start_main_~#t2032~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2032~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2032~0.offset] because there is no mapped edge [2019-12-27 07:38:07,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->L4-3: Formula: (and (= 0 (mod v_~z$w_buff1_used~0_60 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= 2 v_~z$w_buff0~0_17) (= v_~z$w_buff0~0_18 v_~z$w_buff1~0_18) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_~z$w_buff0_used~0_93 v_~z$w_buff1_used~0_60) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|) (= v_~z$w_buff0_used~0_92 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_18, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_17, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~z$w_buff1~0=v_~z$w_buff1~0_18, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 07:38:07,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L807-1-->L809: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2033~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2033~0.base_9|) |v_ULTIMATE.start_main_~#t2033~0.offset_8| 2))) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2033~0.base_9|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2033~0.base_9|) 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2033~0.base_9| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2033~0.base_9| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2033~0.base_9|)) (= |v_ULTIMATE.start_main_~#t2033~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2033~0.base=|v_ULTIMATE.start_main_~#t2033~0.base_9|, ULTIMATE.start_main_~#t2033~0.offset=|v_ULTIMATE.start_main_~#t2033~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2033~0.base, ULTIMATE.start_main_~#t2033~0.offset] because there is no mapped edge [2019-12-27 07:38:07,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-93614826 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-93614826 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-93614826| ~z$w_buff0_used~0_In-93614826) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-93614826| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-93614826, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-93614826} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-93614826|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-93614826, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-93614826} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:38:07,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L744-->L744-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In594542003 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In594542003 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In594542003 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In594542003 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out594542003| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out594542003| ~z$w_buff1_used~0_In594542003) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In594542003, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In594542003, ~z$w_buff1_used~0=~z$w_buff1_used~0_In594542003, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In594542003} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out594542003|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In594542003, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In594542003, ~z$w_buff1_used~0=~z$w_buff1_used~0_In594542003, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In594542003} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:38:07,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L745-->L746: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-613980062 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-613980062 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out-613980062 ~z$r_buff0_thd1~0_In-613980062)) (and (= ~z$r_buff0_thd1~0_Out-613980062 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-613980062, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-613980062} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-613980062, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-613980062|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-613980062} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:38:07,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L746-->L746-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd1~0_In-827177382 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-827177382 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-827177382 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-827177382 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-827177382|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd1~0_In-827177382 |P0Thread1of1ForFork0_#t~ite8_Out-827177382|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-827177382, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-827177382, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-827177382, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-827177382} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-827177382, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-827177382|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-827177382, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-827177382, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-827177382} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:38:07,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L746-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_15)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 07:38:07,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L762-2-->L762-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In-531984518 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-531984518 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out-531984518| |P1Thread1of1ForFork1_#t~ite10_Out-531984518|))) (or (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork1_#t~ite9_Out-531984518| ~z~0_In-531984518)) (and (not .cse1) (not .cse2) .cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out-531984518| ~z$w_buff1~0_In-531984518)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-531984518, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-531984518, ~z$w_buff1~0=~z$w_buff1~0_In-531984518, ~z~0=~z~0_In-531984518} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-531984518|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-531984518, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-531984518, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-531984518|, ~z$w_buff1~0=~z$w_buff1~0_In-531984518, ~z~0=~z~0_In-531984518} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 07:38:07,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1017705018 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1017705018 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In-1017705018 |P2Thread1of1ForFork2_#t~ite15_Out-1017705018|)) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1017705018 |P2Thread1of1ForFork2_#t~ite15_Out-1017705018|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1017705018, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1017705018, ~z$w_buff1~0=~z$w_buff1~0_In-1017705018, ~z~0=~z~0_In-1017705018} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-1017705018|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1017705018, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1017705018, ~z$w_buff1~0=~z$w_buff1~0_In-1017705018, ~z~0=~z~0_In-1017705018} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 07:38:07,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~z~0_17) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~z~0=v_~z~0_17, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 07:38:07,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In659770332 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In659770332 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out659770332| ~z$w_buff0_used~0_In659770332) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out659770332| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In659770332, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In659770332} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In659770332, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In659770332, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out659770332|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 07:38:07,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1683478072 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1683478072 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1683478072 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1683478072 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-1683478072|)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1683478072 |P2Thread1of1ForFork2_#t~ite18_Out-1683478072|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1683478072, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1683478072, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1683478072, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1683478072} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1683478072, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1683478072, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1683478072, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1683478072, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1683478072|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 07:38:07,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-508708435 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-508708435 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out-508708435| 0)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out-508708435| ~z$r_buff0_thd3~0_In-508708435) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-508708435, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-508708435} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-508708435, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-508708435, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-508708435|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 07:38:07,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L786-->L786-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-231847759 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-231847759 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-231847759 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-231847759 256)))) (or (and (= ~z$r_buff1_thd3~0_In-231847759 |P2Thread1of1ForFork2_#t~ite20_Out-231847759|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite20_Out-231847759|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-231847759, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-231847759, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-231847759, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-231847759} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-231847759, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-231847759|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-231847759, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-231847759, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-231847759} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 07:38:07,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~z$r_buff1_thd3~0_13) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 07:38:07,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-625311224 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-625311224 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-625311224| ~z$w_buff0_used~0_In-625311224) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-625311224| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-625311224, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-625311224} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-625311224, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-625311224|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-625311224} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 07:38:07,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L764-->L764-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-28482287 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-28482287 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-28482287 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-28482287 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-28482287| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-28482287| ~z$w_buff1_used~0_In-28482287) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-28482287, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-28482287, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-28482287, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-28482287} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-28482287, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-28482287, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-28482287, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-28482287|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-28482287} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 07:38:07,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1428800206 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1428800206 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out1428800206| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out1428800206| ~z$r_buff0_thd2~0_In1428800206) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1428800206, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1428800206} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1428800206, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1428800206|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1428800206} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 07:38:07,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In373715818 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In373715818 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In373715818 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In373715818 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out373715818| ~z$r_buff1_thd2~0_In373715818)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite14_Out373715818| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In373715818, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In373715818, ~z$w_buff1_used~0=~z$w_buff1_used~0_In373715818, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In373715818} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In373715818, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In373715818, ~z$w_buff1_used~0=~z$w_buff1_used~0_In373715818, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out373715818|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In373715818} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:38:07,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 07:38:07,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 07:38:07,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L815-2-->L815-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite25_Out-1343060194| |ULTIMATE.start_main_#t~ite24_Out-1343060194|)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1343060194 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1343060194 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In-1343060194 |ULTIMATE.start_main_#t~ite24_Out-1343060194|)) (and .cse2 (= ~z$w_buff1~0_In-1343060194 |ULTIMATE.start_main_#t~ite24_Out-1343060194|) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1343060194, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1343060194, ~z$w_buff1~0=~z$w_buff1~0_In-1343060194, ~z~0=~z~0_In-1343060194} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1343060194, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1343060194|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1343060194, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1343060194|, ~z$w_buff1~0=~z$w_buff1~0_In-1343060194, ~z~0=~z~0_In-1343060194} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 07:38:07,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In2112749638 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2112749638 256)))) (or (and (= ~z$w_buff0_used~0_In2112749638 |ULTIMATE.start_main_#t~ite26_Out2112749638|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite26_Out2112749638|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2112749638, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2112749638} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2112749638, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2112749638, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out2112749638|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 07:38:07,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L817-->L817-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In12699403 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In12699403 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In12699403 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In12699403 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite27_Out12699403| ~z$w_buff1_used~0_In12699403)) (and (= |ULTIMATE.start_main_#t~ite27_Out12699403| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In12699403, ~z$w_buff0_used~0=~z$w_buff0_used~0_In12699403, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In12699403, ~z$w_buff1_used~0=~z$w_buff1_used~0_In12699403} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In12699403, ~z$w_buff0_used~0=~z$w_buff0_used~0_In12699403, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In12699403, ~z$w_buff1_used~0=~z$w_buff1_used~0_In12699403, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out12699403|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 07:38:07,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In969759595 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In969759595 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In969759595 |ULTIMATE.start_main_#t~ite28_Out969759595|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out969759595| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In969759595, ~z$w_buff0_used~0=~z$w_buff0_used~0_In969759595} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In969759595, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out969759595|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In969759595} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 07:38:07,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In415155459 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In415155459 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In415155459 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In415155459 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In415155459 |ULTIMATE.start_main_#t~ite29_Out415155459|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite29_Out415155459|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In415155459, ~z$w_buff0_used~0=~z$w_buff0_used~0_In415155459, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In415155459, ~z$w_buff1_used~0=~z$w_buff1_used~0_In415155459} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In415155459, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out415155459|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In415155459, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In415155459, ~z$w_buff1_used~0=~z$w_buff1_used~0_In415155459} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 07:38:07,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L831-->L832: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~z$r_buff0_thd0~0_55 v_~z$r_buff0_thd0~0_54)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_55, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_54, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 07:38:07,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L834-->L837-1: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_25 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:38:07,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 07:38:07,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:38:07 BasicIcfg [2019-12-27 07:38:07,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:38:07,126 INFO L168 Benchmark]: Toolchain (without parser) took 105879.14 ms. Allocated memory was 138.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 101.7 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 07:38:07,127 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 07:38:07,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.77 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.2 MB in the beginning and 156.0 MB in the end (delta: -54.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:38:07,128 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.89 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 152.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 07:38:07,129 INFO L168 Benchmark]: Boogie Preprocessor took 39.61 ms. Allocated memory is still 202.4 MB. Free memory was 152.7 MB in the beginning and 150.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:38:07,129 INFO L168 Benchmark]: RCFGBuilder took 840.81 ms. Allocated memory is still 202.4 MB. Free memory was 150.0 MB in the beginning and 100.3 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:38:07,130 INFO L168 Benchmark]: TraceAbstraction took 104165.52 ms. Allocated memory was 202.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 99.7 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 07:38:07,133 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.15 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 762.77 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.2 MB in the beginning and 156.0 MB in the end (delta: -54.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.89 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 152.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.61 ms. Allocated memory is still 202.4 MB. Free memory was 152.7 MB in the beginning and 150.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 840.81 ms. Allocated memory is still 202.4 MB. Free memory was 150.0 MB in the beginning and 100.3 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 104165.52 ms. Allocated memory was 202.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 99.7 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 174 ProgramPointsBefore, 96 ProgramPointsAfterwards, 211 TransitionsBefore, 109 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 28 ChoiceCompositions, 5870 VarBasedMoverChecksPositive, 189 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 81758 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t2031, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] FCALL, FORK 0 pthread_create(&t2032, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L809] FCALL, FORK 0 pthread_create(&t2033, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L782] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L816] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L817] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L818] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L819] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 z$flush_delayed = weak$$choice2 [L825] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L827] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L828] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L829] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 103.8s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 34.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3187 SDtfs, 4028 SDslu, 10175 SDs, 0 SdLazy, 10384 SolverSat, 342 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 32 SyntacticMatches, 20 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3227 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205075occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 99330 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1051 NumberOfCodeBlocks, 1051 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 963 ConstructedInterpolants, 0 QuantifiedInterpolants, 270705 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...