/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:55:57,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:55:57,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:55:57,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:55:57,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:55:57,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:55:57,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:55:57,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:55:57,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:55:57,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:55:57,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:55:57,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:55:57,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:55:57,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:55:57,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:55:57,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:55:57,865 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:55:57,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:55:57,867 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:55:57,869 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:55:57,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:55:57,872 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:55:57,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:55:57,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:55:57,875 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:55:57,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:55:57,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:55:57,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:55:57,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:55:57,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:55:57,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:55:57,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:55:57,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:55:57,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:55:57,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:55:57,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:55:57,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:55:57,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:55:57,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:55:57,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:55:57,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:55:57,890 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:55:57,913 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:55:57,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:55:57,917 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:55:57,917 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:55:57,918 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:55:57,918 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:55:57,918 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:55:57,918 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:55:57,918 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:55:57,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:55:57,920 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:55:57,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:55:57,920 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:55:57,921 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:55:57,921 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:55:57,921 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:55:57,921 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:55:57,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:55:57,922 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:55:57,922 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:55:57,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:55:57,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:55:57,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:55:57,924 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:55:57,924 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:55:57,924 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:55:57,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:55:57,925 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:55:57,925 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:55:57,925 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:55:57,926 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:55:57,927 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:55:58,230 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:55:58,249 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:55:58,255 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:55:58,256 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:55:58,256 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:55:58,257 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2019-12-27 22:55:58,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158f8135f/d8cd1c60b70a43c68fd9973a43d0d008/FLAG2caa19da3 [2019-12-27 22:55:58,862 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:55:58,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2019-12-27 22:55:58,881 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158f8135f/d8cd1c60b70a43c68fd9973a43d0d008/FLAG2caa19da3 [2019-12-27 22:55:59,132 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158f8135f/d8cd1c60b70a43c68fd9973a43d0d008 [2019-12-27 22:55:59,140 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:55:59,142 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:55:59,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:55:59,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:55:59,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:55:59,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:55:59" (1/1) ... [2019-12-27 22:55:59,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e50f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:55:59, skipping insertion in model container [2019-12-27 22:55:59,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:55:59" (1/1) ... [2019-12-27 22:55:59,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:55:59,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:55:59,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:55:59,724 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:55:59,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:55:59,872 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:55:59,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:55:59 WrapperNode [2019-12-27 22:55:59,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:55:59,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:55:59,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:55:59,874 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:55:59,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:55:59" (1/1) ... [2019-12-27 22:55:59,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:55:59" (1/1) ... [2019-12-27 22:55:59,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:55:59,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:55:59,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:55:59,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:55:59,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:55:59" (1/1) ... [2019-12-27 22:55:59,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:55:59" (1/1) ... [2019-12-27 22:55:59,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:55:59" (1/1) ... [2019-12-27 22:55:59,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:55:59" (1/1) ... [2019-12-27 22:55:59,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:55:59" (1/1) ... [2019-12-27 22:55:59,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:55:59" (1/1) ... [2019-12-27 22:55:59,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:55:59" (1/1) ... [2019-12-27 22:55:59,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:55:59,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:55:59,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:55:59,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:55:59,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:55:59" (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 22:56:00,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:56:00,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:56:00,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:56:00,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:56:00,045 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:56:00,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:56:00,045 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:56:00,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:56:00,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:56:00,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:56:00,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:56:00,049 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 22:56:00,841 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:56:00,841 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:56:00,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:56:00 BoogieIcfgContainer [2019-12-27 22:56:00,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:56:00,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:56:00,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:56:00,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:56:00,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:55:59" (1/3) ... [2019-12-27 22:56:00,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3609e4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:56:00, skipping insertion in model container [2019-12-27 22:56:00,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:55:59" (2/3) ... [2019-12-27 22:56:00,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3609e4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:56:00, skipping insertion in model container [2019-12-27 22:56:00,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:56:00" (3/3) ... [2019-12-27 22:56:00,852 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc.i [2019-12-27 22:56:00,863 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:56:00,863 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:56:00,871 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:56:00,872 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:56:00,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,908 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,909 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,909 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,909 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,910 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,918 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,918 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,931 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,931 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,932 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,935 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,936 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:00,954 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 22:56:00,976 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:56:00,976 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:56:00,976 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:56:00,976 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:56:00,976 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:56:00,977 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:56:00,977 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:56:00,977 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:56:00,995 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-27 22:56:00,997 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 22:56:01,102 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 22:56:01,102 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:56:01,117 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 22:56:01,140 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 22:56:01,183 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 22:56:01,184 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:56:01,189 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 22:56:01,202 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-27 22:56:01,204 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:56:04,043 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-27 22:56:04,172 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-27 22:56:04,188 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48987 [2019-12-27 22:56:04,189 INFO L214 etLargeBlockEncoding]: Total number of compositions: 94 [2019-12-27 22:56:04,192 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 93 transitions [2019-12-27 22:56:04,711 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9272 states. [2019-12-27 22:56:04,714 INFO L276 IsEmpty]: Start isEmpty. Operand 9272 states. [2019-12-27 22:56:04,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 22:56:04,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:04,721 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 22:56:04,722 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:04,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:04,728 INFO L82 PathProgramCache]: Analyzing trace with hash 713212, now seen corresponding path program 1 times [2019-12-27 22:56:04,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:04,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346473191] [2019-12-27 22:56:04,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:04,968 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 22:56:04,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346473191] [2019-12-27 22:56:04,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:04,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:56:04,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1485484691] [2019-12-27 22:56:04,974 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:04,980 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:04,994 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 22:56:04,994 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:04,999 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:05,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:56:05,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:05,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:56:05,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:56:05,018 INFO L87 Difference]: Start difference. First operand 9272 states. Second operand 3 states. [2019-12-27 22:56:05,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:05,420 INFO L93 Difference]: Finished difference Result 9157 states and 30129 transitions. [2019-12-27 22:56:05,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:56:05,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 22:56:05,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:05,519 INFO L225 Difference]: With dead ends: 9157 [2019-12-27 22:56:05,519 INFO L226 Difference]: Without dead ends: 8975 [2019-12-27 22:56:05,520 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 22:56:05,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8975 states. [2019-12-27 22:56:05,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8975 to 8975. [2019-12-27 22:56:05,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8975 states. [2019-12-27 22:56:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8975 states to 8975 states and 29569 transitions. [2019-12-27 22:56:05,966 INFO L78 Accepts]: Start accepts. Automaton has 8975 states and 29569 transitions. Word has length 3 [2019-12-27 22:56:05,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:05,966 INFO L462 AbstractCegarLoop]: Abstraction has 8975 states and 29569 transitions. [2019-12-27 22:56:05,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:56:05,967 INFO L276 IsEmpty]: Start isEmpty. Operand 8975 states and 29569 transitions. [2019-12-27 22:56:05,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:56:05,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:05,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:05,970 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:05,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:05,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1430597214, now seen corresponding path program 1 times [2019-12-27 22:56:05,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:05,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247284143] [2019-12-27 22:56:05,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:06,079 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 22:56:06,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247284143] [2019-12-27 22:56:06,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:06,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:56:06,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [123860959] [2019-12-27 22:56:06,080 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:06,081 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:06,085 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:56:06,085 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:06,085 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:06,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:56:06,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:06,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:56:06,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:56:06,087 INFO L87 Difference]: Start difference. First operand 8975 states and 29569 transitions. Second operand 4 states. [2019-12-27 22:56:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:06,633 INFO L93 Difference]: Finished difference Result 13878 states and 43543 transitions. [2019-12-27 22:56:06,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:56:06,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:56:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:06,707 INFO L225 Difference]: With dead ends: 13878 [2019-12-27 22:56:06,707 INFO L226 Difference]: Without dead ends: 13871 [2019-12-27 22:56:06,708 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 22:56:06,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13871 states. [2019-12-27 22:56:07,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13871 to 12673. [2019-12-27 22:56:07,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12673 states. [2019-12-27 22:56:07,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12673 states to 12673 states and 40347 transitions. [2019-12-27 22:56:07,145 INFO L78 Accepts]: Start accepts. Automaton has 12673 states and 40347 transitions. Word has length 11 [2019-12-27 22:56:07,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:07,145 INFO L462 AbstractCegarLoop]: Abstraction has 12673 states and 40347 transitions. [2019-12-27 22:56:07,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:56:07,145 INFO L276 IsEmpty]: Start isEmpty. Operand 12673 states and 40347 transitions. [2019-12-27 22:56:07,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:56:07,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:07,148 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:07,149 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:07,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:07,149 INFO L82 PathProgramCache]: Analyzing trace with hash 244087264, now seen corresponding path program 1 times [2019-12-27 22:56:07,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:07,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731377913] [2019-12-27 22:56:07,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:07,223 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 22:56:07,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731377913] [2019-12-27 22:56:07,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:07,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:56:07,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [623228071] [2019-12-27 22:56:07,225 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:07,226 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:07,228 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:56:07,228 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:07,228 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:07,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:56:07,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:07,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:56:07,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:56:07,230 INFO L87 Difference]: Start difference. First operand 12673 states and 40347 transitions. Second operand 4 states. [2019-12-27 22:56:08,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:08,023 INFO L93 Difference]: Finished difference Result 15173 states and 47858 transitions. [2019-12-27 22:56:08,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:56:08,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:56:08,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:08,090 INFO L225 Difference]: With dead ends: 15173 [2019-12-27 22:56:08,091 INFO L226 Difference]: Without dead ends: 15173 [2019-12-27 22:56:08,091 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 22:56:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15173 states. [2019-12-27 22:56:08,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15173 to 13657. [2019-12-27 22:56:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13657 states. [2019-12-27 22:56:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13657 states to 13657 states and 43454 transitions. [2019-12-27 22:56:08,712 INFO L78 Accepts]: Start accepts. Automaton has 13657 states and 43454 transitions. Word has length 11 [2019-12-27 22:56:08,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:08,712 INFO L462 AbstractCegarLoop]: Abstraction has 13657 states and 43454 transitions. [2019-12-27 22:56:08,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:56:08,712 INFO L276 IsEmpty]: Start isEmpty. Operand 13657 states and 43454 transitions. [2019-12-27 22:56:08,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 22:56:08,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:08,726 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:08,726 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:08,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:08,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1210915997, now seen corresponding path program 1 times [2019-12-27 22:56:08,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:08,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823418163] [2019-12-27 22:56:08,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:08,828 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 22:56:08,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823418163] [2019-12-27 22:56:08,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:08,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:56:08,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1737447813] [2019-12-27 22:56:08,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:08,836 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:08,840 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 45 transitions. [2019-12-27 22:56:08,840 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:08,845 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:56:08,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:56:08,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:08,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:56:08,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:56:08,846 INFO L87 Difference]: Start difference. First operand 13657 states and 43454 transitions. Second operand 5 states. [2019-12-27 22:56:09,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:09,295 INFO L93 Difference]: Finished difference Result 18000 states and 55976 transitions. [2019-12-27 22:56:09,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:56:09,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 22:56:09,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:09,333 INFO L225 Difference]: With dead ends: 18000 [2019-12-27 22:56:09,333 INFO L226 Difference]: Without dead ends: 17993 [2019-12-27 22:56:09,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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 22:56:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17993 states. [2019-12-27 22:56:09,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17993 to 13513. [2019-12-27 22:56:09,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13513 states. [2019-12-27 22:56:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13513 states to 13513 states and 42886 transitions. [2019-12-27 22:56:09,962 INFO L78 Accepts]: Start accepts. Automaton has 13513 states and 42886 transitions. Word has length 17 [2019-12-27 22:56:09,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:09,962 INFO L462 AbstractCegarLoop]: Abstraction has 13513 states and 42886 transitions. [2019-12-27 22:56:09,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:56:09,962 INFO L276 IsEmpty]: Start isEmpty. Operand 13513 states and 42886 transitions. [2019-12-27 22:56:09,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:56:09,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:09,980 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 22:56:09,980 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:09,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:09,980 INFO L82 PathProgramCache]: Analyzing trace with hash 368877695, now seen corresponding path program 1 times [2019-12-27 22:56:09,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:09,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389014240] [2019-12-27 22:56:09,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:10,078 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 22:56:10,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389014240] [2019-12-27 22:56:10,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:10,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:56:10,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1857659176] [2019-12-27 22:56:10,079 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:10,084 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:10,088 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:56:10,089 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:10,089 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:10,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:56:10,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:10,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:56:10,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:56:10,090 INFO L87 Difference]: Start difference. First operand 13513 states and 42886 transitions. Second operand 3 states. [2019-12-27 22:56:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:10,199 INFO L93 Difference]: Finished difference Result 16497 states and 51650 transitions. [2019-12-27 22:56:10,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:56:10,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 22:56:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:10,223 INFO L225 Difference]: With dead ends: 16497 [2019-12-27 22:56:10,223 INFO L226 Difference]: Without dead ends: 16497 [2019-12-27 22:56:10,223 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 22:56:10,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16497 states. [2019-12-27 22:56:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16497 to 14538. [2019-12-27 22:56:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14538 states. [2019-12-27 22:56:10,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14538 states to 14538 states and 46033 transitions. [2019-12-27 22:56:10,657 INFO L78 Accepts]: Start accepts. Automaton has 14538 states and 46033 transitions. Word has length 25 [2019-12-27 22:56:10,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:10,659 INFO L462 AbstractCegarLoop]: Abstraction has 14538 states and 46033 transitions. [2019-12-27 22:56:10,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:56:10,659 INFO L276 IsEmpty]: Start isEmpty. Operand 14538 states and 46033 transitions. [2019-12-27 22:56:10,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:56:10,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:10,674 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 22:56:10,674 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:10,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:10,674 INFO L82 PathProgramCache]: Analyzing trace with hash 276108521, now seen corresponding path program 1 times [2019-12-27 22:56:10,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:10,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945328437] [2019-12-27 22:56:10,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:56:10,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945328437] [2019-12-27 22:56:10,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:10,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:56:10,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1732489184] [2019-12-27 22:56:10,754 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:10,757 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:10,762 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:56:10,763 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:10,763 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:10,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:56:10,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:10,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:56:10,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:56:10,764 INFO L87 Difference]: Start difference. First operand 14538 states and 46033 transitions. Second operand 6 states. [2019-12-27 22:56:10,964 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-12-27 22:56:11,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:11,389 INFO L93 Difference]: Finished difference Result 20241 states and 62761 transitions. [2019-12-27 22:56:11,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:56:11,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 22:56:11,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:11,418 INFO L225 Difference]: With dead ends: 20241 [2019-12-27 22:56:11,418 INFO L226 Difference]: Without dead ends: 20225 [2019-12-27 22:56:11,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:56:11,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20225 states. [2019-12-27 22:56:11,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20225 to 16589. [2019-12-27 22:56:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16589 states. [2019-12-27 22:56:11,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16589 states to 16589 states and 52200 transitions. [2019-12-27 22:56:11,835 INFO L78 Accepts]: Start accepts. Automaton has 16589 states and 52200 transitions. Word has length 25 [2019-12-27 22:56:11,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:11,836 INFO L462 AbstractCegarLoop]: Abstraction has 16589 states and 52200 transitions. [2019-12-27 22:56:11,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:56:11,836 INFO L276 IsEmpty]: Start isEmpty. Operand 16589 states and 52200 transitions. [2019-12-27 22:56:11,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 22:56:11,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:11,861 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] [2019-12-27 22:56:11,861 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:11,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:11,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1785185324, now seen corresponding path program 1 times [2019-12-27 22:56:11,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:11,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637316909] [2019-12-27 22:56:11,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:11,961 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 22:56:11,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637316909] [2019-12-27 22:56:11,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:11,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:56:11,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [512920804] [2019-12-27 22:56:11,962 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:11,969 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:11,982 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 68 transitions. [2019-12-27 22:56:11,982 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:12,032 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 22:56:12,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:56:12,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:12,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:56:12,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:56:12,034 INFO L87 Difference]: Start difference. First operand 16589 states and 52200 transitions. Second operand 6 states. [2019-12-27 22:56:12,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:12,342 INFO L93 Difference]: Finished difference Result 2520 states and 5775 transitions. [2019-12-27 22:56:12,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:56:12,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-27 22:56:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:12,345 INFO L225 Difference]: With dead ends: 2520 [2019-12-27 22:56:12,346 INFO L226 Difference]: Without dead ends: 2213 [2019-12-27 22:56:12,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:56:12,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2019-12-27 22:56:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 2039. [2019-12-27 22:56:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2019-12-27 22:56:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 4534 transitions. [2019-12-27 22:56:12,901 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 4534 transitions. Word has length 31 [2019-12-27 22:56:12,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:12,902 INFO L462 AbstractCegarLoop]: Abstraction has 2039 states and 4534 transitions. [2019-12-27 22:56:12,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:56:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 4534 transitions. [2019-12-27 22:56:12,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 22:56:12,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:12,905 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 22:56:12,905 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:12,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:12,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1705539938, now seen corresponding path program 1 times [2019-12-27 22:56:12,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:12,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261807646] [2019-12-27 22:56:12,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:13,113 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 22:56:13,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261807646] [2019-12-27 22:56:13,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:13,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:56:13,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [449748184] [2019-12-27 22:56:13,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:13,121 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:13,133 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 37 transitions. [2019-12-27 22:56:13,133 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:13,133 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:13,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:56:13,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:13,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:56:13,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:56:13,135 INFO L87 Difference]: Start difference. First operand 2039 states and 4534 transitions. Second operand 8 states. [2019-12-27 22:56:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:13,992 INFO L93 Difference]: Finished difference Result 2608 states and 5669 transitions. [2019-12-27 22:56:13,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 22:56:13,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-12-27 22:56:13,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:13,998 INFO L225 Difference]: With dead ends: 2608 [2019-12-27 22:56:13,998 INFO L226 Difference]: Without dead ends: 2606 [2019-12-27 22:56:13,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-12-27 22:56:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2019-12-27 22:56:14,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 2100. [2019-12-27 22:56:14,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-12-27 22:56:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 4675 transitions. [2019-12-27 22:56:14,030 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 4675 transitions. Word has length 37 [2019-12-27 22:56:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:14,031 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 4675 transitions. [2019-12-27 22:56:14,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:56:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 4675 transitions. [2019-12-27 22:56:14,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 22:56:14,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:14,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:14,036 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:14,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:14,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1992807550, now seen corresponding path program 1 times [2019-12-27 22:56:14,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:14,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764664850] [2019-12-27 22:56:14,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:14,114 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 22:56:14,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764664850] [2019-12-27 22:56:14,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:14,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:56:14,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1542482776] [2019-12-27 22:56:14,115 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:14,124 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:14,140 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 85 transitions. [2019-12-27 22:56:14,140 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:14,258 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:56:14,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:56:14,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:14,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:56:14,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:56:14,259 INFO L87 Difference]: Start difference. First operand 2100 states and 4675 transitions. Second operand 8 states. [2019-12-27 22:56:15,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:15,095 INFO L93 Difference]: Finished difference Result 2859 states and 6230 transitions. [2019-12-27 22:56:15,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:56:15,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-27 22:56:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:15,100 INFO L225 Difference]: With dead ends: 2859 [2019-12-27 22:56:15,100 INFO L226 Difference]: Without dead ends: 2859 [2019-12-27 22:56:15,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:56:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2019-12-27 22:56:15,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2524. [2019-12-27 22:56:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2524 states. [2019-12-27 22:56:15,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2524 states and 5561 transitions. [2019-12-27 22:56:15,125 INFO L78 Accepts]: Start accepts. Automaton has 2524 states and 5561 transitions. Word has length 41 [2019-12-27 22:56:15,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:15,125 INFO L462 AbstractCegarLoop]: Abstraction has 2524 states and 5561 transitions. [2019-12-27 22:56:15,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:56:15,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 5561 transitions. [2019-12-27 22:56:15,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 22:56:15,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:15,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:15,130 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:15,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:15,130 INFO L82 PathProgramCache]: Analyzing trace with hash 621749952, now seen corresponding path program 1 times [2019-12-27 22:56:15,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:15,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359959999] [2019-12-27 22:56:15,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:15,209 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 22:56:15,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359959999] [2019-12-27 22:56:15,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:15,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:56:15,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [447964106] [2019-12-27 22:56:15,210 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:15,219 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:15,229 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 48 transitions. [2019-12-27 22:56:15,229 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:15,230 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:15,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:56:15,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:15,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:56:15,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:56:15,231 INFO L87 Difference]: Start difference. First operand 2524 states and 5561 transitions. Second operand 5 states. [2019-12-27 22:56:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:15,805 INFO L93 Difference]: Finished difference Result 3398 states and 7362 transitions. [2019-12-27 22:56:15,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:56:15,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 22:56:15,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:15,811 INFO L225 Difference]: With dead ends: 3398 [2019-12-27 22:56:15,811 INFO L226 Difference]: Without dead ends: 3398 [2019-12-27 22:56:15,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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 22:56:15,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-12-27 22:56:15,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 2821. [2019-12-27 22:56:15,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2821 states. [2019-12-27 22:56:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 6202 transitions. [2019-12-27 22:56:15,847 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 6202 transitions. Word has length 42 [2019-12-27 22:56:15,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:15,847 INFO L462 AbstractCegarLoop]: Abstraction has 2821 states and 6202 transitions. [2019-12-27 22:56:15,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:56:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 6202 transitions. [2019-12-27 22:56:15,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 22:56:15,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:15,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:15,852 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:15,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:15,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1119205876, now seen corresponding path program 1 times [2019-12-27 22:56:15,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:15,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907758486] [2019-12-27 22:56:15,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:16,376 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 22:56:16,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907758486] [2019-12-27 22:56:16,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:16,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 22:56:16,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [881623037] [2019-12-27 22:56:16,377 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:16,383 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:16,399 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 86 transitions. [2019-12-27 22:56:16,399 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:16,829 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 22:56:16,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 22:56:16,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:16,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 22:56:16,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2019-12-27 22:56:16,830 INFO L87 Difference]: Start difference. First operand 2821 states and 6202 transitions. Second operand 25 states. [2019-12-27 22:56:21,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:21,709 INFO L93 Difference]: Finished difference Result 6019 states and 13021 transitions. [2019-12-27 22:56:21,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 22:56:21,709 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2019-12-27 22:56:21,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:21,716 INFO L225 Difference]: With dead ends: 6019 [2019-12-27 22:56:21,716 INFO L226 Difference]: Without dead ends: 5228 [2019-12-27 22:56:21,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=355, Invalid=1901, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 22:56:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5228 states. [2019-12-27 22:56:21,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5228 to 3485. [2019-12-27 22:56:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3485 states. [2019-12-27 22:56:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 3485 states and 7692 transitions. [2019-12-27 22:56:21,754 INFO L78 Accepts]: Start accepts. Automaton has 3485 states and 7692 transitions. Word has length 42 [2019-12-27 22:56:21,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:21,755 INFO L462 AbstractCegarLoop]: Abstraction has 3485 states and 7692 transitions. [2019-12-27 22:56:21,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 22:56:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3485 states and 7692 transitions. [2019-12-27 22:56:21,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 22:56:21,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:21,761 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:21,761 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:21,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:21,762 INFO L82 PathProgramCache]: Analyzing trace with hash 623105743, now seen corresponding path program 1 times [2019-12-27 22:56:21,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:21,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767300735] [2019-12-27 22:56:21,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:21,840 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 22:56:21,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767300735] [2019-12-27 22:56:21,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:21,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:56:21,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [16672769] [2019-12-27 22:56:21,841 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:21,850 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:21,867 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 90 transitions. [2019-12-27 22:56:21,867 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:21,868 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:21,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:56:21,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:21,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:56:21,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:56:21,869 INFO L87 Difference]: Start difference. First operand 3485 states and 7692 transitions. Second operand 3 states. [2019-12-27 22:56:21,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:21,921 INFO L93 Difference]: Finished difference Result 3446 states and 7582 transitions. [2019-12-27 22:56:21,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:56:21,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-27 22:56:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:21,925 INFO L225 Difference]: With dead ends: 3446 [2019-12-27 22:56:21,925 INFO L226 Difference]: Without dead ends: 3446 [2019-12-27 22:56:21,925 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 22:56:21,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3446 states. [2019-12-27 22:56:21,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3446 to 3308. [2019-12-27 22:56:21,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3308 states. [2019-12-27 22:56:21,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 7308 transitions. [2019-12-27 22:56:21,964 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 7308 transitions. Word has length 42 [2019-12-27 22:56:21,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:21,964 INFO L462 AbstractCegarLoop]: Abstraction has 3308 states and 7308 transitions. [2019-12-27 22:56:21,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:56:21,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 7308 transitions. [2019-12-27 22:56:21,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 22:56:21,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:21,970 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] [2019-12-27 22:56:21,970 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:21,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:21,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1922052399, now seen corresponding path program 1 times [2019-12-27 22:56:21,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:21,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518559496] [2019-12-27 22:56:21,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:22,086 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 22:56:22,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518559496] [2019-12-27 22:56:22,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:22,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:56:22,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [465501848] [2019-12-27 22:56:22,087 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:22,095 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:22,104 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 43 transitions. [2019-12-27 22:56:22,104 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:22,104 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:22,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:56:22,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:22,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:56:22,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:56:22,105 INFO L87 Difference]: Start difference. First operand 3308 states and 7308 transitions. Second operand 5 states. [2019-12-27 22:56:22,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:22,143 INFO L93 Difference]: Finished difference Result 722 states and 1341 transitions. [2019-12-27 22:56:22,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:56:22,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 22:56:22,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:22,144 INFO L225 Difference]: With dead ends: 722 [2019-12-27 22:56:22,145 INFO L226 Difference]: Without dead ends: 647 [2019-12-27 22:56:22,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:56:22,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-12-27 22:56:22,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 460. [2019-12-27 22:56:22,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-12-27 22:56:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 842 transitions. [2019-12-27 22:56:22,150 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 842 transitions. Word has length 43 [2019-12-27 22:56:22,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:22,150 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 842 transitions. [2019-12-27 22:56:22,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:56:22,150 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 842 transitions. [2019-12-27 22:56:22,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 22:56:22,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:22,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:22,151 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:22,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:22,152 INFO L82 PathProgramCache]: Analyzing trace with hash 167419695, now seen corresponding path program 1 times [2019-12-27 22:56:22,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:22,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760331710] [2019-12-27 22:56:22,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:22,296 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 22:56:22,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760331710] [2019-12-27 22:56:22,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:22,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:56:22,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [557734480] [2019-12-27 22:56:22,298 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:22,316 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:22,361 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 110 transitions. [2019-12-27 22:56:22,361 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:22,362 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:22,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:56:22,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:22,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:56:22,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:56:22,364 INFO L87 Difference]: Start difference. First operand 460 states and 842 transitions. Second operand 8 states. [2019-12-27 22:56:22,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:22,484 INFO L93 Difference]: Finished difference Result 698 states and 1283 transitions. [2019-12-27 22:56:22,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:56:22,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-27 22:56:22,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:22,486 INFO L225 Difference]: With dead ends: 698 [2019-12-27 22:56:22,486 INFO L226 Difference]: Without dead ends: 316 [2019-12-27 22:56:22,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:56:22,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-12-27 22:56:22,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 276. [2019-12-27 22:56:22,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-12-27 22:56:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 514 transitions. [2019-12-27 22:56:22,490 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 514 transitions. Word has length 53 [2019-12-27 22:56:22,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:22,491 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 514 transitions. [2019-12-27 22:56:22,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:56:22,491 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 514 transitions. [2019-12-27 22:56:22,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 22:56:22,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:22,493 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:22,493 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:22,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:22,493 INFO L82 PathProgramCache]: Analyzing trace with hash -936120261, now seen corresponding path program 2 times [2019-12-27 22:56:22,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:22,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801655327] [2019-12-27 22:56:22,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:22,551 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 22:56:22,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801655327] [2019-12-27 22:56:22,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:22,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:56:22,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1862844958] [2019-12-27 22:56:22,552 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:22,570 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:22,638 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 110 transitions. [2019-12-27 22:56:22,639 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:22,656 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:56:22,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:56:22,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:22,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:56:22,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:56:22,657 INFO L87 Difference]: Start difference. First operand 276 states and 514 transitions. Second operand 4 states. [2019-12-27 22:56:22,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:22,758 INFO L93 Difference]: Finished difference Result 322 states and 573 transitions. [2019-12-27 22:56:22,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:56:22,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 22:56:22,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:22,759 INFO L225 Difference]: With dead ends: 322 [2019-12-27 22:56:22,759 INFO L226 Difference]: Without dead ends: 322 [2019-12-27 22:56:22,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 22:56:22,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-12-27 22:56:22,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 220. [2019-12-27 22:56:22,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-27 22:56:22,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 391 transitions. [2019-12-27 22:56:22,767 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 391 transitions. Word has length 53 [2019-12-27 22:56:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:22,767 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 391 transitions. [2019-12-27 22:56:22,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:56:22,768 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 391 transitions. [2019-12-27 22:56:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:56:22,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:22,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:22,769 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:22,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:22,769 INFO L82 PathProgramCache]: Analyzing trace with hash 10303747, now seen corresponding path program 1 times [2019-12-27 22:56:22,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:22,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406629886] [2019-12-27 22:56:22,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:23,568 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 22:56:23,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406629886] [2019-12-27 22:56:23,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:23,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-27 22:56:23,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [856151077] [2019-12-27 22:56:23,570 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:23,585 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:23,635 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 113 transitions. [2019-12-27 22:56:23,635 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:23,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 22:56:23,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:56:23,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:56:23,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:56:23,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 22:56:23,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:56:24,389 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:56:24,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-27 22:56:24,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:24,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-27 22:56:24,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 22:56:24,390 INFO L87 Difference]: Start difference. First operand 220 states and 391 transitions. Second operand 33 states. [2019-12-27 22:56:28,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:28,686 INFO L93 Difference]: Finished difference Result 798 states and 1398 transitions. [2019-12-27 22:56:28,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 22:56:28,686 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 54 [2019-12-27 22:56:28,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:28,688 INFO L225 Difference]: With dead ends: 798 [2019-12-27 22:56:28,688 INFO L226 Difference]: Without dead ends: 766 [2019-12-27 22:56:28,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1242 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=794, Invalid=3898, Unknown=0, NotChecked=0, Total=4692 [2019-12-27 22:56:28,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-12-27 22:56:28,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 314. [2019-12-27 22:56:28,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-12-27 22:56:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 555 transitions. [2019-12-27 22:56:28,695 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 555 transitions. Word has length 54 [2019-12-27 22:56:28,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:28,696 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 555 transitions. [2019-12-27 22:56:28,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-27 22:56:28,696 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 555 transitions. [2019-12-27 22:56:28,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:56:28,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:28,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:28,697 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:28,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:28,697 INFO L82 PathProgramCache]: Analyzing trace with hash 676099575, now seen corresponding path program 2 times [2019-12-27 22:56:28,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:28,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255906244] [2019-12-27 22:56:28,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:28,895 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 22:56:28,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255906244] [2019-12-27 22:56:28,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:28,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 22:56:28,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1775829598] [2019-12-27 22:56:28,896 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:28,931 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:28,970 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 127 transitions. [2019-12-27 22:56:28,970 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:29,069 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 22:56:29,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 22:56:29,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:29,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 22:56:29,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-27 22:56:29,070 INFO L87 Difference]: Start difference. First operand 314 states and 555 transitions. Second operand 16 states. [2019-12-27 22:56:30,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:30,949 INFO L93 Difference]: Finished difference Result 697 states and 1178 transitions. [2019-12-27 22:56:30,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 22:56:30,950 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2019-12-27 22:56:30,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:30,951 INFO L225 Difference]: With dead ends: 697 [2019-12-27 22:56:30,951 INFO L226 Difference]: Without dead ends: 665 [2019-12-27 22:56:30,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=292, Invalid=1348, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 22:56:30,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-12-27 22:56:30,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 320. [2019-12-27 22:56:30,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-27 22:56:30,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 562 transitions. [2019-12-27 22:56:30,958 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 562 transitions. Word has length 54 [2019-12-27 22:56:30,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:30,958 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 562 transitions. [2019-12-27 22:56:30,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 22:56:30,958 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 562 transitions. [2019-12-27 22:56:30,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:56:30,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:30,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:30,959 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:30,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:30,960 INFO L82 PathProgramCache]: Analyzing trace with hash 691777001, now seen corresponding path program 3 times [2019-12-27 22:56:30,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:30,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860077423] [2019-12-27 22:56:30,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:31,510 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 22:56:31,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860077423] [2019-12-27 22:56:31,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:31,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 22:56:31,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [846395503] [2019-12-27 22:56:31,511 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:31,521 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:31,546 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 102 transitions. [2019-12-27 22:56:31,547 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:31,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:56:31,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:56:31,884 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 22:56:31,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 22:56:31,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:31,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 22:56:31,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2019-12-27 22:56:31,886 INFO L87 Difference]: Start difference. First operand 320 states and 562 transitions. Second operand 25 states. [2019-12-27 22:56:33,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:33,452 INFO L93 Difference]: Finished difference Result 748 states and 1286 transitions. [2019-12-27 22:56:33,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 22:56:33,453 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2019-12-27 22:56:33,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:33,454 INFO L225 Difference]: With dead ends: 748 [2019-12-27 22:56:33,455 INFO L226 Difference]: Without dead ends: 716 [2019-12-27 22:56:33,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=280, Invalid=1360, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 22:56:33,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-12-27 22:56:33,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 339. [2019-12-27 22:56:33,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-12-27 22:56:33,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 599 transitions. [2019-12-27 22:56:33,460 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 599 transitions. Word has length 54 [2019-12-27 22:56:33,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:33,460 INFO L462 AbstractCegarLoop]: Abstraction has 339 states and 599 transitions. [2019-12-27 22:56:33,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 22:56:33,460 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 599 transitions. [2019-12-27 22:56:33,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:56:33,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:33,461 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:33,461 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:33,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:33,461 INFO L82 PathProgramCache]: Analyzing trace with hash 154508471, now seen corresponding path program 4 times [2019-12-27 22:56:33,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:33,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547636587] [2019-12-27 22:56:33,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:33,818 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 22:56:33,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547636587] [2019-12-27 22:56:33,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:33,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 22:56:33,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1399367926] [2019-12-27 22:56:33,820 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:33,838 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:33,880 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 126 transitions. [2019-12-27 22:56:33,880 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:34,154 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 22:56:34,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 22:56:34,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:34,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 22:56:34,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2019-12-27 22:56:34,156 INFO L87 Difference]: Start difference. First operand 339 states and 599 transitions. Second operand 21 states. [2019-12-27 22:56:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:35,198 INFO L93 Difference]: Finished difference Result 483 states and 817 transitions. [2019-12-27 22:56:35,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 22:56:35,199 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2019-12-27 22:56:35,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:35,200 INFO L225 Difference]: With dead ends: 483 [2019-12-27 22:56:35,200 INFO L226 Difference]: Without dead ends: 451 [2019-12-27 22:56:35,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=871, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 22:56:35,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-12-27 22:56:35,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 328. [2019-12-27 22:56:35,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 22:56:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 576 transitions. [2019-12-27 22:56:35,206 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 576 transitions. Word has length 54 [2019-12-27 22:56:35,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:35,206 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 576 transitions. [2019-12-27 22:56:35,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 22:56:35,207 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 576 transitions. [2019-12-27 22:56:35,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:56:35,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:35,208 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:35,208 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:56:35,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:35,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1943788027, now seen corresponding path program 5 times [2019-12-27 22:56:35,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:35,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77442236] [2019-12-27 22:56:35,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:56:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:56:35,313 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:56:35,313 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:56:35,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2473~0.base_19|) (= v_~x~0_11 0) (= v_~y$r_buff0_thd1~0_24 0) (= 0 v_~y$r_buff1_thd0~0_45) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd2~0_19 0) (= v_~y$w_buff0_used~0_108 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2473~0.base_19|) 0) (= v_~y$mem_tmp~0_11 0) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t2473~0.base_19| 1)) (= 0 v_~y$w_buff0~0_29) (= v_~y~0_28 0) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2473~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2473~0.base_19|) |v_ULTIMATE.start_main_~#t2473~0.offset_16| 0))) (= 0 |v_#NULL.base_6|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2473~0.base_19| 4)) (= v_~y$w_buff1_used~0_62 0) (= 0 v_~y$r_buff1_thd2~0_17) (= v_~y$r_buff0_thd0~0_81 0) (= 0 v_~weak$$choice0~0_6) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~y$r_buff1_thd1~0_17) (= 0 v_~weak$$choice2~0_31) (= 0 |v_ULTIMATE.start_main_~#t2473~0.offset_16|) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_15|, ULTIMATE.start_main_~#t2473~0.base=|v_ULTIMATE.start_main_~#t2473~0.base_19|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_12|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_10|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_15|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_15|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_8|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_15|, ULTIMATE.start_main_~#t2474~0.offset=|v_ULTIMATE.start_main_~#t2474~0.offset_15|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_15|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_19, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_~#t2473~0.offset=|v_ULTIMATE.start_main_~#t2473~0.offset_16|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_45, ~x~0=v_~x~0_11, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_12|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_12|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_13|, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_28, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_12|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_10|, ULTIMATE.start_main_~#t2474~0.base=|v_ULTIMATE.start_main_~#t2474~0.base_19|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_12|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_12|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_15|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_81, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_62} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2473~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2474~0.offset, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2473~0.offset, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_~#t2474~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:56:35,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L777-1-->L779: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2474~0.base_11|)) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2474~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2474~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2474~0.base_11|) |v_ULTIMATE.start_main_~#t2474~0.offset_10| 1))) (= 0 |v_ULTIMATE.start_main_~#t2474~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2474~0.base_11|) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2474~0.base_11|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2474~0.base_11| 4) |v_#length_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2474~0.base=|v_ULTIMATE.start_main_~#t2474~0.base_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2474~0.offset=|v_ULTIMATE.start_main_~#t2474~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2474~0.base, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2474~0.offset] because there is no mapped edge [2019-12-27 22:56:35,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 2 v_~y$w_buff0~0_21) (= v_~y$w_buff1_used~0_52 v_~y$w_buff0_used~0_89) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y$w_buff0~0_22 v_~y$w_buff1~0_18) (= 0 (mod v_~y$w_buff1_used~0_52 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= 1 v_~y$w_buff0_used~0_88)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_22, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_21, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_52} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:56:35,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-706322976 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-706322976 256) 0))) (or (and (= ~y$w_buff0_used~0_In-706322976 |P0Thread1of1ForFork0_#t~ite5_Out-706322976|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-706322976|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-706322976, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-706322976} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-706322976|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-706322976, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-706322976} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:56:35,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L754-2-->L754-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1659990637 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1659990637 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-1659990637 |P1Thread1of1ForFork1_#t~ite9_Out-1659990637|)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1659990637| ~y~0_In-1659990637) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1659990637, ~y$w_buff1~0=~y$w_buff1~0_In-1659990637, ~y~0=~y~0_In-1659990637, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1659990637} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1659990637, ~y$w_buff1~0=~y$w_buff1~0_In-1659990637, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1659990637|, ~y~0=~y~0_In-1659990637, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1659990637} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 22:56:35,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L754-4-->L755: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_21) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 22:56:35,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-631496565 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-631496565 256) 0))) (or (and (= ~y$w_buff0_used~0_In-631496565 |P1Thread1of1ForFork1_#t~ite11_Out-631496565|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-631496565|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-631496565, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-631496565} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-631496565, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-631496565, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-631496565|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 22:56:35,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L736-->L736-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd1~0_In-115851850 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-115851850 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-115851850 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-115851850 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-115851850| ~y$w_buff1_used~0_In-115851850) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite6_Out-115851850| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-115851850, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-115851850, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-115851850, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-115851850} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-115851850|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-115851850, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-115851850, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-115851850, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-115851850} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:56:35,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L737-->L738: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1639119158 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1639119158 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-1639119158 ~y$r_buff0_thd1~0_Out-1639119158)) (and (not .cse0) (= ~y$r_buff0_thd1~0_Out-1639119158 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1639119158, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1639119158} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1639119158, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1639119158|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1639119158} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:56:35,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L756-->L756-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-259541582 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-259541582 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-259541582 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-259541582 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out-259541582| ~y$w_buff1_used~0_In-259541582) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite12_Out-259541582| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-259541582, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-259541582, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-259541582, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-259541582} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-259541582, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-259541582, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-259541582, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-259541582|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-259541582} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:56:35,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1313801143 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1313801143 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1313801143| ~y$r_buff0_thd2~0_In-1313801143) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1313801143| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1313801143, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1313801143} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1313801143, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1313801143, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1313801143|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 22:56:35,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1464029276 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1464029276 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1464029276 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1464029276 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1464029276| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In-1464029276 |P1Thread1of1ForFork1_#t~ite14_Out-1464029276|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1464029276, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1464029276, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1464029276, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1464029276} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1464029276, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1464029276, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1464029276, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1464029276|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1464029276} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 22:56:35,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 22:56:35,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L738-->L738-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-116536008 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-116536008 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-116536008 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-116536008 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-116536008|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd1~0_In-116536008 |P0Thread1of1ForFork0_#t~ite8_Out-116536008|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-116536008, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-116536008, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-116536008, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-116536008} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-116536008, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-116536008, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-116536008|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-116536008, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-116536008} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:56:35,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L738-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 22:56:35,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [592] [592] L783-->L785-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~y$r_buff0_thd0~0_51 256)) (= (mod v_~y$w_buff0_used~0_75 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_75, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_75, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 22:56:35,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L785-2-->L785-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1947577741 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1947577741 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite17_Out1947577741| ~y~0_In1947577741)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite17_Out1947577741| ~y$w_buff1~0_In1947577741) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1947577741, ~y~0=~y~0_In1947577741, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1947577741, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1947577741} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1947577741|, ~y$w_buff1~0=~y$w_buff1~0_In1947577741, ~y~0=~y~0_In1947577741, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1947577741, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1947577741} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 22:56:35,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L785-4-->L786: Formula: (= v_~y~0_20 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~y~0=v_~y~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-27 22:56:35,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In284466545 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In284466545 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite19_Out284466545|) (not .cse1)) (and (= ~y$w_buff0_used~0_In284466545 |ULTIMATE.start_main_#t~ite19_Out284466545|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In284466545, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In284466545} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In284466545, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out284466545|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In284466545} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 22:56:35,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1415419968 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1415419968 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1415419968 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1415419968 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite20_Out1415419968| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite20_Out1415419968| ~y$w_buff1_used~0_In1415419968)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1415419968, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1415419968, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1415419968, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1415419968} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1415419968, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1415419968, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1415419968|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1415419968, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1415419968} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 22:56:35,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2134062698 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2134062698 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out-2134062698| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out-2134062698| ~y$r_buff0_thd0~0_In-2134062698) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2134062698, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2134062698} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2134062698, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2134062698, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-2134062698|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 22:56:35,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-97468596 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-97468596 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-97468596 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-97468596 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-97468596| ~y$r_buff1_thd0~0_In-97468596) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite22_Out-97468596| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-97468596, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-97468596, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-97468596, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-97468596} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-97468596, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-97468596, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-97468596, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-97468596|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-97468596} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 22:56:35,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L799-->L799-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In438984902 256)))) (or (and (= ~y$w_buff0_used~0_In438984902 |ULTIMATE.start_main_#t~ite35_Out438984902|) (= |ULTIMATE.start_main_#t~ite34_In438984902| |ULTIMATE.start_main_#t~ite34_Out438984902|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In438984902 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In438984902 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In438984902 256))) (= 0 (mod ~y$w_buff0_used~0_In438984902 256)))) (= |ULTIMATE.start_main_#t~ite34_Out438984902| ~y$w_buff0_used~0_In438984902) (= |ULTIMATE.start_main_#t~ite34_Out438984902| |ULTIMATE.start_main_#t~ite35_Out438984902|) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In438984902, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In438984902, ~weak$$choice2~0=~weak$$choice2~0_In438984902, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In438984902, ~y$w_buff1_used~0=~y$w_buff1_used~0_In438984902, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_In438984902|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In438984902, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In438984902, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out438984902|, ~weak$$choice2~0=~weak$$choice2~0_In438984902, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In438984902, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out438984902|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In438984902} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 22:56:35,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [597] [597] L801-->L802: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~y$r_buff0_thd0~0_54 v_~y$r_buff0_thd0~0_53)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_54, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-27 22:56:35,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L804-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_8 256)) (= v_~y~0_24 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_24, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:56:35,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 22:56:35,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:56:35 BasicIcfg [2019-12-27 22:56:35,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:56:35,452 INFO L168 Benchmark]: Toolchain (without parser) took 36308.74 ms. Allocated memory was 138.4 MB in the beginning and 1.0 GB in the end (delta: 911.2 MB). Free memory was 102.1 MB in the beginning and 297.5 MB in the end (delta: -195.4 MB). Peak memory consumption was 715.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:56:35,453 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 22:56:35,456 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.56 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 101.7 MB in the beginning and 156.3 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:56:35,458 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.50 ms. Allocated memory is still 201.9 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:56:35,459 INFO L168 Benchmark]: Boogie Preprocessor took 37.49 ms. Allocated memory is still 201.9 MB. Free memory was 153.6 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:56:35,459 INFO L168 Benchmark]: RCFGBuilder took 863.50 ms. Allocated memory is still 201.9 MB. Free memory was 151.0 MB in the beginning and 106.9 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-27 22:56:35,460 INFO L168 Benchmark]: TraceAbstraction took 34604.37 ms. Allocated memory was 201.9 MB in the beginning and 1.0 GB in the end (delta: 847.8 MB). Free memory was 106.9 MB in the beginning and 297.5 MB in the end (delta: -190.6 MB). Peak memory consumption was 657.2 MB. Max. memory is 7.1 GB. [2019-12-27 22:56:35,469 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.16 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 730.56 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 101.7 MB in the beginning and 156.3 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.50 ms. Allocated memory is still 201.9 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.49 ms. Allocated memory is still 201.9 MB. Free memory was 153.6 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 863.50 ms. Allocated memory is still 201.9 MB. Free memory was 151.0 MB in the beginning and 106.9 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34604.37 ms. Allocated memory was 201.9 MB in the beginning and 1.0 GB in the end (delta: 847.8 MB). Free memory was 106.9 MB in the beginning and 297.5 MB in the end (delta: -190.6 MB). Peak memory consumption was 657.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 145 ProgramPointsBefore, 80 ProgramPointsAfterwards, 179 TransitionsBefore, 93 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 24 ChoiceCompositions, 3351 VarBasedMoverChecksPositive, 154 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48987 CheckedPairsTotal, 94 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L726] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L727] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L728] 1 y$r_buff0_thd1 = (_Bool)1 [L731] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 2 x = 2 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L736] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L788] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 y$flush_delayed = weak$$choice2 [L795] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 34.3s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2683 SDtfs, 3686 SDslu, 10276 SDs, 0 SdLazy, 12266 SolverSat, 398 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 55 SyntacticMatches, 32 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2585 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16589occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 17888 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 746 NumberOfCodeBlocks, 746 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 673 ConstructedInterpolants, 0 QuantifiedInterpolants, 159854 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...