/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix048_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:43:26,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:43:26,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:43:26,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:43:26,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:43:26,903 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:43:26,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:43:26,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:43:26,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:43:26,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:43:26,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:43:26,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:43:26,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:43:26,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:43:26,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:43:26,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:43:26,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:43:26,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:43:26,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:43:26,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:43:26,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:43:26,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:43:26,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:43:26,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:43:26,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:43:26,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:43:26,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:43:26,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:43:26,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:43:26,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:43:26,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:43:26,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:43:26,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:43:26,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:43:26,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:43:26,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:43:26,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:43:26,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:43:26,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:43:26,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:43:26,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:43:26,945 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:43:26,962 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:43:26,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:43:26,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:43:26,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:43:26,966 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:43:26,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:43:26,966 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:43:26,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:43:26,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:43:26,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:43:26,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:43:26,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:43:26,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:43:26,967 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:43:26,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:43:26,968 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:43:26,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:43:26,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:43:26,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:43:26,969 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:43:26,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:43:26,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:43:26,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:43:26,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:43:26,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:43:26,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:43:26,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:43:26,972 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:43:26,972 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:43:27,285 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:43:27,304 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:43:27,308 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:43:27,309 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:43:27,309 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:43:27,310 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix048_power.oepc.i [2019-12-27 02:43:27,374 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688ba9e95/ce4f8cf34a9040cca9603b51c921613a/FLAG0fac32491 [2019-12-27 02:43:27,937 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:43:27,937 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix048_power.oepc.i [2019-12-27 02:43:27,952 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688ba9e95/ce4f8cf34a9040cca9603b51c921613a/FLAG0fac32491 [2019-12-27 02:43:28,203 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688ba9e95/ce4f8cf34a9040cca9603b51c921613a [2019-12-27 02:43:28,212 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:43:28,213 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:43:28,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:43:28,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:43:28,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:43:28,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:43:28" (1/1) ... [2019-12-27 02:43:28,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b9a289b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:43:28, skipping insertion in model container [2019-12-27 02:43:28,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:43:28" (1/1) ... [2019-12-27 02:43:28,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:43:28,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:43:28,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:43:28,792 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:43:28,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:43:28,939 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:43:28,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:43:28 WrapperNode [2019-12-27 02:43:28,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:43:28,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:43:28,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:43:28,942 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:43:28,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:43:28" (1/1) ... [2019-12-27 02:43:28,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:43:28" (1/1) ... [2019-12-27 02:43:29,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:43:29,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:43:29,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:43:29,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:43:29,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:43:28" (1/1) ... [2019-12-27 02:43:29,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:43:28" (1/1) ... [2019-12-27 02:43:29,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:43:28" (1/1) ... [2019-12-27 02:43:29,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:43:28" (1/1) ... [2019-12-27 02:43:29,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:43:28" (1/1) ... [2019-12-27 02:43:29,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:43:28" (1/1) ... [2019-12-27 02:43:29,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:43:28" (1/1) ... [2019-12-27 02:43:29,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:43:29,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:43:29,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:43:29,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:43:29,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:43:28" (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 02:43:29,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:43:29,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:43:29,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:43:29,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:43:29,111 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:43:29,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:43:29,111 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:43:29,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:43:29,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:43:29,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:43:29,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:43:29,114 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 02:43:29,839 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:43:29,840 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:43:29,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:43:29 BoogieIcfgContainer [2019-12-27 02:43:29,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:43:29,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:43:29,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:43:29,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:43:29,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:43:28" (1/3) ... [2019-12-27 02:43:29,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254df9a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:43:29, skipping insertion in model container [2019-12-27 02:43:29,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:43:28" (2/3) ... [2019-12-27 02:43:29,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254df9a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:43:29, skipping insertion in model container [2019-12-27 02:43:29,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:43:29" (3/3) ... [2019-12-27 02:43:29,850 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_power.oepc.i [2019-12-27 02:43:29,862 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:43:29,862 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:43:29,870 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:43:29,871 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:43:29,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,911 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,911 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,911 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,912 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,912 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,922 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,923 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,985 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,985 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,986 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,992 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,995 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:29,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:43:30,013 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 02:43:30,036 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:43:30,036 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:43:30,036 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:43:30,036 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:43:30,036 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:43:30,037 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:43:30,037 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:43:30,037 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:43:30,060 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 02:43:30,062 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 02:43:30,176 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 02:43:30,177 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:43:30,190 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 02:43:30,207 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 02:43:30,254 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 02:43:30,254 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:43:30,260 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 02:43:30,275 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 02:43:30,276 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:43:34,905 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 02:43:35,077 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-27 02:43:35,078 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-27 02:43:35,081 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-27 02:43:35,491 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-27 02:43:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-27 02:43:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:43:35,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:35,501 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:43:35,501 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:35,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:35,508 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-27 02:43:35,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:35,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444090175] [2019-12-27 02:43:35,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:35,715 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 02:43:35,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444090175] [2019-12-27 02:43:35,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:35,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:43:35,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273257963] [2019-12-27 02:43:35,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:43:35,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:35,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:43:35,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:43:35,742 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-27 02:43:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:36,077 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-27 02:43:36,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:43:36,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:43:36,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:36,165 INFO L225 Difference]: With dead ends: 8074 [2019-12-27 02:43:36,166 INFO L226 Difference]: Without dead ends: 7606 [2019-12-27 02:43:36,167 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 02:43:36,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-27 02:43:36,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-27 02:43:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-27 02:43:36,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-27 02:43:36,557 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-27 02:43:36,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:36,557 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-27 02:43:36,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:43:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-27 02:43:36,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:43:36,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:36,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:43:36,561 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:36,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:36,562 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-27 02:43:36,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:36,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221807755] [2019-12-27 02:43:36,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:36,674 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 02:43:36,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221807755] [2019-12-27 02:43:36,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:36,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:43:36,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629092965] [2019-12-27 02:43:36,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:43:36,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:36,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:43:36,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:43:36,677 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-27 02:43:37,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:37,012 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-27 02:43:37,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:43:37,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:43:37,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:37,231 INFO L225 Difference]: With dead ends: 11630 [2019-12-27 02:43:37,231 INFO L226 Difference]: Without dead ends: 11623 [2019-12-27 02:43:37,232 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 02:43:37,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-27 02:43:37,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-27 02:43:37,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-27 02:43:37,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-27 02:43:37,590 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-27 02:43:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:37,591 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-27 02:43:37,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:43:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-27 02:43:37,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:43:37,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:37,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:43:37,598 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:37,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:37,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-27 02:43:37,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:37,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973444081] [2019-12-27 02:43:37,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:43:37,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973444081] [2019-12-27 02:43:37,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:37,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:43:37,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647749146] [2019-12-27 02:43:37,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:43:37,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:37,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:43:37,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:43:37,755 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-27 02:43:38,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:38,734 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-27 02:43:38,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:43:38,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 02:43:38,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:38,791 INFO L225 Difference]: With dead ends: 14471 [2019-12-27 02:43:38,791 INFO L226 Difference]: Without dead ends: 14471 [2019-12-27 02:43:38,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:43:38,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-27 02:43:39,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-27 02:43:39,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-27 02:43:39,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-27 02:43:39,205 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-27 02:43:39,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:39,208 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-27 02:43:39,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:43:39,208 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-27 02:43:39,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:43:39,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:39,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:43:39,212 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:39,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:39,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-27 02:43:39,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:39,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428285109] [2019-12-27 02:43:39,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:43:39,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428285109] [2019-12-27 02:43:39,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:39,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:43:39,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147325916] [2019-12-27 02:43:39,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:43:39,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:39,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:43:39,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:43:39,338 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 4 states. [2019-12-27 02:43:39,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:39,375 INFO L93 Difference]: Finished difference Result 2200 states and 5503 transitions. [2019-12-27 02:43:39,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:43:39,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 02:43:39,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:39,381 INFO L225 Difference]: With dead ends: 2200 [2019-12-27 02:43:39,381 INFO L226 Difference]: Without dead ends: 1563 [2019-12-27 02:43:39,382 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 02:43:39,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-12-27 02:43:39,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1547. [2019-12-27 02:43:39,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-12-27 02:43:39,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 3457 transitions. [2019-12-27 02:43:39,413 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 3457 transitions. Word has length 16 [2019-12-27 02:43:39,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:39,413 INFO L462 AbstractCegarLoop]: Abstraction has 1547 states and 3457 transitions. [2019-12-27 02:43:39,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:43:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 3457 transitions. [2019-12-27 02:43:39,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 02:43:39,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:39,415 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] [2019-12-27 02:43:39,416 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:39,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:39,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-27 02:43:39,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:39,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751410199] [2019-12-27 02:43:39,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:39,548 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 02:43:39,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751410199] [2019-12-27 02:43:39,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:39,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:43:39,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38097176] [2019-12-27 02:43:39,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:43:39,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:39,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:43:39,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:43:39,551 INFO L87 Difference]: Start difference. First operand 1547 states and 3457 transitions. Second operand 6 states. [2019-12-27 02:43:40,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:40,049 INFO L93 Difference]: Finished difference Result 2337 states and 5001 transitions. [2019-12-27 02:43:40,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:43:40,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 02:43:40,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:40,059 INFO L225 Difference]: With dead ends: 2337 [2019-12-27 02:43:40,059 INFO L226 Difference]: Without dead ends: 2285 [2019-12-27 02:43:40,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:43:40,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2019-12-27 02:43:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 1625. [2019-12-27 02:43:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2019-12-27 02:43:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 3604 transitions. [2019-12-27 02:43:40,093 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 3604 transitions. Word has length 24 [2019-12-27 02:43:40,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:40,094 INFO L462 AbstractCegarLoop]: Abstraction has 1625 states and 3604 transitions. [2019-12-27 02:43:40,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:43:40,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 3604 transitions. [2019-12-27 02:43:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 02:43:40,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:40,097 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] [2019-12-27 02:43:40,097 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:40,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:40,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2063536940, now seen corresponding path program 1 times [2019-12-27 02:43:40,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:40,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230193084] [2019-12-27 02:43:40,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:40,184 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 02:43:40,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230193084] [2019-12-27 02:43:40,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:40,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:43:40,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238514311] [2019-12-27 02:43:40,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:43:40,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:40,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:43:40,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:43:40,187 INFO L87 Difference]: Start difference. First operand 1625 states and 3604 transitions. Second operand 5 states. [2019-12-27 02:43:40,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:40,703 INFO L93 Difference]: Finished difference Result 2383 states and 5182 transitions. [2019-12-27 02:43:40,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:43:40,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 02:43:40,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:40,708 INFO L225 Difference]: With dead ends: 2383 [2019-12-27 02:43:40,708 INFO L226 Difference]: Without dead ends: 2383 [2019-12-27 02:43:40,709 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 02:43:40,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-12-27 02:43:40,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2084. [2019-12-27 02:43:40,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2019-12-27 02:43:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 4594 transitions. [2019-12-27 02:43:40,746 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 4594 transitions. Word has length 26 [2019-12-27 02:43:40,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:40,746 INFO L462 AbstractCegarLoop]: Abstraction has 2084 states and 4594 transitions. [2019-12-27 02:43:40,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:43:40,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 4594 transitions. [2019-12-27 02:43:40,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:43:40,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:40,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:43:40,750 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:40,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:40,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-12-27 02:43:40,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:40,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749933969] [2019-12-27 02:43:40,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:40,826 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 02:43:40,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749933969] [2019-12-27 02:43:40,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:40,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:43:40,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231276406] [2019-12-27 02:43:40,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:43:40,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:40,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:43:40,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:43:40,829 INFO L87 Difference]: Start difference. First operand 2084 states and 4594 transitions. Second operand 5 states. [2019-12-27 02:43:40,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:40,877 INFO L93 Difference]: Finished difference Result 1286 states and 2707 transitions. [2019-12-27 02:43:40,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:43:40,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 02:43:40,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:40,879 INFO L225 Difference]: With dead ends: 1286 [2019-12-27 02:43:40,879 INFO L226 Difference]: Without dead ends: 1165 [2019-12-27 02:43:40,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:43:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-12-27 02:43:40,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1076. [2019-12-27 02:43:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-12-27 02:43:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 2287 transitions. [2019-12-27 02:43:40,898 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 2287 transitions. Word has length 27 [2019-12-27 02:43:40,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:40,899 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 2287 transitions. [2019-12-27 02:43:40,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:43:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 2287 transitions. [2019-12-27 02:43:40,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 02:43:40,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:40,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:43:40,903 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:40,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:40,903 INFO L82 PathProgramCache]: Analyzing trace with hash -44666522, now seen corresponding path program 1 times [2019-12-27 02:43:40,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:40,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858038711] [2019-12-27 02:43:40,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:41,001 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 02:43:41,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858038711] [2019-12-27 02:43:41,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:41,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:43:41,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346513531] [2019-12-27 02:43:41,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:43:41,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:41,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:43:41,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:43:41,004 INFO L87 Difference]: Start difference. First operand 1076 states and 2287 transitions. Second operand 4 states. [2019-12-27 02:43:41,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:41,025 INFO L93 Difference]: Finished difference Result 1807 states and 3865 transitions. [2019-12-27 02:43:41,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:43:41,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-27 02:43:41,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:41,027 INFO L225 Difference]: With dead ends: 1807 [2019-12-27 02:43:41,027 INFO L226 Difference]: Without dead ends: 800 [2019-12-27 02:43:41,028 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 02:43:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-12-27 02:43:41,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2019-12-27 02:43:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-12-27 02:43:41,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1708 transitions. [2019-12-27 02:43:41,040 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1708 transitions. Word has length 50 [2019-12-27 02:43:41,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:41,040 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1708 transitions. [2019-12-27 02:43:41,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:43:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1708 transitions. [2019-12-27 02:43:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 02:43:41,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:41,043 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] [2019-12-27 02:43:41,043 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:41,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:41,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1290466760, now seen corresponding path program 2 times [2019-12-27 02:43:41,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:41,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642385636] [2019-12-27 02:43:41,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:41,127 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 02:43:41,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642385636] [2019-12-27 02:43:41,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:41,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:43:41,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212358065] [2019-12-27 02:43:41,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:43:41,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:41,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:43:41,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:43:41,130 INFO L87 Difference]: Start difference. First operand 800 states and 1708 transitions. Second operand 7 states. [2019-12-27 02:43:41,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:41,327 INFO L93 Difference]: Finished difference Result 1394 states and 2892 transitions. [2019-12-27 02:43:41,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:43:41,328 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-27 02:43:41,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:41,330 INFO L225 Difference]: With dead ends: 1394 [2019-12-27 02:43:41,331 INFO L226 Difference]: Without dead ends: 931 [2019-12-27 02:43:41,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:43:41,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-12-27 02:43:41,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 792. [2019-12-27 02:43:41,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-12-27 02:43:41,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1676 transitions. [2019-12-27 02:43:41,370 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1676 transitions. Word has length 50 [2019-12-27 02:43:41,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:41,370 INFO L462 AbstractCegarLoop]: Abstraction has 792 states and 1676 transitions. [2019-12-27 02:43:41,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:43:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1676 transitions. [2019-12-27 02:43:41,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 02:43:41,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:41,379 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] [2019-12-27 02:43:41,380 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:41,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:41,380 INFO L82 PathProgramCache]: Analyzing trace with hash 50774886, now seen corresponding path program 3 times [2019-12-27 02:43:41,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:41,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448544196] [2019-12-27 02:43:41,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:41,492 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 02:43:41,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448544196] [2019-12-27 02:43:41,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:41,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:43:41,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30220645] [2019-12-27 02:43:41,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:43:41,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:41,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:43:41,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:43:41,494 INFO L87 Difference]: Start difference. First operand 792 states and 1676 transitions. Second operand 3 states. [2019-12-27 02:43:41,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:41,549 INFO L93 Difference]: Finished difference Result 1051 states and 2216 transitions. [2019-12-27 02:43:41,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:43:41,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 02:43:41,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:41,551 INFO L225 Difference]: With dead ends: 1051 [2019-12-27 02:43:41,551 INFO L226 Difference]: Without dead ends: 1051 [2019-12-27 02:43:41,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 02:43:41,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-12-27 02:43:41,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 849. [2019-12-27 02:43:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-12-27 02:43:41,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1815 transitions. [2019-12-27 02:43:41,566 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1815 transitions. Word has length 50 [2019-12-27 02:43:41,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:41,566 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1815 transitions. [2019-12-27 02:43:41,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:43:41,567 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1815 transitions. [2019-12-27 02:43:41,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 02:43:41,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:41,569 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] [2019-12-27 02:43:41,569 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:41,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:41,570 INFO L82 PathProgramCache]: Analyzing trace with hash 925752847, now seen corresponding path program 1 times [2019-12-27 02:43:41,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:41,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253592083] [2019-12-27 02:43:41,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:41,789 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 02:43:41,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253592083] [2019-12-27 02:43:41,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:41,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:43:41,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311936457] [2019-12-27 02:43:41,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:43:41,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:41,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:43:41,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:43:41,791 INFO L87 Difference]: Start difference. First operand 849 states and 1815 transitions. Second operand 8 states. [2019-12-27 02:43:42,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:42,450 INFO L93 Difference]: Finished difference Result 1233 states and 2548 transitions. [2019-12-27 02:43:42,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:43:42,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-12-27 02:43:42,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:42,454 INFO L225 Difference]: With dead ends: 1233 [2019-12-27 02:43:42,454 INFO L226 Difference]: Without dead ends: 1233 [2019-12-27 02:43:42,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:43:42,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2019-12-27 02:43:42,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 921. [2019-12-27 02:43:42,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-12-27 02:43:42,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1958 transitions. [2019-12-27 02:43:42,470 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1958 transitions. Word has length 51 [2019-12-27 02:43:42,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:42,471 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1958 transitions. [2019-12-27 02:43:42,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:43:42,471 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1958 transitions. [2019-12-27 02:43:42,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 02:43:42,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:42,474 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] [2019-12-27 02:43:42,474 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:42,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:42,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1086861075, now seen corresponding path program 2 times [2019-12-27 02:43:42,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:42,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017862388] [2019-12-27 02:43:42,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:43:42,548 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 02:43:42,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017862388] [2019-12-27 02:43:42,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:43:42,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:43:42,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455056652] [2019-12-27 02:43:42,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:43:42,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:43:42,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:43:42,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:43:42,550 INFO L87 Difference]: Start difference. First operand 921 states and 1958 transitions. Second operand 3 states. [2019-12-27 02:43:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:43:42,563 INFO L93 Difference]: Finished difference Result 920 states and 1956 transitions. [2019-12-27 02:43:42,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:43:42,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 02:43:42,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:43:42,565 INFO L225 Difference]: With dead ends: 920 [2019-12-27 02:43:42,565 INFO L226 Difference]: Without dead ends: 920 [2019-12-27 02:43:42,565 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 02:43:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2019-12-27 02:43:42,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 754. [2019-12-27 02:43:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-27 02:43:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-27 02:43:42,578 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-27 02:43:42,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:43:42,578 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-27 02:43:42,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:43:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-27 02:43:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 02:43:42,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:43:42,580 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] [2019-12-27 02:43:42,581 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:43:42,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:43:42,581 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-27 02:43:42,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:43:42,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809674353] [2019-12-27 02:43:42,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:43:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:43:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:43:42,723 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:43:42,724 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:43:42,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1281~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1281~0.base_40|) |v_ULTIMATE.start_main_~#t1281~0.offset_27| 0))) (= v_~y$read_delayed~0_6 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1281~0.base_40|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1281~0.base_40| 4) |v_#length_17|) (= 0 v_~y$r_buff1_thd2~0_235) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= |v_ULTIMATE.start_main_~#t1281~0.offset_27| 0) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= v_~y$r_buff1_thd1~0_115 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1281~0.base_40|)) (= (store .cse0 |v_ULTIMATE.start_main_~#t1281~0.base_40| 1) |v_#valid_65|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ULTIMATE.start_main_~#t1282~0.offset=|v_ULTIMATE.start_main_~#t1282~0.offset_27|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1281~0.base=|v_ULTIMATE.start_main_~#t1281~0.base_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1281~0.offset=|v_ULTIMATE.start_main_~#t1281~0.offset_27|, ULTIMATE.start_main_~#t1282~0.base=|v_ULTIMATE.start_main_~#t1282~0.base_41|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1282~0.offset, ~y~0, ULTIMATE.start_main_~#t1281~0.base, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1281~0.offset, ULTIMATE.start_main_~#t1282~0.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 02:43:42,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1282~0.base_13| 1) |v_#valid_27|) (not (= 0 |v_ULTIMATE.start_main_~#t1282~0.base_13|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1282~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1282~0.base_13|) |v_ULTIMATE.start_main_~#t1282~0.offset_11| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1282~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1282~0.offset_11| 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1282~0.base_13| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1282~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1282~0.base=|v_ULTIMATE.start_main_~#t1282~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1282~0.offset=|v_ULTIMATE.start_main_~#t1282~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1282~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1282~0.offset] because there is no mapped edge [2019-12-27 02:43:42,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~x~0_In-948556606 ~__unbuffered_p0_EAX~0_Out-948556606) (= ~y$r_buff0_thd1~0_In-948556606 ~y$r_buff1_thd1~0_Out-948556606) (= ~y$r_buff1_thd2~0_Out-948556606 ~y$r_buff0_thd2~0_In-948556606) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-948556606 0)) (= ~y$r_buff0_thd1~0_Out-948556606 1) (= ~y$r_buff1_thd0~0_Out-948556606 ~y$r_buff0_thd0~0_In-948556606)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-948556606, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-948556606, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-948556606, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-948556606, ~x~0=~x~0_In-948556606} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-948556606, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-948556606, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-948556606, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-948556606, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-948556606, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-948556606, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-948556606, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-948556606, ~x~0=~x~0_In-948556606} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 02:43:42,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1949909621 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1949909621 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1949909621| ~y$w_buff0_used~0_In1949909621)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1949909621| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1949909621, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1949909621} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1949909621|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1949909621, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1949909621} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 02:43:42,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In967692968 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In967692968| |P1Thread1of1ForFork1_#t~ite20_Out967692968|) (= |P1Thread1of1ForFork1_#t~ite21_Out967692968| ~y$w_buff0_used~0_In967692968) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out967692968| ~y$w_buff0_used~0_In967692968) (= |P1Thread1of1ForFork1_#t~ite21_Out967692968| |P1Thread1of1ForFork1_#t~ite20_Out967692968|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In967692968 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In967692968 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In967692968 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In967692968 256)))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In967692968, ~y$w_buff0_used~0=~y$w_buff0_used~0_In967692968, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In967692968|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In967692968, ~weak$$choice2~0=~weak$$choice2~0_In967692968, ~y$w_buff1_used~0=~y$w_buff1_used~0_In967692968} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In967692968, ~y$w_buff0_used~0=~y$w_buff0_used~0_In967692968, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out967692968|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In967692968, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out967692968|, ~weak$$choice2~0=~weak$$choice2~0_In967692968, ~y$w_buff1_used~0=~y$w_buff1_used~0_In967692968} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 02:43:42,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In-494653668 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-494653668 256))) (.cse4 (= (mod ~y$w_buff1_used~0_In-494653668 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd2~0_In-494653668 256) 0)) (.cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-494653668| |P1Thread1of1ForFork1_#t~ite24_Out-494653668|)) (.cse1 (= 0 (mod ~weak$$choice2~0_In-494653668 256)))) (or (let ((.cse3 (not .cse6))) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-494653668|) .cse1 (or (not .cse2) .cse3) (or .cse3 (not .cse4)) .cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-494653668| |P1Thread1of1ForFork1_#t~ite22_Out-494653668|))) (and (= |P1Thread1of1ForFork1_#t~ite22_In-494653668| |P1Thread1of1ForFork1_#t~ite22_Out-494653668|) (or (and (or (and .cse2 .cse6) .cse0 (and .cse4 .cse6)) .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out-494653668| ~y$w_buff1_used~0_In-494653668) .cse5) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite24_Out-494653668| ~y$w_buff1_used~0_In-494653668) (= |P1Thread1of1ForFork1_#t~ite23_Out-494653668| |P1Thread1of1ForFork1_#t~ite23_In-494653668|)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-494653668, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-494653668, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-494653668, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-494653668|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-494653668|, ~weak$$choice2~0=~weak$$choice2~0_In-494653668, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-494653668} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-494653668, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-494653668, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-494653668, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-494653668|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-494653668|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-494653668|, ~weak$$choice2~0=~weak$$choice2~0_In-494653668, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-494653668} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 02:43:42,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-525638183 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-525638183 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-525638183 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-525638183 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-525638183 |P0Thread1of1ForFork0_#t~ite6_Out-525638183|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-525638183|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-525638183, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-525638183, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-525638183, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-525638183} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-525638183|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-525638183, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-525638183, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-525638183, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-525638183} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 02:43:42,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1309206448 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1309206448 256)))) (or (and (= ~y$r_buff0_thd1~0_Out-1309206448 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-1309206448 ~y$r_buff0_thd1~0_Out-1309206448)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1309206448, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1309206448} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1309206448, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1309206448|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1309206448} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:43:42,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd1~0_In1176756003 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1176756003 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1176756003 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1176756003 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1176756003| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out1176756003| ~y$r_buff1_thd1~0_In1176756003) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1176756003, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1176756003, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1176756003, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1176756003} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1176756003, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1176756003, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1176756003|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1176756003, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1176756003} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 02:43:42,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 02:43:42,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In127410581 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In127410581 |P1Thread1of1ForFork1_#t~ite29_Out127410581|) (= |P1Thread1of1ForFork1_#t~ite30_Out127410581| |P1Thread1of1ForFork1_#t~ite29_Out127410581|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In127410581 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In127410581 256)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In127410581 256))) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In127410581 256) 0)))) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite30_Out127410581| ~y$r_buff1_thd2~0_In127410581) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In127410581| |P1Thread1of1ForFork1_#t~ite29_Out127410581|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In127410581, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In127410581|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In127410581, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In127410581, ~weak$$choice2~0=~weak$$choice2~0_In127410581, ~y$w_buff1_used~0=~y$w_buff1_used~0_In127410581} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In127410581, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out127410581|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out127410581|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In127410581, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In127410581, ~weak$$choice2~0=~weak$$choice2~0_In127410581, ~y$w_buff1_used~0=~y$w_buff1_used~0_In127410581} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 02:43:42,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 02:43:42,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In933500911 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In933500911 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out933500911| ~y~0_In933500911)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out933500911| ~y$w_buff1~0_In933500911)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In933500911, ~y$w_buff1~0=~y$w_buff1~0_In933500911, ~y~0=~y~0_In933500911, ~y$w_buff1_used~0=~y$w_buff1_used~0_In933500911} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In933500911, ~y$w_buff1~0=~y$w_buff1~0_In933500911, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out933500911|, ~y~0=~y~0_In933500911, ~y$w_buff1_used~0=~y$w_buff1_used~0_In933500911} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 02:43:42,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 02:43:42,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In432475264 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In432475264 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In432475264 |P1Thread1of1ForFork1_#t~ite34_Out432475264|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out432475264|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In432475264, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In432475264} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In432475264, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In432475264, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out432475264|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 02:43:42,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1352046741 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1352046741 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1352046741 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1352046741 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1352046741|)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1352046741 |P1Thread1of1ForFork1_#t~ite35_Out1352046741|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1352046741, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1352046741, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1352046741, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1352046741} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1352046741, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1352046741, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1352046741, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1352046741|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1352046741} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 02:43:42,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In449091701 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In449091701 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In449091701 |P1Thread1of1ForFork1_#t~ite36_Out449091701|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out449091701|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In449091701, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In449091701} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In449091701, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In449091701, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out449091701|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 02:43:42,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1837900382 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1837900382 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1837900382 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1837900382 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1837900382|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In1837900382 |P1Thread1of1ForFork1_#t~ite37_Out1837900382|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1837900382, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1837900382, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1837900382, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1837900382} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1837900382, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1837900382, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1837900382, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1837900382|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1837900382} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 02:43:42,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 02:43:42,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 02:43:42,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 02:43:42,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1299121566 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1299121566 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1299121566| ~y$w_buff1~0_In1299121566)) (and (= ~y~0_In1299121566 |ULTIMATE.start_main_#t~ite40_Out1299121566|) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1299121566, ~y~0=~y~0_In1299121566, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1299121566, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1299121566} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1299121566|, ~y$w_buff1~0=~y$w_buff1~0_In1299121566, ~y~0=~y~0_In1299121566, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1299121566, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1299121566} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 02:43:42,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 02:43:42,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In608472386 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In608472386 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out608472386|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In608472386 |ULTIMATE.start_main_#t~ite42_Out608472386|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In608472386, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In608472386} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In608472386, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In608472386, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out608472386|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 02:43:42,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-394537096 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-394537096 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-394537096 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-394537096 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-394537096 |ULTIMATE.start_main_#t~ite43_Out-394537096|)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-394537096|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-394537096, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-394537096, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-394537096, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-394537096} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-394537096, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-394537096, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-394537096|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-394537096, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-394537096} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 02:43:42,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-755674318 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-755674318 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-755674318 |ULTIMATE.start_main_#t~ite44_Out-755674318|)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-755674318|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-755674318, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-755674318} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-755674318, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-755674318, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-755674318|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 02:43:42,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In740360242 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In740360242 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In740360242 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In740360242 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out740360242|)) (and (= ~y$r_buff1_thd0~0_In740360242 |ULTIMATE.start_main_#t~ite45_Out740360242|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In740360242, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In740360242, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In740360242, ~y$w_buff1_used~0=~y$w_buff1_used~0_In740360242} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In740360242, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In740360242, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In740360242, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out740360242|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In740360242} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 02:43:42,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:43:42,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:43:42 BasicIcfg [2019-12-27 02:43:42,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:43:42,807 INFO L168 Benchmark]: Toolchain (without parser) took 14594.13 ms. Allocated memory was 147.8 MB in the beginning and 535.3 MB in the end (delta: 387.4 MB). Free memory was 104.0 MB in the beginning and 228.7 MB in the end (delta: -124.7 MB). Peak memory consumption was 262.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:43:42,808 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 147.8 MB. Free memory was 124.1 MB in the beginning and 123.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 02:43:42,809 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.97 ms. Allocated memory was 147.8 MB in the beginning and 203.9 MB in the end (delta: 56.1 MB). Free memory was 103.5 MB in the beginning and 158.3 MB in the end (delta: -54.8 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:43:42,810 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.70 ms. Allocated memory is still 203.9 MB. Free memory was 158.3 MB in the beginning and 155.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 02:43:42,811 INFO L168 Benchmark]: Boogie Preprocessor took 40.99 ms. Allocated memory is still 203.9 MB. Free memory was 155.8 MB in the beginning and 153.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:43:42,811 INFO L168 Benchmark]: RCFGBuilder took 798.81 ms. Allocated memory is still 203.9 MB. Free memory was 153.9 MB in the beginning and 109.4 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:43:42,812 INFO L168 Benchmark]: TraceAbstraction took 12962.91 ms. Allocated memory was 203.9 MB in the beginning and 535.3 MB in the end (delta: 331.4 MB). Free memory was 109.4 MB in the beginning and 228.7 MB in the end (delta: -119.3 MB). Peak memory consumption was 212.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:43:42,817 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.41 ms. Allocated memory is still 147.8 MB. Free memory was 124.1 MB in the beginning and 123.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 726.97 ms. Allocated memory was 147.8 MB in the beginning and 203.9 MB in the end (delta: 56.1 MB). Free memory was 103.5 MB in the beginning and 158.3 MB in the end (delta: -54.8 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.70 ms. Allocated memory is still 203.9 MB. Free memory was 158.3 MB in the beginning and 155.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.99 ms. Allocated memory is still 203.9 MB. Free memory was 155.8 MB in the beginning and 153.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 798.81 ms. Allocated memory is still 203.9 MB. Free memory was 153.9 MB in the beginning and 109.4 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12962.91 ms. Allocated memory was 203.9 MB in the beginning and 535.3 MB in the end (delta: 331.4 MB). Free memory was 109.4 MB in the beginning and 228.7 MB in the end (delta: -119.3 MB). Peak memory consumption was 212.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.6s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1457 SDtfs, 1692 SDslu, 2645 SDs, 0 SdLazy, 1831 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 17 SyntacticMatches, 9 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred 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: 1.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 6202 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 425 NumberOfCodeBlocks, 425 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 361 ConstructedInterpolants, 0 QuantifiedInterpolants, 47743 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...