/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:38:06,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:38:06,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:38:06,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:38:06,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:38:06,791 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:38:06,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:38:06,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:38:06,796 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:38:06,797 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:38:06,798 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:38:06,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:38:06,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:38:06,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:38:06,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:38:06,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:38:06,803 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:38:06,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:38:06,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:38:06,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:38:06,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:38:06,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:38:06,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:38:06,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:38:06,825 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:38:06,825 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:38:06,825 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:38:06,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:38:06,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:38:06,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:38:06,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:38:06,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:38:06,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:38:06,838 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:38:06,839 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:38:06,839 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:38:06,840 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:38:06,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:38:06,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:38:06,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:38:06,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:38:06,845 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:38:06,871 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:38:06,872 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:38:06,874 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:38:06,874 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:38:06,874 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:38:06,875 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:38:06,875 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:38:06,875 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:38:06,875 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:38:06,875 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:38:06,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:38:06,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:38:06,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:38:06,878 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:38:06,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:38:06,878 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:38:06,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:38:06,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:38:06,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:38:06,879 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:38:06,879 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:38:06,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:38:06,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:38:06,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:38:06,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:38:06,880 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:38:06,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:38:06,881 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:38:06,881 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:38:07,197 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:38:07,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:38:07,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:38:07,213 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:38:07,213 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:38:07,214 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i [2019-12-27 03:38:07,275 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ba169492/e228a20cb3ec4c9ab274cdbdda98341f/FLAG19df7e7b6 [2019-12-27 03:38:07,826 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:38:07,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i [2019-12-27 03:38:07,854 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ba169492/e228a20cb3ec4c9ab274cdbdda98341f/FLAG19df7e7b6 [2019-12-27 03:38:08,092 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ba169492/e228a20cb3ec4c9ab274cdbdda98341f [2019-12-27 03:38:08,102 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:38:08,104 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:38:08,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:38:08,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:38:08,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:38:08,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:38:08" (1/1) ... [2019-12-27 03:38:08,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ac7208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:08, skipping insertion in model container [2019-12-27 03:38:08,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:38:08" (1/1) ... [2019-12-27 03:38:08,121 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:38:08,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:38:08,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:38:08,776 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:38:08,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:38:08,938 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:38:08,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:08 WrapperNode [2019-12-27 03:38:08,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:38:08,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:38:08,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:38:08,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:38:08,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:08" (1/1) ... [2019-12-27 03:38:08,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:08" (1/1) ... [2019-12-27 03:38:09,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:38:09,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:38:09,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:38:09,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:38:09,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:08" (1/1) ... [2019-12-27 03:38:09,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:08" (1/1) ... [2019-12-27 03:38:09,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:08" (1/1) ... [2019-12-27 03:38:09,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:08" (1/1) ... [2019-12-27 03:38:09,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:08" (1/1) ... [2019-12-27 03:38:09,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:08" (1/1) ... [2019-12-27 03:38:09,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:08" (1/1) ... [2019-12-27 03:38:09,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:38:09,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:38:09,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:38:09,056 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:38:09,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:38:09,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:38:09,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:38:09,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:38:09,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:38:09,128 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:38:09,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:38:09,128 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:38:09,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:38:09,128 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:38:09,129 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:38:09,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:38:09,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:38:09,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:38:09,136 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:38:09,903 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:38:09,903 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:38:09,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:38:09 BoogieIcfgContainer [2019-12-27 03:38:09,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:38:09,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:38:09,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:38:09,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:38:09,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:38:08" (1/3) ... [2019-12-27 03:38:09,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739013d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:38:09, skipping insertion in model container [2019-12-27 03:38:09,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:08" (2/3) ... [2019-12-27 03:38:09,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739013d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:38:09, skipping insertion in model container [2019-12-27 03:38:09,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:38:09" (3/3) ... [2019-12-27 03:38:09,913 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_power.opt.i [2019-12-27 03:38:09,924 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:38:09,924 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:38:09,932 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:38:09,933 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:38:09,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,972 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,972 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,980 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,981 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,981 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,981 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,982 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,989 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,989 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:09,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,018 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,018 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,021 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,021 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,022 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,026 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,027 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:10,043 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:38:10,059 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:38:10,059 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:38:10,059 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:38:10,060 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:38:10,060 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:38:10,060 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:38:10,060 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:38:10,060 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:38:10,077 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 03:38:10,079 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 03:38:10,184 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 03:38:10,184 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:38:10,199 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 332 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 03:38:10,223 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 03:38:10,281 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 03:38:10,281 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:38:10,292 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 332 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 03:38:10,313 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 03:38:10,314 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:38:10,684 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-12-27 03:38:15,483 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 03:38:15,615 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 03:38:15,644 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87419 [2019-12-27 03:38:15,644 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 03:38:15,648 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 106 transitions [2019-12-27 03:38:31,844 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 107408 states. [2019-12-27 03:38:31,846 INFO L276 IsEmpty]: Start isEmpty. Operand 107408 states. [2019-12-27 03:38:31,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:38:31,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:38:31,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:38:31,854 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:38:31,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:38:31,860 INFO L82 PathProgramCache]: Analyzing trace with hash 809706692, now seen corresponding path program 1 times [2019-12-27 03:38:31,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:38:31,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621757898] [2019-12-27 03:38:31,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:38:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:38:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:38:32,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621757898] [2019-12-27 03:38:32,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:38:32,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:38:32,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025462581] [2019-12-27 03:38:32,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:38:32,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:38:32,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:38:32,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:38:32,090 INFO L87 Difference]: Start difference. First operand 107408 states. Second operand 3 states. [2019-12-27 03:38:35,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:38:35,201 INFO L93 Difference]: Finished difference Result 107108 states and 460900 transitions. [2019-12-27 03:38:35,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:38:35,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:38:35,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:38:35,832 INFO L225 Difference]: With dead ends: 107108 [2019-12-27 03:38:35,832 INFO L226 Difference]: Without dead ends: 104924 [2019-12-27 03:38:35,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:38:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104924 states. [2019-12-27 03:38:42,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104924 to 104924. [2019-12-27 03:38:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104924 states. [2019-12-27 03:38:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104924 states to 104924 states and 451982 transitions. [2019-12-27 03:38:47,047 INFO L78 Accepts]: Start accepts. Automaton has 104924 states and 451982 transitions. Word has length 5 [2019-12-27 03:38:47,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:38:47,047 INFO L462 AbstractCegarLoop]: Abstraction has 104924 states and 451982 transitions. [2019-12-27 03:38:47,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:38:47,047 INFO L276 IsEmpty]: Start isEmpty. Operand 104924 states and 451982 transitions. [2019-12-27 03:38:47,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:38:47,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:38:47,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:38:47,051 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:38:47,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:38:47,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1056800905, now seen corresponding path program 1 times [2019-12-27 03:38:47,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:38:47,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670836564] [2019-12-27 03:38:47,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:38:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:38:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:38:47,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670836564] [2019-12-27 03:38:47,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:38:47,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:38:47,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531318879] [2019-12-27 03:38:47,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:38:47,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:38:47,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:38:47,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:38:47,180 INFO L87 Difference]: Start difference. First operand 104924 states and 451982 transitions. Second operand 4 states. [2019-12-27 03:38:53,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:38:53,319 INFO L93 Difference]: Finished difference Result 168606 states and 697152 transitions. [2019-12-27 03:38:53,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:38:53,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:38:53,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:38:53,862 INFO L225 Difference]: With dead ends: 168606 [2019-12-27 03:38:53,862 INFO L226 Difference]: Without dead ends: 168557 [2019-12-27 03:38:53,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:38:58,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168557 states. [2019-12-27 03:39:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168557 to 152629. [2019-12-27 03:39:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152629 states. [2019-12-27 03:39:02,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152629 states to 152629 states and 638547 transitions. [2019-12-27 03:39:02,844 INFO L78 Accepts]: Start accepts. Automaton has 152629 states and 638547 transitions. Word has length 11 [2019-12-27 03:39:02,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:02,844 INFO L462 AbstractCegarLoop]: Abstraction has 152629 states and 638547 transitions. [2019-12-27 03:39:02,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:39:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 152629 states and 638547 transitions. [2019-12-27 03:39:02,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:39:02,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:02,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:02,852 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:02,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:02,852 INFO L82 PathProgramCache]: Analyzing trace with hash 933289536, now seen corresponding path program 1 times [2019-12-27 03:39:02,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:02,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388901017] [2019-12-27 03:39:02,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:02,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:02,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388901017] [2019-12-27 03:39:02,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:02,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:39:02,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626529140] [2019-12-27 03:39:02,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:39:02,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:02,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:39:02,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:39:02,960 INFO L87 Difference]: Start difference. First operand 152629 states and 638547 transitions. Second operand 4 states. [2019-12-27 03:39:09,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:09,503 INFO L93 Difference]: Finished difference Result 217678 states and 889823 transitions. [2019-12-27 03:39:09,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:39:09,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:39:09,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:10,299 INFO L225 Difference]: With dead ends: 217678 [2019-12-27 03:39:10,300 INFO L226 Difference]: Without dead ends: 217615 [2019-12-27 03:39:10,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:39:15,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217615 states. [2019-12-27 03:39:19,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217615 to 183279. [2019-12-27 03:39:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183279 states. [2019-12-27 03:39:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183279 states to 183279 states and 761454 transitions. [2019-12-27 03:39:27,181 INFO L78 Accepts]: Start accepts. Automaton has 183279 states and 761454 transitions. Word has length 13 [2019-12-27 03:39:27,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:27,182 INFO L462 AbstractCegarLoop]: Abstraction has 183279 states and 761454 transitions. [2019-12-27 03:39:27,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:39:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 183279 states and 761454 transitions. [2019-12-27 03:39:27,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:39:27,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:27,186 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:27,186 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:27,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:27,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1797085387, now seen corresponding path program 1 times [2019-12-27 03:39:27,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:27,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993720860] [2019-12-27 03:39:27,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:27,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:27,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993720860] [2019-12-27 03:39:27,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:27,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:39:27,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398861494] [2019-12-27 03:39:27,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:39:27,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:27,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:39:27,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:27,226 INFO L87 Difference]: Start difference. First operand 183279 states and 761454 transitions. Second operand 3 states. [2019-12-27 03:39:27,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:27,351 INFO L93 Difference]: Finished difference Result 36985 states and 120640 transitions. [2019-12-27 03:39:27,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:39:27,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 03:39:27,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:27,430 INFO L225 Difference]: With dead ends: 36985 [2019-12-27 03:39:27,430 INFO L226 Difference]: Without dead ends: 36985 [2019-12-27 03:39:27,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:27,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36985 states. [2019-12-27 03:39:27,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36985 to 36985. [2019-12-27 03:39:27,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36985 states. [2019-12-27 03:39:29,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36985 states to 36985 states and 120640 transitions. [2019-12-27 03:39:29,525 INFO L78 Accepts]: Start accepts. Automaton has 36985 states and 120640 transitions. Word has length 13 [2019-12-27 03:39:29,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:29,525 INFO L462 AbstractCegarLoop]: Abstraction has 36985 states and 120640 transitions. [2019-12-27 03:39:29,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:39:29,525 INFO L276 IsEmpty]: Start isEmpty. Operand 36985 states and 120640 transitions. [2019-12-27 03:39:29,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 03:39:29,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:29,529 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:29,529 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:29,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:29,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1117796869, now seen corresponding path program 1 times [2019-12-27 03:39:29,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:29,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631850926] [2019-12-27 03:39:29,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:29,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631850926] [2019-12-27 03:39:29,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:29,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:39:29,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479887581] [2019-12-27 03:39:29,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:39:29,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:29,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:39:29,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:39:29,623 INFO L87 Difference]: Start difference. First operand 36985 states and 120640 transitions. Second operand 5 states. [2019-12-27 03:39:30,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:30,391 INFO L93 Difference]: Finished difference Result 50257 states and 160609 transitions. [2019-12-27 03:39:30,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:39:30,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 03:39:30,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:30,473 INFO L225 Difference]: With dead ends: 50257 [2019-12-27 03:39:30,473 INFO L226 Difference]: Without dead ends: 50244 [2019-12-27 03:39:30,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:39:30,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50244 states. [2019-12-27 03:39:31,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50244 to 37328. [2019-12-27 03:39:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37328 states. [2019-12-27 03:39:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37328 states to 37328 states and 121606 transitions. [2019-12-27 03:39:31,192 INFO L78 Accepts]: Start accepts. Automaton has 37328 states and 121606 transitions. Word has length 19 [2019-12-27 03:39:31,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:31,193 INFO L462 AbstractCegarLoop]: Abstraction has 37328 states and 121606 transitions. [2019-12-27 03:39:31,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:39:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 37328 states and 121606 transitions. [2019-12-27 03:39:31,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:39:31,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:31,205 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:31,205 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:31,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:31,205 INFO L82 PathProgramCache]: Analyzing trace with hash 7812214, now seen corresponding path program 1 times [2019-12-27 03:39:31,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:31,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034366863] [2019-12-27 03:39:31,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:31,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:31,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034366863] [2019-12-27 03:39:31,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:31,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:39:31,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314026921] [2019-12-27 03:39:31,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:39:31,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:31,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:39:31,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:39:31,309 INFO L87 Difference]: Start difference. First operand 37328 states and 121606 transitions. Second operand 4 states. [2019-12-27 03:39:31,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:31,349 INFO L93 Difference]: Finished difference Result 7104 states and 19431 transitions. [2019-12-27 03:39:31,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:39:31,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 03:39:31,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:31,359 INFO L225 Difference]: With dead ends: 7104 [2019-12-27 03:39:31,359 INFO L226 Difference]: Without dead ends: 7104 [2019-12-27 03:39:31,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:39:31,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2019-12-27 03:39:31,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 6992. [2019-12-27 03:39:31,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6992 states. [2019-12-27 03:39:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 19111 transitions. [2019-12-27 03:39:31,449 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 19111 transitions. Word has length 25 [2019-12-27 03:39:31,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:31,449 INFO L462 AbstractCegarLoop]: Abstraction has 6992 states and 19111 transitions. [2019-12-27 03:39:31,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:39:31,450 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 19111 transitions. [2019-12-27 03:39:31,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 03:39:31,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:31,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:31,460 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:31,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:31,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1437682904, now seen corresponding path program 1 times [2019-12-27 03:39:31,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:31,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150830749] [2019-12-27 03:39:31,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:31,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150830749] [2019-12-27 03:39:31,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:31,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:39:31,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251624228] [2019-12-27 03:39:31,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:39:31,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:31,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:39:31,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:39:31,544 INFO L87 Difference]: Start difference. First operand 6992 states and 19111 transitions. Second operand 5 states. [2019-12-27 03:39:31,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:31,580 INFO L93 Difference]: Finished difference Result 5024 states and 14421 transitions. [2019-12-27 03:39:31,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:39:31,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 03:39:31,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:31,589 INFO L225 Difference]: With dead ends: 5024 [2019-12-27 03:39:31,589 INFO L226 Difference]: Without dead ends: 5024 [2019-12-27 03:39:31,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:39:31,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5024 states. [2019-12-27 03:39:32,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5024 to 4660. [2019-12-27 03:39:32,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-27 03:39:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 13437 transitions. [2019-12-27 03:39:32,937 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 13437 transitions. Word has length 37 [2019-12-27 03:39:32,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:32,937 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 13437 transitions. [2019-12-27 03:39:32,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:39:32,938 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 13437 transitions. [2019-12-27 03:39:32,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:39:32,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:32,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:32,947 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:32,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:32,948 INFO L82 PathProgramCache]: Analyzing trace with hash 2059462380, now seen corresponding path program 1 times [2019-12-27 03:39:32,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:32,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026589706] [2019-12-27 03:39:32,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:33,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026589706] [2019-12-27 03:39:33,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:33,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:39:33,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111785619] [2019-12-27 03:39:33,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:39:33,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:33,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:39:33,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:33,039 INFO L87 Difference]: Start difference. First operand 4660 states and 13437 transitions. Second operand 3 states. [2019-12-27 03:39:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:33,101 INFO L93 Difference]: Finished difference Result 4669 states and 13450 transitions. [2019-12-27 03:39:33,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:39:33,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 03:39:33,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:33,112 INFO L225 Difference]: With dead ends: 4669 [2019-12-27 03:39:33,113 INFO L226 Difference]: Without dead ends: 4669 [2019-12-27 03:39:33,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:33,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-27 03:39:33,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-27 03:39:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-27 03:39:33,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13446 transitions. [2019-12-27 03:39:33,177 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13446 transitions. Word has length 65 [2019-12-27 03:39:33,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:33,177 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13446 transitions. [2019-12-27 03:39:33,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:39:33,177 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13446 transitions. [2019-12-27 03:39:33,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:39:33,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:33,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:33,184 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:33,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:33,184 INFO L82 PathProgramCache]: Analyzing trace with hash -151073877, now seen corresponding path program 1 times [2019-12-27 03:39:33,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:33,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224516707] [2019-12-27 03:39:33,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:33,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224516707] [2019-12-27 03:39:33,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:33,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:39:33,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119708952] [2019-12-27 03:39:33,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:39:33,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:33,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:39:33,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:33,251 INFO L87 Difference]: Start difference. First operand 4665 states and 13446 transitions. Second operand 3 states. [2019-12-27 03:39:33,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:33,303 INFO L93 Difference]: Finished difference Result 4669 states and 13441 transitions. [2019-12-27 03:39:33,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:39:33,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 03:39:33,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:33,311 INFO L225 Difference]: With dead ends: 4669 [2019-12-27 03:39:33,311 INFO L226 Difference]: Without dead ends: 4669 [2019-12-27 03:39:33,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:33,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-27 03:39:33,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-27 03:39:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-27 03:39:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13437 transitions. [2019-12-27 03:39:33,386 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13437 transitions. Word has length 65 [2019-12-27 03:39:33,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:33,386 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13437 transitions. [2019-12-27 03:39:33,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:39:33,386 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13437 transitions. [2019-12-27 03:39:33,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:39:33,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:33,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:33,393 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:33,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:33,393 INFO L82 PathProgramCache]: Analyzing trace with hash -160756913, now seen corresponding path program 1 times [2019-12-27 03:39:33,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:33,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262104645] [2019-12-27 03:39:33,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:33,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262104645] [2019-12-27 03:39:33,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:33,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:39:33,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139457011] [2019-12-27 03:39:33,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:39:33,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:33,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:39:33,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:39:33,516 INFO L87 Difference]: Start difference. First operand 4665 states and 13437 transitions. Second operand 5 states. [2019-12-27 03:39:33,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:33,882 INFO L93 Difference]: Finished difference Result 7415 states and 21062 transitions. [2019-12-27 03:39:33,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:39:33,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 03:39:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:33,895 INFO L225 Difference]: With dead ends: 7415 [2019-12-27 03:39:33,895 INFO L226 Difference]: Without dead ends: 7415 [2019-12-27 03:39:33,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:39:33,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7415 states. [2019-12-27 03:39:34,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7415 to 5421. [2019-12-27 03:39:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5421 states. [2019-12-27 03:39:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 15667 transitions. [2019-12-27 03:39:34,021 INFO L78 Accepts]: Start accepts. Automaton has 5421 states and 15667 transitions. Word has length 65 [2019-12-27 03:39:34,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:34,021 INFO L462 AbstractCegarLoop]: Abstraction has 5421 states and 15667 transitions. [2019-12-27 03:39:34,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:39:34,021 INFO L276 IsEmpty]: Start isEmpty. Operand 5421 states and 15667 transitions. [2019-12-27 03:39:34,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:39:34,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:34,031 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:34,031 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:34,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:34,032 INFO L82 PathProgramCache]: Analyzing trace with hash 947021199, now seen corresponding path program 2 times [2019-12-27 03:39:34,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:34,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73155979] [2019-12-27 03:39:34,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:34,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:34,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73155979] [2019-12-27 03:39:34,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:34,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:39:34,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308448578] [2019-12-27 03:39:34,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:39:34,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:34,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:39:34,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:39:34,149 INFO L87 Difference]: Start difference. First operand 5421 states and 15667 transitions. Second operand 6 states. [2019-12-27 03:39:34,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:34,763 INFO L93 Difference]: Finished difference Result 9148 states and 26227 transitions. [2019-12-27 03:39:34,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:39:34,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 03:39:34,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:34,780 INFO L225 Difference]: With dead ends: 9148 [2019-12-27 03:39:34,780 INFO L226 Difference]: Without dead ends: 9148 [2019-12-27 03:39:34,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:39:34,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9148 states. [2019-12-27 03:39:34,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9148 to 5923. [2019-12-27 03:39:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5923 states. [2019-12-27 03:39:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5923 states to 5923 states and 17159 transitions. [2019-12-27 03:39:34,959 INFO L78 Accepts]: Start accepts. Automaton has 5923 states and 17159 transitions. Word has length 65 [2019-12-27 03:39:34,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:34,961 INFO L462 AbstractCegarLoop]: Abstraction has 5923 states and 17159 transitions. [2019-12-27 03:39:34,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:39:34,961 INFO L276 IsEmpty]: Start isEmpty. Operand 5923 states and 17159 transitions. [2019-12-27 03:39:34,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:39:34,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:34,975 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:34,976 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:34,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:34,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1073447055, now seen corresponding path program 3 times [2019-12-27 03:39:34,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:34,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929306166] [2019-12-27 03:39:34,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:35,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929306166] [2019-12-27 03:39:35,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:35,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:39:35,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060080047] [2019-12-27 03:39:35,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:39:35,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:35,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:39:35,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:35,091 INFO L87 Difference]: Start difference. First operand 5923 states and 17159 transitions. Second operand 3 states. [2019-12-27 03:39:35,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:35,120 INFO L93 Difference]: Finished difference Result 5089 states and 14464 transitions. [2019-12-27 03:39:35,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:39:35,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 03:39:35,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:35,128 INFO L225 Difference]: With dead ends: 5089 [2019-12-27 03:39:35,128 INFO L226 Difference]: Without dead ends: 5089 [2019-12-27 03:39:35,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:35,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5089 states. [2019-12-27 03:39:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5089 to 4949. [2019-12-27 03:39:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4949 states. [2019-12-27 03:39:35,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4949 states to 4949 states and 14078 transitions. [2019-12-27 03:39:35,229 INFO L78 Accepts]: Start accepts. Automaton has 4949 states and 14078 transitions. Word has length 65 [2019-12-27 03:39:35,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:35,229 INFO L462 AbstractCegarLoop]: Abstraction has 4949 states and 14078 transitions. [2019-12-27 03:39:35,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:39:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 4949 states and 14078 transitions. [2019-12-27 03:39:35,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:39:35,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:35,239 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:35,240 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:35,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:35,240 INFO L82 PathProgramCache]: Analyzing trace with hash -924926265, now seen corresponding path program 1 times [2019-12-27 03:39:35,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:35,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407827632] [2019-12-27 03:39:35,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:35,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407827632] [2019-12-27 03:39:35,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:35,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:39:35,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790951470] [2019-12-27 03:39:35,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:39:35,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:35,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:39:35,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:39:35,356 INFO L87 Difference]: Start difference. First operand 4949 states and 14078 transitions. Second operand 5 states. [2019-12-27 03:39:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:35,651 INFO L93 Difference]: Finished difference Result 7463 states and 21088 transitions. [2019-12-27 03:39:35,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:39:35,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 03:39:35,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:35,661 INFO L225 Difference]: With dead ends: 7463 [2019-12-27 03:39:35,661 INFO L226 Difference]: Without dead ends: 7463 [2019-12-27 03:39:35,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:39:35,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7463 states. [2019-12-27 03:39:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7463 to 6154. [2019-12-27 03:39:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6154 states. [2019-12-27 03:39:35,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6154 states to 6154 states and 17545 transitions. [2019-12-27 03:39:35,756 INFO L78 Accepts]: Start accepts. Automaton has 6154 states and 17545 transitions. Word has length 66 [2019-12-27 03:39:35,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:35,756 INFO L462 AbstractCegarLoop]: Abstraction has 6154 states and 17545 transitions. [2019-12-27 03:39:35,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:39:35,756 INFO L276 IsEmpty]: Start isEmpty. Operand 6154 states and 17545 transitions. [2019-12-27 03:39:35,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:39:35,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:35,765 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:35,765 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:35,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:35,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1368765211, now seen corresponding path program 2 times [2019-12-27 03:39:35,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:35,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61923220] [2019-12-27 03:39:35,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:35,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61923220] [2019-12-27 03:39:35,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:35,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:39:35,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047340452] [2019-12-27 03:39:35,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:39:35,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:35,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:39:35,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:39:35,939 INFO L87 Difference]: Start difference. First operand 6154 states and 17545 transitions. Second operand 9 states. [2019-12-27 03:39:36,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:36,828 INFO L93 Difference]: Finished difference Result 8873 states and 24903 transitions. [2019-12-27 03:39:36,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 03:39:36,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 03:39:36,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:36,838 INFO L225 Difference]: With dead ends: 8873 [2019-12-27 03:39:36,839 INFO L226 Difference]: Without dead ends: 8873 [2019-12-27 03:39:36,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-12-27 03:39:36,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8873 states. [2019-12-27 03:39:36,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8873 to 6441. [2019-12-27 03:39:36,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6441 states. [2019-12-27 03:39:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6441 states to 6441 states and 18335 transitions. [2019-12-27 03:39:36,994 INFO L78 Accepts]: Start accepts. Automaton has 6441 states and 18335 transitions. Word has length 66 [2019-12-27 03:39:36,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:36,995 INFO L462 AbstractCegarLoop]: Abstraction has 6441 states and 18335 transitions. [2019-12-27 03:39:36,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:39:36,995 INFO L276 IsEmpty]: Start isEmpty. Operand 6441 states and 18335 transitions. [2019-12-27 03:39:37,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:39:37,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:37,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:37,004 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:37,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:37,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1762090943, now seen corresponding path program 3 times [2019-12-27 03:39:37,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:37,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887724941] [2019-12-27 03:39:37,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:37,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887724941] [2019-12-27 03:39:37,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:37,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:39:37,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392696221] [2019-12-27 03:39:37,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:39:37,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:37,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:39:37,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:37,078 INFO L87 Difference]: Start difference. First operand 6441 states and 18335 transitions. Second operand 3 states. [2019-12-27 03:39:37,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:37,134 INFO L93 Difference]: Finished difference Result 6441 states and 18334 transitions. [2019-12-27 03:39:37,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:39:37,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 03:39:37,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:37,144 INFO L225 Difference]: With dead ends: 6441 [2019-12-27 03:39:37,145 INFO L226 Difference]: Without dead ends: 6441 [2019-12-27 03:39:37,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:37,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6441 states. [2019-12-27 03:39:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6441 to 3886. [2019-12-27 03:39:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3886 states. [2019-12-27 03:39:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 11243 transitions. [2019-12-27 03:39:37,249 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 11243 transitions. Word has length 66 [2019-12-27 03:39:37,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:37,250 INFO L462 AbstractCegarLoop]: Abstraction has 3886 states and 11243 transitions. [2019-12-27 03:39:37,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:39:37,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 11243 transitions. [2019-12-27 03:39:37,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:39:37,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:37,261 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:37,261 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:37,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:37,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1906146231, now seen corresponding path program 1 times [2019-12-27 03:39:37,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:37,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125828688] [2019-12-27 03:39:37,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:37,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125828688] [2019-12-27 03:39:37,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:37,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:39:37,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482274243] [2019-12-27 03:39:37,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:39:37,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:37,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:39:37,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:39:37,437 INFO L87 Difference]: Start difference. First operand 3886 states and 11243 transitions. Second operand 7 states. [2019-12-27 03:39:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:37,561 INFO L93 Difference]: Finished difference Result 7160 states and 20947 transitions. [2019-12-27 03:39:37,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:39:37,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-27 03:39:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:37,570 INFO L225 Difference]: With dead ends: 7160 [2019-12-27 03:39:37,570 INFO L226 Difference]: Without dead ends: 4371 [2019-12-27 03:39:37,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:39:37,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2019-12-27 03:39:37,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 3366. [2019-12-27 03:39:37,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3366 states. [2019-12-27 03:39:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3366 states to 3366 states and 9718 transitions. [2019-12-27 03:39:37,647 INFO L78 Accepts]: Start accepts. Automaton has 3366 states and 9718 transitions. Word has length 67 [2019-12-27 03:39:37,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:37,647 INFO L462 AbstractCegarLoop]: Abstraction has 3366 states and 9718 transitions. [2019-12-27 03:39:37,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:39:37,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3366 states and 9718 transitions. [2019-12-27 03:39:37,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:39:37,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:37,654 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:37,654 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:37,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:37,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1418245853, now seen corresponding path program 2 times [2019-12-27 03:39:37,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:37,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629329069] [2019-12-27 03:39:37,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:37,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:37,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629329069] [2019-12-27 03:39:37,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:37,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:39:37,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72836394] [2019-12-27 03:39:37,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:39:37,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:37,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:39:37,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:39:37,779 INFO L87 Difference]: Start difference. First operand 3366 states and 9718 transitions. Second operand 6 states. [2019-12-27 03:39:37,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:37,881 INFO L93 Difference]: Finished difference Result 5944 states and 17219 transitions. [2019-12-27 03:39:37,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:39:37,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 03:39:37,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:37,886 INFO L225 Difference]: With dead ends: 5944 [2019-12-27 03:39:37,886 INFO L226 Difference]: Without dead ends: 2666 [2019-12-27 03:39:37,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:39:37,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2019-12-27 03:39:37,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2222. [2019-12-27 03:39:37,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2222 states. [2019-12-27 03:39:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 6388 transitions. [2019-12-27 03:39:37,948 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 6388 transitions. Word has length 67 [2019-12-27 03:39:37,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:37,948 INFO L462 AbstractCegarLoop]: Abstraction has 2222 states and 6388 transitions. [2019-12-27 03:39:37,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:39:37,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 6388 transitions. [2019-12-27 03:39:37,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:39:37,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:37,954 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:37,954 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:37,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:37,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1668809625, now seen corresponding path program 3 times [2019-12-27 03:39:37,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:37,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38675508] [2019-12-27 03:39:37,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:38,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:38,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38675508] [2019-12-27 03:39:38,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:38,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:39:38,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668123636] [2019-12-27 03:39:38,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:39:38,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:38,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:39:38,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:38,038 INFO L87 Difference]: Start difference. First operand 2222 states and 6388 transitions. Second operand 3 states. [2019-12-27 03:39:38,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:38,055 INFO L93 Difference]: Finished difference Result 1948 states and 5386 transitions. [2019-12-27 03:39:38,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:39:38,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 03:39:38,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:38,059 INFO L225 Difference]: With dead ends: 1948 [2019-12-27 03:39:38,059 INFO L226 Difference]: Without dead ends: 1948 [2019-12-27 03:39:38,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:38,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2019-12-27 03:39:38,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1804. [2019-12-27 03:39:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2019-12-27 03:39:38,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 5006 transitions. [2019-12-27 03:39:38,109 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 5006 transitions. Word has length 67 [2019-12-27 03:39:38,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:38,110 INFO L462 AbstractCegarLoop]: Abstraction has 1804 states and 5006 transitions. [2019-12-27 03:39:38,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:39:38,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 5006 transitions. [2019-12-27 03:39:38,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 03:39:38,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:38,114 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:38,114 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:38,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:38,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1093105687, now seen corresponding path program 1 times [2019-12-27 03:39:38,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:38,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83195907] [2019-12-27 03:39:38,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:39:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:39:38,288 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:39:38,288 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:39:38,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t2028~0.base_21| 4)) (= 0 v_~x$w_buff0_used~0_815) (= v_~x$r_buff0_thd1~0_121 0) (= v_~x$flush_delayed~0_33 0) (= v_~y~0_122 0) (= 0 v_~x$r_buff0_thd3~0_131) (= 0 |v_ULTIMATE.start_main_~#t2028~0.offset_18|) (= 0 v_~x$r_buff1_thd3~0_199) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$r_buff1_thd2~0_200) (= v_~weak$$choice2~0_113 0) (= v_~z~0_31 0) (= v_~main$tmp_guard1~0_21 0) (= 0 v_~x$w_buff1~0_221) (= 0 v_~weak$$choice0~0_15) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_15|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2028~0.base_21|) 0) (= v_~x$r_buff0_thd0~0_372 0) (= 0 v_~x~0_181) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_cnt~0_156 0) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$r_buff0_thd2~0_212) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2028~0.base_21| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2028~0.base_21|) |v_ULTIMATE.start_main_~#t2028~0.offset_18| 0))) (= 0 v_~x$w_buff1_used~0_499) (= |v_#NULL.offset_4| 0) (= v_~x$r_buff1_thd1~0_184 0) (= v_~x$r_buff1_thd0~0_296 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2028~0.base_21| 1)) (= 0 v_~__unbuffered_p2_EAX~0_22) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2028~0.base_21|) (= 0 v_~x$w_buff0~0_269))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_22|, ~x$w_buff0~0=v_~x$w_buff0~0_269, ULTIMATE.start_main_~#t2029~0.base=|v_ULTIMATE.start_main_~#t2029~0.base_22|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_40|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_30|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_30|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_46|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_184, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_131, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_51|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_37|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_46|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_33|, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start_main_~#t2029~0.offset=|v_ULTIMATE.start_main_~#t2029~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_372, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_38|, ~x$w_buff1~0=v_~x$w_buff1~0_221, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_43|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_499, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_200, ULTIMATE.start_main_~#t2028~0.base=|v_ULTIMATE.start_main_~#t2028~0.base_21|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_112|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_181, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_121, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_22|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_34|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_32|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_30|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_118|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_18|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_26|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_51|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_32|, ~y~0=v_~y~0_122, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_11|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_24|, ULTIMATE.start_main_~#t2030~0.base=|v_ULTIMATE.start_main_~#t2030~0.base_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_26|, ULTIMATE.start_main_~#t2030~0.offset=|v_ULTIMATE.start_main_~#t2030~0.offset_17|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_~#t2028~0.offset=|v_ULTIMATE.start_main_~#t2028~0.offset_18|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_296, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_212, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_60|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_39|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_815, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_33|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_15|, ~z~0=v_~z~0_31, ~weak$$choice2~0=v_~weak$$choice2~0_113, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_~#t2029~0.base, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2029~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2028~0.base, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t2030~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t2030~0.offset, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2028~0.offset, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 03:39:38,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L805-1-->L807: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2029~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2029~0.base_13|) |v_ULTIMATE.start_main_~#t2029~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2029~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2029~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2029~0.offset_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2029~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2029~0.base_13| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2029~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2029~0.base=|v_ULTIMATE.start_main_~#t2029~0.base_13|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2029~0.offset=|v_ULTIMATE.start_main_~#t2029~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2029~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2029~0.offset] because there is no mapped edge [2019-12-27 03:39:38,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_11| v_P1Thread1of1ForFork1_~arg.offset_11) (= 1 v_~x$w_buff0_used~0_98) (= v_P1Thread1of1ForFork1_~arg.base_11 |v_P1Thread1of1ForFork1_#in~arg.base_11|) (= v_~x$w_buff1_used~0_55 v_~x$w_buff0_used~0_99) (= 2 v_~x$w_buff0~0_30) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= v_~x$w_buff0~0_31 v_~x$w_buff1~0_21) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 0 (mod v_~x$w_buff1_used~0_55 256))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_31, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13, ~x$w_buff0~0=v_~x$w_buff0~0_30, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_11, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_11, ~x$w_buff1~0=v_~x$w_buff1~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 03:39:38,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2030~0.base_9| 4) |v_#length_13|) (= |v_ULTIMATE.start_main_~#t2030~0.offset_8| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2030~0.base_9| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2030~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2030~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2030~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2030~0.base_9|) |v_ULTIMATE.start_main_~#t2030~0.offset_8| 2))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2030~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2030~0.base=|v_ULTIMATE.start_main_~#t2030~0.base_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2030~0.offset=|v_ULTIMATE.start_main_~#t2030~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2030~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t2030~0.offset, #length] because there is no mapped edge [2019-12-27 03:39:38,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L782-2-->L782-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In76809626 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In76809626 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out76809626| ~x~0_In76809626) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In76809626 |P2Thread1of1ForFork2_#t~ite15_Out76809626|) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In76809626, ~x$w_buff1_used~0=~x$w_buff1_used~0_In76809626, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In76809626, ~x~0=~x~0_In76809626} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out76809626|, ~x$w_buff1~0=~x$w_buff1~0_In76809626, ~x$w_buff1_used~0=~x$w_buff1_used~0_In76809626, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In76809626, ~x~0=~x~0_In76809626} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 03:39:38,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_17) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 03:39:38,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In649176392 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In649176392 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out649176392|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In649176392 |P2Thread1of1ForFork2_#t~ite17_Out649176392|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In649176392, ~x$w_buff0_used~0=~x$w_buff0_used~0_In649176392} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In649176392, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out649176392|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In649176392} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 03:39:38,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L784-->L784-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In1814129707 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1814129707 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In1814129707 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1814129707 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out1814129707|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1814129707 |P2Thread1of1ForFork2_#t~ite18_Out1814129707|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1814129707, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1814129707, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1814129707, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1814129707} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1814129707, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1814129707, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1814129707, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1814129707|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1814129707} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 03:39:38,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In873168286 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In873168286 256)))) (or (and (= ~x$r_buff0_thd3~0_In873168286 |P2Thread1of1ForFork2_#t~ite19_Out873168286|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out873168286|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In873168286, ~x$w_buff0_used~0=~x$w_buff0_used~0_In873168286} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In873168286, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out873168286|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In873168286} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 03:39:38,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L786-->L786-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-1922051253 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-1922051253 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1922051253 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1922051253 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out-1922051253| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite20_Out-1922051253| ~x$r_buff1_thd3~0_In-1922051253)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1922051253, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1922051253, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1922051253, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1922051253} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1922051253|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1922051253, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1922051253, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1922051253, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1922051253} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 03:39:38,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_56| v_~x$r_buff1_thd3~0_147) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_55|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 03:39:38,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L733-2-->L733-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out-131535967| |P0Thread1of1ForFork0_#t~ite3_Out-131535967|)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-131535967 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-131535967 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~x~0_In-131535967 |P0Thread1of1ForFork0_#t~ite3_Out-131535967|)) (and .cse0 (not .cse1) (= ~x$w_buff1~0_In-131535967 |P0Thread1of1ForFork0_#t~ite3_Out-131535967|) (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-131535967, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-131535967, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-131535967, ~x~0=~x~0_In-131535967} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-131535967|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-131535967|, ~x$w_buff1~0=~x$w_buff1~0_In-131535967, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-131535967, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-131535967, ~x~0=~x~0_In-131535967} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 03:39:38,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1603632618 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1603632618 256)))) (or (and (= ~x$w_buff0_used~0_In-1603632618 |P0Thread1of1ForFork0_#t~ite5_Out-1603632618|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1603632618| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1603632618, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1603632618} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1603632618|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1603632618, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1603632618} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 03:39:38,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd1~0_In70406599 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In70406599 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In70406599 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In70406599 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In70406599 |P0Thread1of1ForFork0_#t~ite6_Out70406599|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out70406599|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In70406599, ~x$w_buff1_used~0=~x$w_buff1_used~0_In70406599, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In70406599, ~x$w_buff0_used~0=~x$w_buff0_used~0_In70406599} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out70406599|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In70406599, ~x$w_buff1_used~0=~x$w_buff1_used~0_In70406599, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In70406599, ~x$w_buff0_used~0=~x$w_buff0_used~0_In70406599} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 03:39:38,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In2132419478 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In2132419478 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out2132419478| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out2132419478| ~x$r_buff0_thd1~0_In2132419478)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2132419478, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2132419478} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2132419478, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out2132419478|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2132419478} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 03:39:38,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L737-->L737-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-786335967 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-786335967 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-786335967 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-786335967 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-786335967| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-786335967| ~x$r_buff1_thd1~0_In-786335967) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-786335967, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-786335967, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-786335967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-786335967} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-786335967, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-786335967|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-786335967, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-786335967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-786335967} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 03:39:38,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L737-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_126 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_126} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 03:39:38,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L763-->L763-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1304760906 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1304760906 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1304760906| ~x$w_buff0_used~0_In-1304760906) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1304760906| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1304760906, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1304760906} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1304760906|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1304760906, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1304760906} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 03:39:38,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L764-->L764-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1266442095 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1266442095 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-1266442095 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1266442095 256) 0))) (or (and (= ~x$w_buff1_used~0_In-1266442095 |P1Thread1of1ForFork1_#t~ite12_Out-1266442095|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1266442095|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1266442095, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1266442095, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1266442095, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1266442095} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1266442095, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1266442095, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1266442095|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1266442095, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1266442095} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 03:39:38,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L765-->L766: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-966890697 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-966890697 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out-966890697 ~x$r_buff0_thd2~0_In-966890697)) (and (= ~x$r_buff0_thd2~0_Out-966890697 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-966890697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-966890697} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-966890697|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-966890697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-966890697} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 03:39:38,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1747135901 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In1747135901 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1747135901 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1747135901 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1747135901|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite14_Out1747135901| ~x$r_buff1_thd2~0_In1747135901) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1747135901, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1747135901, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1747135901, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1747135901} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1747135901, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1747135901, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1747135901, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1747135901|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1747135901} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 03:39:38,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L766-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_154 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_154, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 03:39:38,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:39:38,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L815-2-->L815-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite24_Out1591062673| |ULTIMATE.start_main_#t~ite25_Out1591062673|)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1591062673 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1591062673 256)))) (or (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite24_Out1591062673| ~x$w_buff1~0_In1591062673) (not .cse2)) (and (= ~x~0_In1591062673 |ULTIMATE.start_main_#t~ite24_Out1591062673|) .cse0 (or .cse1 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1591062673, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1591062673, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1591062673, ~x~0=~x~0_In1591062673} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1591062673, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1591062673|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1591062673|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1591062673, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1591062673, ~x~0=~x~0_In1591062673} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 03:39:38,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1241443587 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1241443587 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite26_Out-1241443587|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1241443587 |ULTIMATE.start_main_#t~ite26_Out-1241443587|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1241443587, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1241443587} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1241443587, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1241443587|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1241443587} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 03:39:38,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1929942259 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1929942259 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1929942259 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-1929942259 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite27_Out-1929942259|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-1929942259 |ULTIMATE.start_main_#t~ite27_Out-1929942259|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1929942259, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1929942259, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1929942259, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1929942259} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1929942259, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1929942259, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1929942259|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1929942259, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1929942259} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 03:39:38,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1214305044 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1214305044 256)))) (or (and (= ~x$r_buff0_thd0~0_In1214305044 |ULTIMATE.start_main_#t~ite28_Out1214305044|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite28_Out1214305044|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1214305044, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1214305044} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1214305044, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1214305044|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1214305044} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 03:39:38,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-1858504995 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1858504995 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-1858504995 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1858504995 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite29_Out-1858504995|)) (and (or .cse1 .cse0) (= ~x$r_buff1_thd0~0_In-1858504995 |ULTIMATE.start_main_#t~ite29_Out-1858504995|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1858504995, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1858504995, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1858504995, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1858504995} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1858504995, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1858504995|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1858504995, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1858504995, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1858504995} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 03:39:38,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_111 v_~x$r_buff0_thd0~0_110) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_110, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 03:39:38,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L834-->L837-1: Formula: (and (= v_~x$mem_tmp~0_12 v_~x~0_151) (= (mod v_~main$tmp_guard1~0_14 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_~x$flush_delayed~0_25 0) (not (= (mod v_~x$flush_delayed~0_26 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_12} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_24|, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_12, ~x~0=v_~x~0_151, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:39:38,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 03:39:38,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:39:38 BasicIcfg [2019-12-27 03:39:38,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:39:38,455 INFO L168 Benchmark]: Toolchain (without parser) took 90351.49 ms. Allocated memory was 143.7 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 99.6 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 723.9 MB. Max. memory is 7.1 GB. [2019-12-27 03:39:38,461 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 03:39:38,461 INFO L168 Benchmark]: CACSL2BoogieTranslator took 834.46 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 99.2 MB in the beginning and 152.5 MB in the end (delta: -53.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:39:38,462 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.31 ms. Allocated memory is still 201.3 MB. Free memory was 152.5 MB in the beginning and 149.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:39:38,462 INFO L168 Benchmark]: Boogie Preprocessor took 43.35 ms. Allocated memory is still 201.3 MB. Free memory was 149.7 MB in the beginning and 146.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:39:38,465 INFO L168 Benchmark]: RCFGBuilder took 848.72 ms. Allocated memory is still 201.3 MB. Free memory was 146.9 MB in the beginning and 96.8 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-27 03:39:38,466 INFO L168 Benchmark]: TraceAbstraction took 88546.90 ms. Allocated memory was 201.3 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 96.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 663.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:39:38,471 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 834.46 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 99.2 MB in the beginning and 152.5 MB in the end (delta: -53.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.31 ms. Allocated memory is still 201.3 MB. Free memory was 152.5 MB in the beginning and 149.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.35 ms. Allocated memory is still 201.3 MB. Free memory was 149.7 MB in the beginning and 146.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 848.72 ms. Allocated memory is still 201.3 MB. Free memory was 146.9 MB in the beginning and 96.8 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88546.90 ms. Allocated memory was 201.3 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 96.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 663.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 174 ProgramPointsBefore, 94 ProgramPointsAfterwards, 211 TransitionsBefore, 106 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 29 ChoiceCompositions, 6170 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 77 SemBasedMoverChecksPositive, 248 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 87419 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L807] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L809] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L727] 1 z = 2 [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L782] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L762] 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_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L784] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L735] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 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) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 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 [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L815] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 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 [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L827] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L827] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L828] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L828] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L829] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L830] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L832] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 88.2s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 21.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2588 SDtfs, 2171 SDslu, 4114 SDs, 0 SdLazy, 2655 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 28 SyntacticMatches, 13 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183279occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 76912 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 915 NumberOfCodeBlocks, 915 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 126673 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...