/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:56:24,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:56:24,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:56:24,820 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:56:24,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:56:24,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:56:24,824 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:56:24,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:56:24,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:56:24,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:56:24,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:56:24,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:56:24,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:56:24,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:56:24,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:56:24,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:56:24,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:56:24,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:56:24,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:56:24,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:56:24,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:56:24,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:56:24,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:56:24,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:56:24,875 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:56:24,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:56:24,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:56:24,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:56:24,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:56:24,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:56:24,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:56:24,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:56:24,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:56:24,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:56:24,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:56:24,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:56:24,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:56:24,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:56:24,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:56:24,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:56:24,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:56:24,888 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:56:24,921 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:56:24,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:56:24,926 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:56:24,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:56:24,926 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:56:24,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:56:24,926 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:56:24,927 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:56:24,927 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:56:24,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:56:24,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:56:24,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:56:24,928 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:56:24,928 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:56:24,928 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:56:24,928 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:56:24,928 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:56:24,928 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:56:24,930 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:56:24,930 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:56:24,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:56:24,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:56:24,931 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:56:24,931 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:56:24,931 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:56:24,931 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:56:24,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:56:24,932 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:56:24,932 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:56:24,932 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:56:25,216 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:56:25,235 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:56:25,240 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:56:25,241 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:56:25,242 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:56:25,243 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_rmo.opt.i [2019-12-18 13:56:25,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a1409ec3/f1727fce0c014819841a0f88fb746ad5/FLAG738357ced [2019-12-18 13:56:25,901 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:56:25,902 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_rmo.opt.i [2019-12-18 13:56:25,918 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a1409ec3/f1727fce0c014819841a0f88fb746ad5/FLAG738357ced [2019-12-18 13:56:26,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a1409ec3/f1727fce0c014819841a0f88fb746ad5 [2019-12-18 13:56:26,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:56:26,177 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:56:26,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:56:26,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:56:26,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:56:26,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:56:26" (1/1) ... [2019-12-18 13:56:26,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71749be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:26, skipping insertion in model container [2019-12-18 13:56:26,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:56:26" (1/1) ... [2019-12-18 13:56:26,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:56:26,265 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:56:26,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:56:26,967 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:56:27,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:56:27,138 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:56:27,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27 WrapperNode [2019-12-18 13:56:27,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:56:27,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:56:27,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:56:27,140 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:56:27,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (1/1) ... [2019-12-18 13:56:27,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (1/1) ... [2019-12-18 13:56:27,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:56:27,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:56:27,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:56:27,216 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:56:27,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (1/1) ... [2019-12-18 13:56:27,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (1/1) ... [2019-12-18 13:56:27,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (1/1) ... [2019-12-18 13:56:27,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (1/1) ... [2019-12-18 13:56:27,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (1/1) ... [2019-12-18 13:56:27,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (1/1) ... [2019-12-18 13:56:27,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (1/1) ... [2019-12-18 13:56:27,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:56:27,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:56:27,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:56:27,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:56:27,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:56:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:56:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:56:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:56:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:56:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:56:27,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:56:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:56:27,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:56:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:56:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:56:27,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:56:27,341 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:56:28,084 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:56:28,084 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:56:28,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:56:28 BoogieIcfgContainer [2019-12-18 13:56:28,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:56:28,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:56:28,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:56:28,091 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:56:28,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:56:26" (1/3) ... [2019-12-18 13:56:28,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfe425a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:56:28, skipping insertion in model container [2019-12-18 13:56:28,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:27" (2/3) ... [2019-12-18 13:56:28,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfe425a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:56:28, skipping insertion in model container [2019-12-18 13:56:28,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:56:28" (3/3) ... [2019-12-18 13:56:28,096 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_rmo.opt.i [2019-12-18 13:56:28,106 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:56:28,107 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:56:28,117 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:56:28,118 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:56:28,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,154 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,155 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,163 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,163 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,164 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,164 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,164 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,178 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,178 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,181 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,181 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,182 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:28,213 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 13:56:28,234 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:56:28,234 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:56:28,234 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:56:28,234 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:56:28,235 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:56:28,235 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:56:28,235 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:56:28,235 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:56:28,252 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-18 13:56:28,254 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 13:56:28,336 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 13:56:28,336 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:56:28,355 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:56:28,373 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 13:56:28,430 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 13:56:28,430 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:56:28,435 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:56:28,448 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 13:56:28,449 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:56:32,734 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-18 13:56:32,875 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-18 13:56:32,936 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46078 [2019-12-18 13:56:32,936 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-18 13:56:32,940 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-18 13:56:33,461 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8413 states. [2019-12-18 13:56:33,464 INFO L276 IsEmpty]: Start isEmpty. Operand 8413 states. [2019-12-18 13:56:33,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 13:56:33,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:33,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 13:56:33,475 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:33,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:33,482 INFO L82 PathProgramCache]: Analyzing trace with hash 693777882, now seen corresponding path program 1 times [2019-12-18 13:56:33,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:33,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545254738] [2019-12-18 13:56:33,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:33,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:33,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545254738] [2019-12-18 13:56:33,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:33,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:56:33,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009447284] [2019-12-18 13:56:33,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:33,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:33,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:33,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:33,772 INFO L87 Difference]: Start difference. First operand 8413 states. Second operand 3 states. [2019-12-18 13:56:34,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:34,068 INFO L93 Difference]: Finished difference Result 8377 states and 27415 transitions. [2019-12-18 13:56:34,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:34,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 13:56:34,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:34,169 INFO L225 Difference]: With dead ends: 8377 [2019-12-18 13:56:34,169 INFO L226 Difference]: Without dead ends: 8208 [2019-12-18 13:56:34,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:34,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8208 states. [2019-12-18 13:56:34,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8208 to 8208. [2019-12-18 13:56:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8208 states. [2019-12-18 13:56:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8208 states to 8208 states and 26895 transitions. [2019-12-18 13:56:34,670 INFO L78 Accepts]: Start accepts. Automaton has 8208 states and 26895 transitions. Word has length 5 [2019-12-18 13:56:34,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:34,671 INFO L462 AbstractCegarLoop]: Abstraction has 8208 states and 26895 transitions. [2019-12-18 13:56:34,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 8208 states and 26895 transitions. [2019-12-18 13:56:34,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:56:34,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:34,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:34,674 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:34,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:34,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2143808117, now seen corresponding path program 1 times [2019-12-18 13:56:34,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:34,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710898285] [2019-12-18 13:56:34,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:34,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:34,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710898285] [2019-12-18 13:56:34,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:34,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:56:34,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833601726] [2019-12-18 13:56:34,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:34,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:34,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:34,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:34,746 INFO L87 Difference]: Start difference. First operand 8208 states and 26895 transitions. Second operand 3 states. [2019-12-18 13:56:34,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:34,784 INFO L93 Difference]: Finished difference Result 1326 states and 3037 transitions. [2019-12-18 13:56:34,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:34,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 13:56:34,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:34,794 INFO L225 Difference]: With dead ends: 1326 [2019-12-18 13:56:34,794 INFO L226 Difference]: Without dead ends: 1326 [2019-12-18 13:56:34,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:34,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2019-12-18 13:56:34,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1326. [2019-12-18 13:56:34,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2019-12-18 13:56:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 3037 transitions. [2019-12-18 13:56:34,853 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 3037 transitions. Word has length 11 [2019-12-18 13:56:34,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:34,854 INFO L462 AbstractCegarLoop]: Abstraction has 1326 states and 3037 transitions. [2019-12-18 13:56:34,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:34,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 3037 transitions. [2019-12-18 13:56:34,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:56:34,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:34,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:34,858 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:34,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:34,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1923085964, now seen corresponding path program 1 times [2019-12-18 13:56:34,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:34,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744674477] [2019-12-18 13:56:34,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:35,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:35,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744674477] [2019-12-18 13:56:35,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:35,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:56:35,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774819158] [2019-12-18 13:56:35,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:56:35,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:35,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:56:35,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:56:35,014 INFO L87 Difference]: Start difference. First operand 1326 states and 3037 transitions. Second operand 4 states. [2019-12-18 13:56:35,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:35,312 INFO L93 Difference]: Finished difference Result 1806 states and 4001 transitions. [2019-12-18 13:56:35,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:56:35,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:56:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:35,322 INFO L225 Difference]: With dead ends: 1806 [2019-12-18 13:56:35,322 INFO L226 Difference]: Without dead ends: 1806 [2019-12-18 13:56:35,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:56:35,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2019-12-18 13:56:35,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1654. [2019-12-18 13:56:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-12-18 13:56:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 3712 transitions. [2019-12-18 13:56:35,370 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 3712 transitions. Word has length 11 [2019-12-18 13:56:35,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:35,371 INFO L462 AbstractCegarLoop]: Abstraction has 1654 states and 3712 transitions. [2019-12-18 13:56:35,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:56:35,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 3712 transitions. [2019-12-18 13:56:35,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 13:56:35,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:35,374 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] [2019-12-18 13:56:35,375 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:35,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:35,375 INFO L82 PathProgramCache]: Analyzing trace with hash 909891733, now seen corresponding path program 1 times [2019-12-18 13:56:35,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:35,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813062148] [2019-12-18 13:56:35,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:35,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:35,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813062148] [2019-12-18 13:56:35,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:35,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:56:35,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419563544] [2019-12-18 13:56:35,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:56:35,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:35,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:56:35,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:56:35,493 INFO L87 Difference]: Start difference. First operand 1654 states and 3712 transitions. Second operand 4 states. [2019-12-18 13:56:35,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:35,514 INFO L93 Difference]: Finished difference Result 356 states and 659 transitions. [2019-12-18 13:56:35,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:56:35,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-18 13:56:35,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:35,516 INFO L225 Difference]: With dead ends: 356 [2019-12-18 13:56:35,516 INFO L226 Difference]: Without dead ends: 356 [2019-12-18 13:56:35,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:56:35,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-12-18 13:56:35,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 321. [2019-12-18 13:56:35,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-18 13:56:35,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 594 transitions. [2019-12-18 13:56:35,527 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 594 transitions. Word has length 23 [2019-12-18 13:56:35,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:35,527 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 594 transitions. [2019-12-18 13:56:35,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:56:35,527 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 594 transitions. [2019-12-18 13:56:35,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:56:35,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:35,531 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-18 13:56:35,532 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:35,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:35,533 INFO L82 PathProgramCache]: Analyzing trace with hash 763517816, now seen corresponding path program 1 times [2019-12-18 13:56:35,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:35,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452287621] [2019-12-18 13:56:35,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:35,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:35,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452287621] [2019-12-18 13:56:35,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:35,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:56:35,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213375998] [2019-12-18 13:56:35,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:35,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:35,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:35,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:35,647 INFO L87 Difference]: Start difference. First operand 321 states and 594 transitions. Second operand 3 states. [2019-12-18 13:56:35,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:35,704 INFO L93 Difference]: Finished difference Result 331 states and 608 transitions. [2019-12-18 13:56:35,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:35,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 13:56:35,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:35,708 INFO L225 Difference]: With dead ends: 331 [2019-12-18 13:56:35,709 INFO L226 Difference]: Without dead ends: 331 [2019-12-18 13:56:35,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:35,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-18 13:56:35,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2019-12-18 13:56:35,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-18 13:56:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 604 transitions. [2019-12-18 13:56:35,721 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 604 transitions. Word has length 52 [2019-12-18 13:56:35,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:35,725 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 604 transitions. [2019-12-18 13:56:35,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:35,725 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 604 transitions. [2019-12-18 13:56:35,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:56:35,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:35,730 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-18 13:56:35,730 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:35,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:35,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1269350019, now seen corresponding path program 1 times [2019-12-18 13:56:35,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:35,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895525310] [2019-12-18 13:56:35,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:35,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:35,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895525310] [2019-12-18 13:56:35,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:35,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:56:35,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056325721] [2019-12-18 13:56:35,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:56:35,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:35,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:56:35,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:56:35,894 INFO L87 Difference]: Start difference. First operand 327 states and 604 transitions. Second operand 5 states. [2019-12-18 13:56:36,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:36,115 INFO L93 Difference]: Finished difference Result 458 states and 840 transitions. [2019-12-18 13:56:36,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:56:36,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-18 13:56:36,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:36,120 INFO L225 Difference]: With dead ends: 458 [2019-12-18 13:56:36,120 INFO L226 Difference]: Without dead ends: 458 [2019-12-18 13:56:36,121 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-18 13:56:36,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-12-18 13:56:36,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 374. [2019-12-18 13:56:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-12-18 13:56:36,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 695 transitions. [2019-12-18 13:56:36,130 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 695 transitions. Word has length 52 [2019-12-18 13:56:36,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:36,130 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 695 transitions. [2019-12-18 13:56:36,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:56:36,130 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 695 transitions. [2019-12-18 13:56:36,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:56:36,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:36,132 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-18 13:56:36,132 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:36,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:36,133 INFO L82 PathProgramCache]: Analyzing trace with hash 544633013, now seen corresponding path program 2 times [2019-12-18 13:56:36,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:36,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473650846] [2019-12-18 13:56:36,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:36,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:36,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473650846] [2019-12-18 13:56:36,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:36,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:56:36,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195719782] [2019-12-18 13:56:36,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:56:36,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:36,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:56:36,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:56:36,268 INFO L87 Difference]: Start difference. First operand 374 states and 695 transitions. Second operand 6 states. [2019-12-18 13:56:36,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:36,604 INFO L93 Difference]: Finished difference Result 513 states and 942 transitions. [2019-12-18 13:56:36,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:56:36,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 13:56:36,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:36,610 INFO L225 Difference]: With dead ends: 513 [2019-12-18 13:56:36,610 INFO L226 Difference]: Without dead ends: 513 [2019-12-18 13:56:36,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:56:36,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-12-18 13:56:36,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 406. [2019-12-18 13:56:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-18 13:56:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 754 transitions. [2019-12-18 13:56:36,621 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 754 transitions. Word has length 52 [2019-12-18 13:56:36,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:36,621 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 754 transitions. [2019-12-18 13:56:36,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:56:36,622 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 754 transitions. [2019-12-18 13:56:36,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:56:36,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:36,623 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-18 13:56:36,623 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:36,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:36,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1227473235, now seen corresponding path program 3 times [2019-12-18 13:56:36,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:36,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609335599] [2019-12-18 13:56:36,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:36,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:36,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609335599] [2019-12-18 13:56:36,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:36,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:56:36,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199667547] [2019-12-18 13:56:36,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:56:36,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:36,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:56:36,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:56:36,720 INFO L87 Difference]: Start difference. First operand 406 states and 754 transitions. Second operand 6 states. [2019-12-18 13:56:37,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:37,044 INFO L93 Difference]: Finished difference Result 694 states and 1274 transitions. [2019-12-18 13:56:37,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:56:37,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 13:56:37,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:37,049 INFO L225 Difference]: With dead ends: 694 [2019-12-18 13:56:37,049 INFO L226 Difference]: Without dead ends: 694 [2019-12-18 13:56:37,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:56:37,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-12-18 13:56:37,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 445. [2019-12-18 13:56:37,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-12-18 13:56:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 833 transitions. [2019-12-18 13:56:37,064 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 833 transitions. Word has length 52 [2019-12-18 13:56:37,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:37,064 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 833 transitions. [2019-12-18 13:56:37,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:56:37,065 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 833 transitions. [2019-12-18 13:56:37,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:56:37,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:37,066 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-18 13:56:37,067 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:37,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:37,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1833025349, now seen corresponding path program 4 times [2019-12-18 13:56:37,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:37,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81743938] [2019-12-18 13:56:37,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:37,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:37,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81743938] [2019-12-18 13:56:37,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:37,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:56:37,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072294075] [2019-12-18 13:56:37,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:37,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:37,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:37,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:37,166 INFO L87 Difference]: Start difference. First operand 445 states and 833 transitions. Second operand 3 states. [2019-12-18 13:56:37,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:37,179 INFO L93 Difference]: Finished difference Result 406 states and 739 transitions. [2019-12-18 13:56:37,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:37,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 13:56:37,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:37,182 INFO L225 Difference]: With dead ends: 406 [2019-12-18 13:56:37,182 INFO L226 Difference]: Without dead ends: 406 [2019-12-18 13:56:37,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:37,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-18 13:56:37,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2019-12-18 13:56:37,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-18 13:56:37,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 739 transitions. [2019-12-18 13:56:37,191 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 739 transitions. Word has length 52 [2019-12-18 13:56:37,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:37,191 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 739 transitions. [2019-12-18 13:56:37,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:37,192 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 739 transitions. [2019-12-18 13:56:37,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 13:56:37,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:37,193 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:37,193 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:37,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:37,194 INFO L82 PathProgramCache]: Analyzing trace with hash 513839464, now seen corresponding path program 1 times [2019-12-18 13:56:37,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:37,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288580400] [2019-12-18 13:56:37,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:37,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:37,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288580400] [2019-12-18 13:56:37,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:37,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:56:37,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434219957] [2019-12-18 13:56:37,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:37,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:37,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:37,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:37,263 INFO L87 Difference]: Start difference. First operand 406 states and 739 transitions. Second operand 3 states. [2019-12-18 13:56:37,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:37,302 INFO L93 Difference]: Finished difference Result 406 states and 738 transitions. [2019-12-18 13:56:37,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:37,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 13:56:37,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:37,305 INFO L225 Difference]: With dead ends: 406 [2019-12-18 13:56:37,306 INFO L226 Difference]: Without dead ends: 406 [2019-12-18 13:56:37,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:37,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-18 13:56:37,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 273. [2019-12-18 13:56:37,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-12-18 13:56:37,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 496 transitions. [2019-12-18 13:56:37,314 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 496 transitions. Word has length 53 [2019-12-18 13:56:37,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:37,314 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 496 transitions. [2019-12-18 13:56:37,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:37,314 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 496 transitions. [2019-12-18 13:56:37,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 13:56:37,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:37,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:37,317 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:37,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:37,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1221221950, now seen corresponding path program 1 times [2019-12-18 13:56:37,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:37,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44852900] [2019-12-18 13:56:37,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:37,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:37,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44852900] [2019-12-18 13:56:37,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:37,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:56:37,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377854459] [2019-12-18 13:56:37,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:56:37,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:37,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:56:37,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:56:37,548 INFO L87 Difference]: Start difference. First operand 273 states and 496 transitions. Second operand 6 states. [2019-12-18 13:56:37,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:37,630 INFO L93 Difference]: Finished difference Result 463 states and 834 transitions. [2019-12-18 13:56:37,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:56:37,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 13:56:37,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:37,633 INFO L225 Difference]: With dead ends: 463 [2019-12-18 13:56:37,633 INFO L226 Difference]: Without dead ends: 209 [2019-12-18 13:56:37,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:56:37,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-12-18 13:56:37,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-12-18 13:56:37,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-18 13:56:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 369 transitions. [2019-12-18 13:56:37,639 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 369 transitions. Word has length 54 [2019-12-18 13:56:37,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:37,639 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 369 transitions. [2019-12-18 13:56:37,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:56:37,639 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 369 transitions. [2019-12-18 13:56:37,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 13:56:37,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:37,640 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:37,641 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:37,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:37,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2120402622, now seen corresponding path program 2 times [2019-12-18 13:56:37,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:37,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146538029] [2019-12-18 13:56:37,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:37,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146538029] [2019-12-18 13:56:37,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:37,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:56:37,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142254003] [2019-12-18 13:56:37,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:56:37,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:37,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:56:37,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:56:37,863 INFO L87 Difference]: Start difference. First operand 209 states and 369 transitions. Second operand 12 states. [2019-12-18 13:56:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:38,316 INFO L93 Difference]: Finished difference Result 376 states and 647 transitions. [2019-12-18 13:56:38,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 13:56:38,316 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-18 13:56:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:38,318 INFO L225 Difference]: With dead ends: 376 [2019-12-18 13:56:38,319 INFO L226 Difference]: Without dead ends: 343 [2019-12-18 13:56:38,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:56:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-12-18 13:56:38,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 309. [2019-12-18 13:56:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-12-18 13:56:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 540 transitions. [2019-12-18 13:56:38,327 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 540 transitions. Word has length 54 [2019-12-18 13:56:38,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:38,327 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 540 transitions. [2019-12-18 13:56:38,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:56:38,327 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 540 transitions. [2019-12-18 13:56:38,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 13:56:38,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:38,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:38,329 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:38,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:38,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1229989646, now seen corresponding path program 3 times [2019-12-18 13:56:38,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:38,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197319934] [2019-12-18 13:56:38,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:56:38,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197319934] [2019-12-18 13:56:38,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:38,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:56:38,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748809044] [2019-12-18 13:56:38,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:56:38,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:38,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:56:38,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:56:38,648 INFO L87 Difference]: Start difference. First operand 309 states and 540 transitions. Second operand 13 states. [2019-12-18 13:56:39,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:39,188 INFO L93 Difference]: Finished difference Result 414 states and 701 transitions. [2019-12-18 13:56:39,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 13:56:39,189 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 13:56:39,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:39,192 INFO L225 Difference]: With dead ends: 414 [2019-12-18 13:56:39,193 INFO L226 Difference]: Without dead ends: 379 [2019-12-18 13:56:39,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-12-18 13:56:39,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-12-18 13:56:39,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 317. [2019-12-18 13:56:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-18 13:56:39,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 554 transitions. [2019-12-18 13:56:39,200 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 554 transitions. Word has length 54 [2019-12-18 13:56:39,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:39,201 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 554 transitions. [2019-12-18 13:56:39,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:56:39,201 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 554 transitions. [2019-12-18 13:56:39,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 13:56:39,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:39,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:56:39,202 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:39,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:39,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1631137646, now seen corresponding path program 4 times [2019-12-18 13:56:39,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:39,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20236786] [2019-12-18 13:56:39,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:56:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:56:39,297 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:56:39,298 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:56:39,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1451~0.base_22| 4)) (= |v_ULTIMATE.start_main_~#t1451~0.offset_17| 0) (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff0_thd0~0_317 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1451~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1451~0.base_22|) |v_ULTIMATE.start_main_~#t1451~0.offset_17| 0)) |v_#memory_int_13|) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$r_buff1_thd2~0_153) (= 0 v_~x~0_144) (= v_~x$r_buff0_thd1~0_115 0) (= 0 v_~__unbuffered_cnt~0_78) (= v_~__unbuffered_p1_EAX~0_103 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1451~0.base_22|) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~x$w_buff1_used~0_381) (= v_~x$flush_delayed~0_36 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x$r_buff0_thd2~0_168) (= 0 v_~x$w_buff1~0_166) (= |v_#NULL.offset_4| 0) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t1451~0.base_22| 1)) (= v_~main$tmp_guard1~0_24 0) (= v_~y~0_67 0) (= 0 v_~x$w_buff0~0_193) (= v_~x$r_buff1_thd0~0_243 0) (= v_~main$tmp_guard0~0_24 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1451~0.base_22|) 0) (= v_~weak$$choice2~0_114 0) (= 0 v_~weak$$choice0~0_12) (= 0 v_~x$w_buff0_used~0_609) (= v_~x$r_buff1_thd1~0_167 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_193, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_44|, ~x$flush_delayed~0=v_~x$flush_delayed~0_36, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_167, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_139|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_31|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_~#t1452~0.base=|v_ULTIMATE.start_main_~#t1452~0.base_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_103, #length=|v_#length_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_317, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_19|, ~x$w_buff1~0=v_~x$w_buff1~0_166, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_28|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_381, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_153, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, ~x~0=v_~x~0_144, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_115, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_25|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_40|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_25|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_32|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_36|, ~y~0=v_~y~0_67, ULTIMATE.start_main_~#t1451~0.base=|v_ULTIMATE.start_main_~#t1451~0.base_22|, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_39|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_243, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_168, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_29|, ULTIMATE.start_main_~#t1452~0.offset=|v_ULTIMATE.start_main_~#t1452~0.offset_14|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_609, ULTIMATE.start_main_~#t1451~0.offset=|v_ULTIMATE.start_main_~#t1451~0.offset_17|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_21|, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1452~0.base, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_~#t1451~0.base, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1452~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1451~0.offset, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 13:56:39,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L779-1-->L781: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1452~0.base_10|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1452~0.base_10| 4)) (not (= |v_ULTIMATE.start_main_~#t1452~0.base_10| 0)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1452~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1452~0.base_10|) |v_ULTIMATE.start_main_~#t1452~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t1452~0.offset_9| 0) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1452~0.base_10| 1)) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1452~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1452~0.offset=|v_ULTIMATE.start_main_~#t1452~0.offset_9|, ULTIMATE.start_main_~#t1452~0.base=|v_ULTIMATE.start_main_~#t1452~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1452~0.offset, ULTIMATE.start_main_~#t1452~0.base] because there is no mapped edge [2019-12-18 13:56:39,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_17| v_P1Thread1of1ForFork1_~arg.offset_17) (= 2 v_~x$w_buff0~0_54) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_19 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|) (= 0 (mod v_~x$w_buff1_used~0_127 256)) (= 1 v_~x$w_buff0_used~0_216) (= v_~x$w_buff0~0_55 v_~x$w_buff1~0_48) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|) (= v_~x$w_buff0_used~0_217 v_~x$w_buff1_used~0_127) (= v_P1Thread1of1ForFork1_~arg.base_17 |v_P1Thread1of1ForFork1_#in~arg.base_17|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_55, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_217} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_19, ~x$w_buff0~0=v_~x$w_buff0~0_54, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_17, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_17, ~x$w_buff1~0=v_~x$w_buff1~0_48, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_216} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 13:56:39,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L728-2-->L728-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-781357143 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-781357143 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-781357143| |P0Thread1of1ForFork0_#t~ite4_Out-781357143|))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out-781357143| ~x$w_buff1~0_In-781357143) (not .cse1) .cse2) (and (= ~x~0_In-781357143 |P0Thread1of1ForFork0_#t~ite3_Out-781357143|) (or .cse1 .cse0) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-781357143, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-781357143, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-781357143, ~x~0=~x~0_In-781357143} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-781357143|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-781357143|, ~x$w_buff1~0=~x$w_buff1~0_In-781357143, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-781357143, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-781357143, ~x~0=~x~0_In-781357143} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 13:56:39,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L729-->L729-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1679989650 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1679989650 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1679989650| 0)) (and (= ~x$w_buff0_used~0_In-1679989650 |P0Thread1of1ForFork0_#t~ite5_Out-1679989650|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1679989650, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1679989650} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1679989650|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1679989650, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1679989650} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:56:39,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L730-->L730-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd1~0_In-2142873137 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2142873137 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-2142873137 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-2142873137 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-2142873137|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-2142873137 |P0Thread1of1ForFork0_#t~ite6_Out-2142873137|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2142873137, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2142873137, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2142873137, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2142873137} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2142873137|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2142873137, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2142873137, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2142873137, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2142873137} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:56:39,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-119543798 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-119543798 256) 0))) (or (and (= ~x$w_buff0_used~0_In-119543798 |P1Thread1of1ForFork1_#t~ite11_Out-119543798|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-119543798|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-119543798, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-119543798} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-119543798|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-119543798, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-119543798} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 13:56:39,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1932379378 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1932379378 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out1932379378| ~x$r_buff0_thd1~0_In1932379378) (or .cse0 .cse1)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out1932379378| 0) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1932379378, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1932379378} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1932379378, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1932379378|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1932379378} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 13:56:39,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L732-->L732-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-383154282 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-383154282 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-383154282 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In-383154282 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-383154282| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-383154282| ~x$r_buff1_thd1~0_In-383154282)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-383154282, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-383154282, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-383154282, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-383154282} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-383154282, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-383154282|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-383154282, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-383154282, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-383154282} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:56:39,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L732-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_125 |v_P0Thread1of1ForFork0_#t~ite8_38|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_37|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_125} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 13:56:39,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L758-->L758-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1414102190 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-1414102190 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1414102190 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1414102190 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1414102190| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite12_Out-1414102190| ~x$w_buff1_used~0_In-1414102190) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1414102190, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1414102190, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1414102190, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1414102190} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1414102190, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1414102190, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1414102190|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1414102190, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1414102190} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 13:56:39,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L759-->L760: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In176610647 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In176610647 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In176610647 ~x$r_buff0_thd2~0_Out176610647)) (and (= 0 ~x$r_buff0_thd2~0_Out176610647) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In176610647, ~x$w_buff0_used~0=~x$w_buff0_used~0_In176610647} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out176610647|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out176610647, ~x$w_buff0_used~0=~x$w_buff0_used~0_In176610647} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 13:56:39,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L760-->L760-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In1075856403 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1075856403 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1075856403 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1075856403 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1075856403|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite14_Out1075856403| ~x$r_buff1_thd2~0_In1075856403)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1075856403, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1075856403, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1075856403, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1075856403} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1075856403, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1075856403, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1075856403, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1075856403|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1075856403} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 13:56:39,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_125 |v_P1Thread1of1ForFork1_#t~ite14_36|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_36|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_125, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_35|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 13:56:39,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [586] [586] L781-1-->L787: Formula: (and (= 2 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:56:39,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L787-2-->L787-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In200737589 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In200737589 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite18_Out200737589| |ULTIMATE.start_main_#t~ite17_Out200737589|))) (or (and (not .cse0) (= ~x$w_buff1~0_In200737589 |ULTIMATE.start_main_#t~ite17_Out200737589|) (not .cse1) .cse2) (and (or .cse1 .cse0) (= ~x~0_In200737589 |ULTIMATE.start_main_#t~ite17_Out200737589|) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In200737589, ~x$w_buff1_used~0=~x$w_buff1_used~0_In200737589, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In200737589, ~x~0=~x~0_In200737589} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out200737589|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out200737589|, ~x$w_buff1~0=~x$w_buff1~0_In200737589, ~x$w_buff1_used~0=~x$w_buff1_used~0_In200737589, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In200737589, ~x~0=~x~0_In200737589} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-18 13:56:39,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1149249772 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1149249772 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite19_Out1149249772|)) (and (= ~x$w_buff0_used~0_In1149249772 |ULTIMATE.start_main_#t~ite19_Out1149249772|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1149249772, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1149249772} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1149249772, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1149249772|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1149249772} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 13:56:39,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In958330936 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In958330936 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In958330936 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In958330936 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite20_Out958330936|)) (and (= ~x$w_buff1_used~0_In958330936 |ULTIMATE.start_main_#t~ite20_Out958330936|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In958330936, ~x$w_buff1_used~0=~x$w_buff1_used~0_In958330936, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In958330936, ~x$w_buff0_used~0=~x$w_buff0_used~0_In958330936} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In958330936, ~x$w_buff1_used~0=~x$w_buff1_used~0_In958330936, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out958330936|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In958330936, ~x$w_buff0_used~0=~x$w_buff0_used~0_In958330936} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 13:56:39,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L790-->L790-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In410235575 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In410235575 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out410235575|)) (and (= |ULTIMATE.start_main_#t~ite21_Out410235575| ~x$r_buff0_thd0~0_In410235575) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In410235575, ~x$w_buff0_used~0=~x$w_buff0_used~0_In410235575} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In410235575, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out410235575|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In410235575} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 13:56:39,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In1850328582 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1850328582 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1850328582 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1850328582 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out1850328582|)) (and (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In1850328582 |ULTIMATE.start_main_#t~ite22_Out1850328582|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1850328582, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1850328582, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1850328582, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1850328582} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1850328582, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1850328582, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1850328582, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1850328582|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1850328582} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 13:56:39,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L800-->L800-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In706137221 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite32_Out706137221| |ULTIMATE.start_main_#t~ite31_Out706137221|) .cse0 (= |ULTIMATE.start_main_#t~ite31_Out706137221| ~x$w_buff1~0_In706137221) (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In706137221 256) 0))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In706137221 256) 0)) (and .cse1 (= (mod ~x$r_buff1_thd0~0_In706137221 256) 0)) (= (mod ~x$w_buff0_used~0_In706137221 256) 0)))) (and (= |ULTIMATE.start_main_#t~ite31_In706137221| |ULTIMATE.start_main_#t~ite31_Out706137221|) (not .cse0) (= |ULTIMATE.start_main_#t~ite32_Out706137221| ~x$w_buff1~0_In706137221)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In706137221, ~x$w_buff1~0=~x$w_buff1~0_In706137221, ~x$w_buff1_used~0=~x$w_buff1_used~0_In706137221, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In706137221, ~weak$$choice2~0=~weak$$choice2~0_In706137221, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In706137221|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In706137221} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In706137221, ~x$w_buff1~0=~x$w_buff1~0_In706137221, ~x$w_buff1_used~0=~x$w_buff1_used~0_In706137221, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out706137221|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In706137221, ~weak$$choice2~0=~weak$$choice2~0_In706137221, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out706137221|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In706137221} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-18 13:56:39,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L803-->L804: Formula: (and (= v_~x$r_buff0_thd0~0_125 v_~x$r_buff0_thd0~0_124) (not (= (mod v_~weak$$choice2~0_35 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_35} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_35} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 13:56:39,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L806-->L809-1: Formula: (and (not (= (mod v_~x$flush_delayed~0_27 256) 0)) (= v_~x$mem_tmp~0_15 v_~x~0_118) (= v_~x$flush_delayed~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_15 256))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_118, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:56:39,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 13:56:39,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:56:39 BasicIcfg [2019-12-18 13:56:39,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:56:39,406 INFO L168 Benchmark]: Toolchain (without parser) took 13227.41 ms. Allocated memory was 147.8 MB in the beginning and 390.6 MB in the end (delta: 242.7 MB). Free memory was 104.3 MB in the beginning and 199.5 MB in the end (delta: -95.2 MB). Peak memory consumption was 147.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:39,407 INFO L168 Benchmark]: CDTParser took 0.53 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.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 13:56:39,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 960.19 ms. Allocated memory was 147.8 MB in the beginning and 206.0 MB in the end (delta: 58.2 MB). Free memory was 104.1 MB in the beginning and 161.0 MB in the end (delta: -56.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:39,409 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.84 ms. Allocated memory is still 206.0 MB. Free memory was 160.3 MB in the beginning and 157.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:39,410 INFO L168 Benchmark]: Boogie Preprocessor took 44.30 ms. Allocated memory is still 206.0 MB. Free memory was 157.8 MB in the beginning and 155.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:39,410 INFO L168 Benchmark]: RCFGBuilder took 825.79 ms. Allocated memory is still 206.0 MB. Free memory was 155.2 MB in the beginning and 111.2 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:39,415 INFO L168 Benchmark]: TraceAbstraction took 11314.19 ms. Allocated memory was 206.0 MB in the beginning and 390.6 MB in the end (delta: 184.5 MB). Free memory was 110.6 MB in the beginning and 199.5 MB in the end (delta: -88.9 MB). Peak memory consumption was 95.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:39,423 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.53 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.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 960.19 ms. Allocated memory was 147.8 MB in the beginning and 206.0 MB in the end (delta: 58.2 MB). Free memory was 104.1 MB in the beginning and 161.0 MB in the end (delta: -56.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.84 ms. Allocated memory is still 206.0 MB. Free memory was 160.3 MB in the beginning and 157.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.30 ms. Allocated memory is still 206.0 MB. Free memory was 157.8 MB in the beginning and 155.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 825.79 ms. Allocated memory is still 206.0 MB. Free memory was 155.2 MB in the beginning and 111.2 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11314.19 ms. Allocated memory was 206.0 MB in the beginning and 390.6 MB in the end (delta: 184.5 MB). Free memory was 110.6 MB in the beginning and 199.5 MB in the end (delta: -88.9 MB). Peak memory consumption was 95.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 146 ProgramPointsBefore, 78 ProgramPointsAfterwards, 180 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 25 ChoiceCompositions, 3816 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 52 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 46078 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t1451, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] FCALL, FORK 0 pthread_create(&t1452, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L748] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L749] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L750] 2 x$r_buff0_thd2 = (_Bool)1 [L753] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 1 y = 1 [L725] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L731] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 x$flush_delayed = weak$$choice2 [L797] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.0s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1280 SDtfs, 1034 SDslu, 2815 SDs, 0 SdLazy, 1601 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 23 SyntacticMatches, 10 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8413occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 860 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 579 NumberOfCodeBlocks, 579 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 512 ConstructedInterpolants, 0 QuantifiedInterpolants, 87768 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...