/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:03:12,818 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:03:12,820 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:03:12,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:03:12,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:03:12,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:03:12,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:03:12,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:03:12,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:03:12,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:03:12,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:03:12,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:03:12,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:03:12,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:03:12,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:03:12,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:03:12,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:03:12,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:03:12,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:03:12,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:03:12,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:03:12,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:03:12,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:03:12,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:03:12,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:03:12,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:03:12,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:03:12,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:03:12,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:03:12,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:03:12,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:03:12,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:03:12,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:03:12,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:03:12,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:03:12,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:03:12,890 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:03:12,890 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:03:12,891 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:03:12,892 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:03:12,892 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:03:12,896 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:03:12,911 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:03:12,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:03:12,912 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:03:12,913 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:03:12,913 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:03:12,913 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:03:12,913 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:03:12,913 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:03:12,914 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:03:12,914 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:03:12,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:03:12,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:03:12,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:03:12,915 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:03:12,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:03:12,915 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:03:12,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:03:12,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:03:12,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:03:12,916 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:03:12,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:03:12,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:03:12,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:03:12,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:03:12,917 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:03:12,917 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:03:12,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:03:12,918 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:03:12,918 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:03:12,918 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:03:13,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:03:13,250 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:03:13,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:03:13,255 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:03:13,256 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:03:13,257 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.opt.i [2019-12-18 22:03:13,333 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253bf88fb/510ce9643c9a470b82aa934970ac8a06/FLAGa536869f2 [2019-12-18 22:03:13,885 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:03:13,886 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.opt.i [2019-12-18 22:03:13,908 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253bf88fb/510ce9643c9a470b82aa934970ac8a06/FLAGa536869f2 [2019-12-18 22:03:14,227 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253bf88fb/510ce9643c9a470b82aa934970ac8a06 [2019-12-18 22:03:14,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:03:14,237 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:03:14,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:03:14,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:03:14,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:03:14,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:03:14" (1/1) ... [2019-12-18 22:03:14,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f71d8ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:14, skipping insertion in model container [2019-12-18 22:03:14,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:03:14" (1/1) ... [2019-12-18 22:03:14,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:03:14,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:03:14,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:03:14,860 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:03:14,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:03:15,001 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:03:15,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:15 WrapperNode [2019-12-18 22:03:15,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:03:15,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:03:15,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:03:15,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:03:15,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:15" (1/1) ... [2019-12-18 22:03:15,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:15" (1/1) ... [2019-12-18 22:03:15,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:03:15,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:03:15,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:03:15,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:03:15,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:15" (1/1) ... [2019-12-18 22:03:15,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:15" (1/1) ... [2019-12-18 22:03:15,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:15" (1/1) ... [2019-12-18 22:03:15,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:15" (1/1) ... [2019-12-18 22:03:15,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:15" (1/1) ... [2019-12-18 22:03:15,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:15" (1/1) ... [2019-12-18 22:03:15,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:15" (1/1) ... [2019-12-18 22:03:15,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:03:15,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:03:15,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:03:15,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:03:15,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:15" (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 22:03:15,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:03:15,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:03:15,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:03:15,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:03:15,179 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:03:15,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:03:15,180 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:03:15,181 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:03:15,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:03:15,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:03:15,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:03:15,183 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 22:03:15,841 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:03:15,841 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:03:15,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:03:15 BoogieIcfgContainer [2019-12-18 22:03:15,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:03:15,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:03:15,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:03:15,847 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:03:15,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:03:14" (1/3) ... [2019-12-18 22:03:15,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1711a544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:03:15, skipping insertion in model container [2019-12-18 22:03:15,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:15" (2/3) ... [2019-12-18 22:03:15,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1711a544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:03:15, skipping insertion in model container [2019-12-18 22:03:15,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:03:15" (3/3) ... [2019-12-18 22:03:15,851 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_power.opt.i [2019-12-18 22:03:15,862 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:03:15,862 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:03:15,869 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:03:15,870 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:03:15,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,909 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,910 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,935 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,936 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,936 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,936 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,937 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,947 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,947 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,948 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,953 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,954 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:15,977 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 22:03:15,999 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:03:15,999 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:03:15,999 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:03:16,000 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:03:16,000 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:03:16,015 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:03:16,015 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:03:16,015 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:03:16,036 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 164 transitions [2019-12-18 22:03:16,038 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-18 22:03:16,140 INFO L126 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-18 22:03:16,140 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:03:16,156 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 22:03:16,172 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-18 22:03:16,207 INFO L126 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-18 22:03:16,208 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:03:16,213 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 22:03:16,226 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-18 22:03:16,227 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:03:19,405 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 22:03:19,516 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 22:03:19,552 INFO L206 etLargeBlockEncoding]: Checked pairs total: 40940 [2019-12-18 22:03:19,552 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-18 22:03:19,555 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 77 transitions [2019-12-18 22:03:19,894 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6362 states. [2019-12-18 22:03:19,897 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states. [2019-12-18 22:03:19,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:03:19,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:19,904 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:03:19,905 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:19,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:19,911 INFO L82 PathProgramCache]: Analyzing trace with hash 679647889, now seen corresponding path program 1 times [2019-12-18 22:03:19,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:19,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754820287] [2019-12-18 22:03:19,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:20,150 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 22:03:20,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754820287] [2019-12-18 22:03:20,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:20,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:03:20,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165984146] [2019-12-18 22:03:20,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:03:20,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:20,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:03:20,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:03:20,209 INFO L87 Difference]: Start difference. First operand 6362 states. Second operand 3 states. [2019-12-18 22:03:20,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:20,443 INFO L93 Difference]: Finished difference Result 6202 states and 20974 transitions. [2019-12-18 22:03:20,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:03:20,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:03:20,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:20,539 INFO L225 Difference]: With dead ends: 6202 [2019-12-18 22:03:20,539 INFO L226 Difference]: Without dead ends: 5842 [2019-12-18 22:03:20,543 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 22:03:20,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5842 states. [2019-12-18 22:03:20,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5842 to 5842. [2019-12-18 22:03:20,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5842 states. [2019-12-18 22:03:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5842 states to 5842 states and 19720 transitions. [2019-12-18 22:03:20,898 INFO L78 Accepts]: Start accepts. Automaton has 5842 states and 19720 transitions. Word has length 5 [2019-12-18 22:03:20,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:20,898 INFO L462 AbstractCegarLoop]: Abstraction has 5842 states and 19720 transitions. [2019-12-18 22:03:20,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:03:20,899 INFO L276 IsEmpty]: Start isEmpty. Operand 5842 states and 19720 transitions. [2019-12-18 22:03:20,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:03:20,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:20,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:20,910 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:20,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:20,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1194540122, now seen corresponding path program 1 times [2019-12-18 22:03:20,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:20,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72273445] [2019-12-18 22:03:20,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:21,018 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 22:03:21,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72273445] [2019-12-18 22:03:21,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:21,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:03:21,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117719644] [2019-12-18 22:03:21,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:03:21,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:21,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:03:21,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:03:21,022 INFO L87 Difference]: Start difference. First operand 5842 states and 19720 transitions. Second operand 3 states. [2019-12-18 22:03:21,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:21,046 INFO L93 Difference]: Finished difference Result 1186 states and 2950 transitions. [2019-12-18 22:03:21,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:03:21,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 22:03:21,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:21,054 INFO L225 Difference]: With dead ends: 1186 [2019-12-18 22:03:21,054 INFO L226 Difference]: Without dead ends: 1186 [2019-12-18 22:03:21,055 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 22:03:21,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-12-18 22:03:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-12-18 22:03:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-12-18 22:03:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2950 transitions. [2019-12-18 22:03:21,088 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2950 transitions. Word has length 11 [2019-12-18 22:03:21,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:21,089 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 2950 transitions. [2019-12-18 22:03:21,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:03:21,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2950 transitions. [2019-12-18 22:03:21,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:03:21,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:21,091 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:21,091 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:21,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:21,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1520947745, now seen corresponding path program 1 times [2019-12-18 22:03:21,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:21,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128007077] [2019-12-18 22:03:21,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:21,174 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 22:03:21,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128007077] [2019-12-18 22:03:21,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:21,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:03:21,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905707551] [2019-12-18 22:03:21,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:03:21,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:21,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:03:21,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:03:21,176 INFO L87 Difference]: Start difference. First operand 1186 states and 2950 transitions. Second operand 3 states. [2019-12-18 22:03:21,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:21,264 INFO L93 Difference]: Finished difference Result 1816 states and 4578 transitions. [2019-12-18 22:03:21,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:03:21,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 22:03:21,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:21,275 INFO L225 Difference]: With dead ends: 1816 [2019-12-18 22:03:21,275 INFO L226 Difference]: Without dead ends: 1816 [2019-12-18 22:03:21,276 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 22:03:21,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2019-12-18 22:03:21,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1300. [2019-12-18 22:03:21,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-12-18 22:03:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 3290 transitions. [2019-12-18 22:03:21,352 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 3290 transitions. Word has length 14 [2019-12-18 22:03:21,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:21,352 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 3290 transitions. [2019-12-18 22:03:21,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:03:21,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 3290 transitions. [2019-12-18 22:03:21,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:03:21,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:21,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:21,354 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:21,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:21,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1657479898, now seen corresponding path program 1 times [2019-12-18 22:03:21,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:21,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727288979] [2019-12-18 22:03:21,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:21,441 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 22:03:21,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727288979] [2019-12-18 22:03:21,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:21,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:03:21,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768760722] [2019-12-18 22:03:21,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:03:21,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:21,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:03:21,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:03:21,443 INFO L87 Difference]: Start difference. First operand 1300 states and 3290 transitions. Second operand 4 states. [2019-12-18 22:03:21,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:21,602 INFO L93 Difference]: Finished difference Result 1749 states and 4286 transitions. [2019-12-18 22:03:21,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:03:21,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:03:21,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:21,614 INFO L225 Difference]: With dead ends: 1749 [2019-12-18 22:03:21,615 INFO L226 Difference]: Without dead ends: 1749 [2019-12-18 22:03:21,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:03:21,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2019-12-18 22:03:21,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1581. [2019-12-18 22:03:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2019-12-18 22:03:21,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 3910 transitions. [2019-12-18 22:03:21,660 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 3910 transitions. Word has length 14 [2019-12-18 22:03:21,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:21,660 INFO L462 AbstractCegarLoop]: Abstraction has 1581 states and 3910 transitions. [2019-12-18 22:03:21,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:03:21,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 3910 transitions. [2019-12-18 22:03:21,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:03:21,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:21,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:21,662 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:21,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:21,663 INFO L82 PathProgramCache]: Analyzing trace with hash 592134812, now seen corresponding path program 1 times [2019-12-18 22:03:21,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:21,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117845634] [2019-12-18 22:03:21,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:21,750 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 22:03:21,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117845634] [2019-12-18 22:03:21,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:21,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:03:21,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742136538] [2019-12-18 22:03:21,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:03:21,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:21,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:03:21,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:03:21,754 INFO L87 Difference]: Start difference. First operand 1581 states and 3910 transitions. Second operand 4 states. [2019-12-18 22:03:21,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:21,925 INFO L93 Difference]: Finished difference Result 2006 states and 4872 transitions. [2019-12-18 22:03:21,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:03:21,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:03:21,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:21,938 INFO L225 Difference]: With dead ends: 2006 [2019-12-18 22:03:21,939 INFO L226 Difference]: Without dead ends: 2006 [2019-12-18 22:03:21,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:03:21,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2019-12-18 22:03:21,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1606. [2019-12-18 22:03:21,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2019-12-18 22:03:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 3970 transitions. [2019-12-18 22:03:21,978 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 3970 transitions. Word has length 14 [2019-12-18 22:03:21,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:21,979 INFO L462 AbstractCegarLoop]: Abstraction has 1606 states and 3970 transitions. [2019-12-18 22:03:21,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:03:21,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 3970 transitions. [2019-12-18 22:03:21,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 22:03:21,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:21,982 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:21,982 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:21,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:21,982 INFO L82 PathProgramCache]: Analyzing trace with hash -321167057, now seen corresponding path program 1 times [2019-12-18 22:03:21,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:21,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445066465] [2019-12-18 22:03:21,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:22,049 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 22:03:22,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445066465] [2019-12-18 22:03:22,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:22,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:03:22,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724054509] [2019-12-18 22:03:22,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:03:22,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:22,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:03:22,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:03:22,051 INFO L87 Difference]: Start difference. First operand 1606 states and 3970 transitions. Second operand 4 states. [2019-12-18 22:03:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:22,074 INFO L93 Difference]: Finished difference Result 714 states and 1648 transitions. [2019-12-18 22:03:22,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:03:22,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-18 22:03:22,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:22,079 INFO L225 Difference]: With dead ends: 714 [2019-12-18 22:03:22,079 INFO L226 Difference]: Without dead ends: 714 [2019-12-18 22:03:22,080 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 22:03:22,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-12-18 22:03:22,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 682. [2019-12-18 22:03:22,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-12-18 22:03:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1580 transitions. [2019-12-18 22:03:22,095 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1580 transitions. Word has length 26 [2019-12-18 22:03:22,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:22,095 INFO L462 AbstractCegarLoop]: Abstraction has 682 states and 1580 transitions. [2019-12-18 22:03:22,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:03:22,096 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1580 transitions. [2019-12-18 22:03:22,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:03:22,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:22,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:22,098 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:22,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:22,099 INFO L82 PathProgramCache]: Analyzing trace with hash 152096728, now seen corresponding path program 1 times [2019-12-18 22:03:22,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:22,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969856843] [2019-12-18 22:03:22,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:22,208 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 22:03:22,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969856843] [2019-12-18 22:03:22,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:22,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:03:22,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654004338] [2019-12-18 22:03:22,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:03:22,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:22,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:03:22,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:03:22,211 INFO L87 Difference]: Start difference. First operand 682 states and 1580 transitions. Second operand 3 states. [2019-12-18 22:03:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:22,224 INFO L93 Difference]: Finished difference Result 1069 states and 2520 transitions. [2019-12-18 22:03:22,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:03:22,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 22:03:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:22,227 INFO L225 Difference]: With dead ends: 1069 [2019-12-18 22:03:22,228 INFO L226 Difference]: Without dead ends: 406 [2019-12-18 22:03:22,228 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 22:03:22,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-18 22:03:22,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2019-12-18 22:03:22,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-18 22:03:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 971 transitions. [2019-12-18 22:03:22,239 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 971 transitions. Word has length 41 [2019-12-18 22:03:22,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:22,239 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 971 transitions. [2019-12-18 22:03:22,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:03:22,240 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 971 transitions. [2019-12-18 22:03:22,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:03:22,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:22,243 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] [2019-12-18 22:03:22,243 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:22,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:22,244 INFO L82 PathProgramCache]: Analyzing trace with hash -927493450, now seen corresponding path program 2 times [2019-12-18 22:03:22,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:22,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193430819] [2019-12-18 22:03:22,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:22,334 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 22:03:22,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193430819] [2019-12-18 22:03:22,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:22,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:03:22,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262709250] [2019-12-18 22:03:22,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:03:22,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:22,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:03:22,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:03:22,337 INFO L87 Difference]: Start difference. First operand 406 states and 971 transitions. Second operand 6 states. [2019-12-18 22:03:22,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:22,503 INFO L93 Difference]: Finished difference Result 776 states and 1807 transitions. [2019-12-18 22:03:22,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:03:22,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 22:03:22,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:22,509 INFO L225 Difference]: With dead ends: 776 [2019-12-18 22:03:22,509 INFO L226 Difference]: Without dead ends: 512 [2019-12-18 22:03:22,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:03:22,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-12-18 22:03:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 436. [2019-12-18 22:03:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-12-18 22:03:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1021 transitions. [2019-12-18 22:03:22,522 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1021 transitions. Word has length 41 [2019-12-18 22:03:22,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:22,526 INFO L462 AbstractCegarLoop]: Abstraction has 436 states and 1021 transitions. [2019-12-18 22:03:22,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:03:22,527 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1021 transitions. [2019-12-18 22:03:22,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:03:22,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:22,528 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] [2019-12-18 22:03:22,529 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:22,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:22,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1094693734, now seen corresponding path program 3 times [2019-12-18 22:03:22,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:22,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820437778] [2019-12-18 22:03:22,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:22,709 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 22:03:22,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820437778] [2019-12-18 22:03:22,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:22,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:03:22,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683830334] [2019-12-18 22:03:22,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:03:22,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:22,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:03:22,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:03:22,711 INFO L87 Difference]: Start difference. First operand 436 states and 1021 transitions. Second operand 8 states. [2019-12-18 22:03:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:23,322 INFO L93 Difference]: Finished difference Result 747 states and 1593 transitions. [2019-12-18 22:03:23,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:03:23,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-18 22:03:23,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:23,327 INFO L225 Difference]: With dead ends: 747 [2019-12-18 22:03:23,328 INFO L226 Difference]: Without dead ends: 747 [2019-12-18 22:03:23,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:03:23,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-12-18 22:03:23,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 562. [2019-12-18 22:03:23,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-12-18 22:03:23,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1206 transitions. [2019-12-18 22:03:23,341 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1206 transitions. Word has length 41 [2019-12-18 22:03:23,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:23,342 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 1206 transitions. [2019-12-18 22:03:23,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:03:23,342 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1206 transitions. [2019-12-18 22:03:23,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:03:23,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:23,343 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] [2019-12-18 22:03:23,344 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:23,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:23,344 INFO L82 PathProgramCache]: Analyzing trace with hash -924340920, now seen corresponding path program 4 times [2019-12-18 22:03:23,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:23,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434035302] [2019-12-18 22:03:23,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:23,441 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 22:03:23,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434035302] [2019-12-18 22:03:23,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:23,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:03:23,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247580479] [2019-12-18 22:03:23,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:03:23,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:23,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:03:23,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:03:23,443 INFO L87 Difference]: Start difference. First operand 562 states and 1206 transitions. Second operand 7 states. [2019-12-18 22:03:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:23,645 INFO L93 Difference]: Finished difference Result 1366 states and 2865 transitions. [2019-12-18 22:03:23,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:03:23,645 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-18 22:03:23,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:23,654 INFO L225 Difference]: With dead ends: 1366 [2019-12-18 22:03:23,654 INFO L226 Difference]: Without dead ends: 1019 [2019-12-18 22:03:23,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:03:23,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-12-18 22:03:23,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 561. [2019-12-18 22:03:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-12-18 22:03:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1207 transitions. [2019-12-18 22:03:23,669 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1207 transitions. Word has length 41 [2019-12-18 22:03:23,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:23,669 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 1207 transitions. [2019-12-18 22:03:23,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:03:23,670 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1207 transitions. [2019-12-18 22:03:23,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:03:23,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:23,671 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:23,672 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:23,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:23,672 INFO L82 PathProgramCache]: Analyzing trace with hash 318757224, now seen corresponding path program 5 times [2019-12-18 22:03:23,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:23,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282720600] [2019-12-18 22:03:23,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:23,764 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 22:03:23,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282720600] [2019-12-18 22:03:23,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:23,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:03:23,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141995536] [2019-12-18 22:03:23,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:03:23,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:23,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:03:23,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:03:23,766 INFO L87 Difference]: Start difference. First operand 561 states and 1207 transitions. Second operand 6 states. [2019-12-18 22:03:24,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:24,219 INFO L93 Difference]: Finished difference Result 851 states and 1793 transitions. [2019-12-18 22:03:24,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:03:24,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 22:03:24,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:24,225 INFO L225 Difference]: With dead ends: 851 [2019-12-18 22:03:24,225 INFO L226 Difference]: Without dead ends: 851 [2019-12-18 22:03:24,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:03:24,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-12-18 22:03:24,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 578. [2019-12-18 22:03:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-12-18 22:03:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 1244 transitions. [2019-12-18 22:03:24,239 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 1244 transitions. Word has length 41 [2019-12-18 22:03:24,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:24,239 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 1244 transitions. [2019-12-18 22:03:24,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:03:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 1244 transitions. [2019-12-18 22:03:24,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:03:24,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:24,241 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] [2019-12-18 22:03:24,242 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:24,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:24,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1915123108, now seen corresponding path program 6 times [2019-12-18 22:03:24,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:24,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406571484] [2019-12-18 22:03:24,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:24,307 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 22:03:24,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406571484] [2019-12-18 22:03:24,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:24,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:03:24,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948089842] [2019-12-18 22:03:24,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:03:24,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:24,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:03:24,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:03:24,309 INFO L87 Difference]: Start difference. First operand 578 states and 1244 transitions. Second operand 3 states. [2019-12-18 22:03:24,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:24,322 INFO L93 Difference]: Finished difference Result 576 states and 1239 transitions. [2019-12-18 22:03:24,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:03:24,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 22:03:24,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:24,329 INFO L225 Difference]: With dead ends: 576 [2019-12-18 22:03:24,329 INFO L226 Difference]: Without dead ends: 576 [2019-12-18 22:03:24,330 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 22:03:24,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-12-18 22:03:24,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 484. [2019-12-18 22:03:24,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-12-18 22:03:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1060 transitions. [2019-12-18 22:03:24,349 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1060 transitions. Word has length 41 [2019-12-18 22:03:24,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:24,349 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 1060 transitions. [2019-12-18 22:03:24,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:03:24,350 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1060 transitions. [2019-12-18 22:03:24,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 22:03:24,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:24,351 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] [2019-12-18 22:03:24,351 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:24,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:24,353 INFO L82 PathProgramCache]: Analyzing trace with hash 563396780, now seen corresponding path program 1 times [2019-12-18 22:03:24,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:24,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394379226] [2019-12-18 22:03:24,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:03:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:03:24,487 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:03:24,488 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:03:24,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~x$w_buff1~0_23) (= v_~main$tmp_guard0~0_9 0) (= v_~x$r_buff1_thd1~0_40 0) (= |v_#NULL.offset_6| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1635~0.base_23|)) (= 0 v_~x$r_buff0_thd2~0_29) (= 0 v_~x$r_buff0_thd1~0_69) (= 0 v_~x$r_buff0_thd0~0_21) (= |v_ULTIMATE.start_main_~#t1635~0.offset_18| 0) (= 0 v_~x$w_buff0~0_24) (= v_~y~0_19 0) (= v_~x$mem_tmp~0_9 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd0~0_25 0) (= v_~x$w_buff1_used~0_54 0) (= 0 v_~x$w_buff0_used~0_92) (= v_~x$r_buff1_thd2~0_21 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1635~0.base_23| 4)) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= 0 v_~x$read_delayed~0_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1635~0.base_23|) (= v_~x~0_20 0) (= v_~x$flush_delayed~0_12 0) (= v_~main$tmp_guard1~0_14 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1635~0.base_23| 1) |v_#valid_47|) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_p1_EAX~0_17) (= v_~__unbuffered_p1_EBX~0_18 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1635~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1635~0.base_23|) |v_ULTIMATE.start_main_~#t1635~0.offset_18| 0)) |v_#memory_int_17|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_24, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_69, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_40, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_9, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ULTIMATE.start_main_~#t1636~0.base=|v_ULTIMATE.start_main_~#t1636~0.base_23|, #length=|v_#length_17|, ~y~0=v_~y~0_19, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_23|, ~x$w_buff1~0=v_~x$w_buff1~0_23, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_9|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_54, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_9|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_25, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ULTIMATE.start_main_~#t1635~0.offset=|v_ULTIMATE.start_main_~#t1635~0.offset_18|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_92, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1636~0.offset=|v_ULTIMATE.start_main_~#t1636~0.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_20, ULTIMATE.start_main_~#t1635~0.base=|v_ULTIMATE.start_main_~#t1635~0.base_23|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1636~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1635~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1636~0.offset, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t1635~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 22:03:24,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-1-->L802: Formula: (and (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1636~0.base_10|) 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1636~0.base_10| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1636~0.offset_9| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1636~0.base_10|) (= (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1636~0.base_10| 1) |v_#valid_25|) (not (= 0 |v_ULTIMATE.start_main_~#t1636~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1636~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1636~0.base_10|) |v_ULTIMATE.start_main_~#t1636~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1636~0.base=|v_ULTIMATE.start_main_~#t1636~0.base_10|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1636~0.offset=|v_ULTIMATE.start_main_~#t1636~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1636~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1636~0.offset, #length] because there is no mapped edge [2019-12-18 22:03:24,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L5-->L777: Formula: (and (= ~x$r_buff1_thd0~0_Out-139048779 ~x$r_buff0_thd0~0_In-139048779) (= ~__unbuffered_p1_EAX~0_Out-139048779 ~y~0_Out-139048779) (= ~x$r_buff1_thd2~0_Out-139048779 ~x$r_buff0_thd2~0_In-139048779) (not (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-139048779 0)) (= ~__unbuffered_p1_EBX~0_Out-139048779 ~y~0_Out-139048779) (= 1 ~x$r_buff0_thd2~0_Out-139048779) (= 1 ~y~0_Out-139048779) (= ~x$r_buff1_thd1~0_Out-139048779 ~x$r_buff0_thd1~0_In-139048779)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-139048779, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-139048779, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-139048779, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-139048779} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-139048779, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-139048779, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-139048779, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-139048779, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-139048779, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-139048779, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-139048779, ~y~0=~y~0_Out-139048779, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-139048779, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-139048779} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 22:03:24,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_36 v_~x$r_buff0_thd1~0_37) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_37, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_36, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-18 22:03:24,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2090239554 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite22_In2090239554| |P0Thread1of1ForFork1_#t~ite22_Out2090239554|) (= |P0Thread1of1ForFork1_#t~ite23_In2090239554| |P0Thread1of1ForFork1_#t~ite23_Out2090239554|) (= |P0Thread1of1ForFork1_#t~ite24_Out2090239554| ~x$r_buff1_thd1~0_In2090239554) (not .cse0)) (let ((.cse1 (not (= (mod ~x$r_buff0_thd1~0_In2090239554 256) 0)))) (and .cse0 (or (not (= 0 (mod ~x$r_buff1_thd1~0_In2090239554 256))) .cse1) (= |P0Thread1of1ForFork1_#t~ite22_Out2090239554| 0) (= |P0Thread1of1ForFork1_#t~ite24_Out2090239554| |P0Thread1of1ForFork1_#t~ite23_Out2090239554|) (not (= 0 (mod ~x$w_buff0_used~0_In2090239554 256))) (= |P0Thread1of1ForFork1_#t~ite22_Out2090239554| |P0Thread1of1ForFork1_#t~ite23_Out2090239554|) (or (not (= (mod ~x$w_buff1_used~0_In2090239554 256) 0)) .cse1))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2090239554, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2090239554, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2090239554, ~weak$$choice2~0=~weak$$choice2~0_In2090239554, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In2090239554|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2090239554, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In2090239554|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2090239554, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2090239554, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2090239554, ~weak$$choice2~0=~weak$$choice2~0_In2090239554, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out2090239554|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out2090239554|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out2090239554|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2090239554} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 22:03:24,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_4 v_~x~0_15) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 22:03:24,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In446692630 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In446692630 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out446692630| ~x$w_buff0_used~0_In446692630) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out446692630| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In446692630, ~x$w_buff0_used~0=~x$w_buff0_used~0_In446692630} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In446692630, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out446692630|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In446692630} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 22:03:24,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-1465200032 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1465200032 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1465200032 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1465200032 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1465200032 |P1Thread1of1ForFork0_#t~ite29_Out-1465200032|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1465200032|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1465200032, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1465200032, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1465200032, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1465200032} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1465200032, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1465200032, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1465200032, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1465200032|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1465200032} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 22:03:24,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1389093426 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1389093426 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out-1389093426 ~x$r_buff0_thd2~0_In-1389093426)) (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out-1389093426 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1389093426, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1389093426} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1389093426|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1389093426, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1389093426} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:03:24,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1477242027 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1477242027 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1477242027 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1477242027 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-1477242027 |P1Thread1of1ForFork0_#t~ite31_Out-1477242027|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1477242027|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1477242027, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1477242027, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1477242027, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1477242027} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1477242027|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1477242027, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1477242027, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1477242027, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1477242027} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 22:03:24,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 22:03:24,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 22:03:24,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1332848425 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1332848425 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-1332848425 |ULTIMATE.start_main_#t~ite34_Out-1332848425|) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In-1332848425 |ULTIMATE.start_main_#t~ite34_Out-1332848425|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1332848425, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1332848425, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1332848425, ~x~0=~x~0_In-1332848425} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1332848425, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1332848425, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1332848425, ~x~0=~x~0_In-1332848425, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1332848425|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 22:03:24,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_13 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~x~0=v_~x~0_13, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 22:03:24,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In886496890 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In886496890 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite36_Out886496890|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In886496890 |ULTIMATE.start_main_#t~ite36_Out886496890|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In886496890, ~x$w_buff0_used~0=~x$w_buff0_used~0_In886496890} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In886496890, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out886496890|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In886496890} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 22:03:24,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In1817573875 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1817573875 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1817573875 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1817573875 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out1817573875| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out1817573875| ~x$w_buff1_used~0_In1817573875)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1817573875, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1817573875, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1817573875, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1817573875} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1817573875, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1817573875, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1817573875|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1817573875, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1817573875} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 22:03:24,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-274654501 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-274654501 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-274654501| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-274654501| ~x$r_buff0_thd0~0_In-274654501)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-274654501, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-274654501} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-274654501, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-274654501|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-274654501} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 22:03:24,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In2021713491 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In2021713491 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In2021713491 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In2021713491 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out2021713491| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite39_Out2021713491| ~x$r_buff1_thd0~0_In2021713491)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2021713491, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2021713491, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2021713491, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2021713491} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2021713491, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out2021713491|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2021713491, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2021713491, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2021713491} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 22:03:24,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= 1 v_~__unbuffered_p1_EAX~0_11) (= v_~__unbuffered_p1_EBX~0_12 1) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite39_14|) (= v_~y~0_13 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ~y~0=v_~y~0_13} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_13, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:03:24,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:03:24 BasicIcfg [2019-12-18 22:03:24,585 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:03:24,587 INFO L168 Benchmark]: Toolchain (without parser) took 10349.96 ms. Allocated memory was 138.9 MB in the beginning and 360.7 MB in the end (delta: 221.8 MB). Free memory was 101.7 MB in the beginning and 229.2 MB in the end (delta: -127.5 MB). Peak memory consumption was 94.3 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:24,590 INFO L168 Benchmark]: CDTParser took 1.41 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 22:03:24,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 764.00 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.5 MB in the beginning and 158.5 MB in the end (delta: -57.0 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:24,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.55 ms. Allocated memory is still 203.9 MB. Free memory was 158.5 MB in the beginning and 155.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:24,592 INFO L168 Benchmark]: Boogie Preprocessor took 40.15 ms. Allocated memory is still 203.9 MB. Free memory was 155.9 MB in the beginning and 153.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:24,593 INFO L168 Benchmark]: RCFGBuilder took 723.76 ms. Allocated memory is still 203.9 MB. Free memory was 153.9 MB in the beginning and 113.3 MB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:24,596 INFO L168 Benchmark]: TraceAbstraction took 8741.20 ms. Allocated memory was 203.9 MB in the beginning and 360.7 MB in the end (delta: 156.8 MB). Free memory was 112.7 MB in the beginning and 229.2 MB in the end (delta: -116.5 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:24,605 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.41 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 764.00 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.5 MB in the beginning and 158.5 MB in the end (delta: -57.0 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.55 ms. Allocated memory is still 203.9 MB. Free memory was 158.5 MB in the beginning and 155.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.15 ms. Allocated memory is still 203.9 MB. Free memory was 155.9 MB in the beginning and 153.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 723.76 ms. Allocated memory is still 203.9 MB. Free memory was 153.9 MB in the beginning and 113.3 MB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8741.20 ms. Allocated memory was 203.9 MB in the beginning and 360.7 MB in the end (delta: 156.8 MB). Free memory was 112.7 MB in the beginning and 229.2 MB in the end (delta: -116.5 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 136 ProgramPointsBefore, 66 ProgramPointsAfterwards, 164 TransitionsBefore, 77 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 20 ChoiceCompositions, 4263 VarBasedMoverChecksPositive, 123 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 40940 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1635, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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] [L802] FCALL, FORK 0 pthread_create(&t1636, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L808] 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 [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 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 [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1284 SDtfs, 1097 SDslu, 2496 SDs, 0 SdLazy, 1393 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6362occurred 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, 12 MinimizatonAttempts, 2200 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 35342 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...