/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:35:52,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:35:52,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:35:52,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:35:52,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:35:52,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:35:52,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:35:52,875 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:35:52,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:35:52,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:35:52,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:35:52,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:35:52,886 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:35:52,887 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:35:52,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:35:52,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:35:52,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:35:52,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:35:52,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:35:52,899 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:35:52,901 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:35:52,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:35:52,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:35:52,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:35:52,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:35:52,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:35:52,909 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:35:52,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:35:52,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:35:52,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:35:52,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:35:52,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:35:52,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:35:52,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:35:52,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:35:52,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:35:52,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:35:52,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:35:52,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:35:52,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:35:52,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:35:52,918 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:35:52,932 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:35:52,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:35:52,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:35:52,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:35:52,934 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:35:52,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:35:52,934 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:35:52,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:35:52,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:35:52,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:35:52,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:35:52,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:35:52,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:35:52,935 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:35:52,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:35:52,936 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:35:52,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:35:52,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:35:52,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:35:52,937 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:35:52,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:35:52,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:35:52,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:35:52,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:35:52,938 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:35:52,938 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:35:52,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:35:52,938 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:35:52,938 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:35:52,939 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:35:53,225 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:35:53,239 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:35:53,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:35:53,244 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:35:53,244 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:35:53,245 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.opt.i [2019-12-27 07:35:53,307 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e5065d08/18ff6b51ea7249b8ba89ff8738fb3ded/FLAG5a9400a65 [2019-12-27 07:35:53,858 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:35:53,859 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_rmo.opt.i [2019-12-27 07:35:53,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e5065d08/18ff6b51ea7249b8ba89ff8738fb3ded/FLAG5a9400a65 [2019-12-27 07:35:54,124 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e5065d08/18ff6b51ea7249b8ba89ff8738fb3ded [2019-12-27 07:35:54,134 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:35:54,136 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:35:54,137 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:35:54,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:35:54,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:35:54,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:35:54" (1/1) ... [2019-12-27 07:35:54,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e211ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:54, skipping insertion in model container [2019-12-27 07:35:54,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:35:54" (1/1) ... [2019-12-27 07:35:54,152 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:35:54,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:35:54,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:35:54,771 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:35:54,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:35:54,940 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:35:54,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:54 WrapperNode [2019-12-27 07:35:54,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:35:54,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:35:54,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:35:54,942 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:35:54,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:54" (1/1) ... [2019-12-27 07:35:54,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:54" (1/1) ... [2019-12-27 07:35:55,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:35:55,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:35:55,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:35:55,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:35:55,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:54" (1/1) ... [2019-12-27 07:35:55,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:54" (1/1) ... [2019-12-27 07:35:55,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:54" (1/1) ... [2019-12-27 07:35:55,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:54" (1/1) ... [2019-12-27 07:35:55,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:54" (1/1) ... [2019-12-27 07:35:55,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:54" (1/1) ... [2019-12-27 07:35:55,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:54" (1/1) ... [2019-12-27 07:35:55,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:35:55,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:35:55,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:35:55,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:35:55,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:54" (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 07:35:55,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:35:55,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:35:55,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:35:55,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:35:55,144 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:35:55,144 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:35:55,144 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:35:55,144 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:35:55,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:35:55,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:35:55,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:35:55,146 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 07:35:55,844 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:35:55,845 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:35:55,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:35:55 BoogieIcfgContainer [2019-12-27 07:35:55,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:35:55,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:35:55,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:35:55,852 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:35:55,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:35:54" (1/3) ... [2019-12-27 07:35:55,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680f915b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:35:55, skipping insertion in model container [2019-12-27 07:35:55,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:54" (2/3) ... [2019-12-27 07:35:55,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680f915b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:35:55, skipping insertion in model container [2019-12-27 07:35:55,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:35:55" (3/3) ... [2019-12-27 07:35:55,860 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_rmo.opt.i [2019-12-27 07:35:55,871 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:35:55,871 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:35:55,879 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:35:55,880 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:35:55,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,915 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,915 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,916 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,916 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,917 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,925 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,925 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,938 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,938 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,939 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,942 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,943 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:35:55,960 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:35:55,982 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:35:55,982 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:35:55,983 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:35:55,983 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:35:55,983 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:35:55,983 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:35:55,983 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:35:55,983 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:35:56,001 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 07:35:56,003 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 07:35:56,101 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 07:35:56,101 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:35:56,114 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:35:56,132 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 07:35:56,175 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 07:35:56,175 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:35:56,180 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:35:56,193 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-27 07:35:56,195 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:35:59,183 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 07:35:59,304 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54561 [2019-12-27 07:35:59,304 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 07:35:59,308 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-27 07:35:59,854 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9482 states. [2019-12-27 07:35:59,857 INFO L276 IsEmpty]: Start isEmpty. Operand 9482 states. [2019-12-27 07:35:59,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:35:59,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:59,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:35:59,871 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:35:59,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:59,879 INFO L82 PathProgramCache]: Analyzing trace with hash 719045, now seen corresponding path program 1 times [2019-12-27 07:35:59,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:59,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875027780] [2019-12-27 07:35:59,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:00,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:36:00,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875027780] [2019-12-27 07:36:00,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:00,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:36:00,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709612206] [2019-12-27 07:36:00,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:36:00,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:00,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:36:00,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:36:00,203 INFO L87 Difference]: Start difference. First operand 9482 states. Second operand 3 states. [2019-12-27 07:36:00,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:00,540 INFO L93 Difference]: Finished difference Result 9432 states and 30962 transitions. [2019-12-27 07:36:00,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:36:00,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:36:00,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:00,693 INFO L225 Difference]: With dead ends: 9432 [2019-12-27 07:36:00,693 INFO L226 Difference]: Without dead ends: 9250 [2019-12-27 07:36:00,703 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 07:36:00,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9250 states. [2019-12-27 07:36:01,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9250 to 9250. [2019-12-27 07:36:01,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9250 states. [2019-12-27 07:36:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9250 states to 9250 states and 30402 transitions. [2019-12-27 07:36:01,252 INFO L78 Accepts]: Start accepts. Automaton has 9250 states and 30402 transitions. Word has length 3 [2019-12-27 07:36:01,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:01,253 INFO L462 AbstractCegarLoop]: Abstraction has 9250 states and 30402 transitions. [2019-12-27 07:36:01,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:36:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 9250 states and 30402 transitions. [2019-12-27 07:36:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:36:01,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:01,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:36:01,257 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:01,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:01,257 INFO L82 PathProgramCache]: Analyzing trace with hash 616626766, now seen corresponding path program 1 times [2019-12-27 07:36:01,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:01,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091924280] [2019-12-27 07:36:01,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:01,337 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 07:36:01,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091924280] [2019-12-27 07:36:01,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:01,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:36:01,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301037196] [2019-12-27 07:36:01,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:36:01,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:01,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:36:01,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:36:01,341 INFO L87 Difference]: Start difference. First operand 9250 states and 30402 transitions. Second operand 4 states. [2019-12-27 07:36:01,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:01,731 INFO L93 Difference]: Finished difference Result 14408 states and 45299 transitions. [2019-12-27 07:36:01,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:36:01,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:36:01,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:01,811 INFO L225 Difference]: With dead ends: 14408 [2019-12-27 07:36:01,812 INFO L226 Difference]: Without dead ends: 14401 [2019-12-27 07:36:01,813 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 07:36:01,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14401 states. [2019-12-27 07:36:03,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14401 to 13161. [2019-12-27 07:36:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13161 states. [2019-12-27 07:36:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13161 states to 13161 states and 42025 transitions. [2019-12-27 07:36:03,070 INFO L78 Accepts]: Start accepts. Automaton has 13161 states and 42025 transitions. Word has length 11 [2019-12-27 07:36:03,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:03,073 INFO L462 AbstractCegarLoop]: Abstraction has 13161 states and 42025 transitions. [2019-12-27 07:36:03,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:36:03,075 INFO L276 IsEmpty]: Start isEmpty. Operand 13161 states and 42025 transitions. [2019-12-27 07:36:03,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:36:03,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:03,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:36:03,082 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:03,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:03,083 INFO L82 PathProgramCache]: Analyzing trace with hash -887269812, now seen corresponding path program 1 times [2019-12-27 07:36:03,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:03,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414769211] [2019-12-27 07:36:03,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:03,196 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 07:36:03,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414769211] [2019-12-27 07:36:03,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:03,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:36:03,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117472043] [2019-12-27 07:36:03,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:36:03,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:03,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:36:03,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:36:03,199 INFO L87 Difference]: Start difference. First operand 13161 states and 42025 transitions. Second operand 4 states. [2019-12-27 07:36:03,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:03,614 INFO L93 Difference]: Finished difference Result 16164 states and 50739 transitions. [2019-12-27 07:36:03,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:36:03,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:36:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:03,668 INFO L225 Difference]: With dead ends: 16164 [2019-12-27 07:36:03,668 INFO L226 Difference]: Without dead ends: 16164 [2019-12-27 07:36:03,669 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 07:36:03,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16164 states. [2019-12-27 07:36:04,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16164 to 14464. [2019-12-27 07:36:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14464 states. [2019-12-27 07:36:04,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14464 states to 14464 states and 45803 transitions. [2019-12-27 07:36:04,201 INFO L78 Accepts]: Start accepts. Automaton has 14464 states and 45803 transitions. Word has length 11 [2019-12-27 07:36:04,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:04,202 INFO L462 AbstractCegarLoop]: Abstraction has 14464 states and 45803 transitions. [2019-12-27 07:36:04,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:36:04,202 INFO L276 IsEmpty]: Start isEmpty. Operand 14464 states and 45803 transitions. [2019-12-27 07:36:04,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:36:04,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:04,207 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 07:36:04,207 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:04,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:04,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1340562840, now seen corresponding path program 1 times [2019-12-27 07:36:04,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:04,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868304821] [2019-12-27 07:36:04,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:04,356 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 07:36:04,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868304821] [2019-12-27 07:36:04,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:04,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:36:04,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422565078] [2019-12-27 07:36:04,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:36:04,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:04,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:36:04,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:36:04,362 INFO L87 Difference]: Start difference. First operand 14464 states and 45803 transitions. Second operand 5 states. [2019-12-27 07:36:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:04,968 INFO L93 Difference]: Finished difference Result 19369 states and 59796 transitions. [2019-12-27 07:36:04,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:36:04,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 07:36:04,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:05,037 INFO L225 Difference]: With dead ends: 19369 [2019-12-27 07:36:05,038 INFO L226 Difference]: Without dead ends: 19362 [2019-12-27 07:36:05,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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 07:36:05,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19362 states. [2019-12-27 07:36:05,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19362 to 14438. [2019-12-27 07:36:05,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14438 states. [2019-12-27 07:36:05,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14438 states to 14438 states and 45411 transitions. [2019-12-27 07:36:05,740 INFO L78 Accepts]: Start accepts. Automaton has 14438 states and 45411 transitions. Word has length 17 [2019-12-27 07:36:05,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:05,741 INFO L462 AbstractCegarLoop]: Abstraction has 14438 states and 45411 transitions. [2019-12-27 07:36:05,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:36:05,741 INFO L276 IsEmpty]: Start isEmpty. Operand 14438 states and 45411 transitions. [2019-12-27 07:36:05,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:36:05,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:05,754 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 07:36:05,755 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:05,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:05,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1840046616, now seen corresponding path program 1 times [2019-12-27 07:36:05,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:05,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315945963] [2019-12-27 07:36:05,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:05,838 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 07:36:05,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315945963] [2019-12-27 07:36:05,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:05,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:36:05,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192183727] [2019-12-27 07:36:05,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:36:05,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:05,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:36:05,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:36:05,841 INFO L87 Difference]: Start difference. First operand 14438 states and 45411 transitions. Second operand 3 states. [2019-12-27 07:36:05,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:05,953 INFO L93 Difference]: Finished difference Result 17602 states and 54691 transitions. [2019-12-27 07:36:05,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:36:05,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 07:36:05,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:06,010 INFO L225 Difference]: With dead ends: 17602 [2019-12-27 07:36:06,010 INFO L226 Difference]: Without dead ends: 17602 [2019-12-27 07:36:06,011 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 07:36:06,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17602 states. [2019-12-27 07:36:06,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17602 to 15582. [2019-12-27 07:36:06,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15582 states. [2019-12-27 07:36:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15582 states to 15582 states and 48928 transitions. [2019-12-27 07:36:06,450 INFO L78 Accepts]: Start accepts. Automaton has 15582 states and 48928 transitions. Word has length 25 [2019-12-27 07:36:06,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:06,451 INFO L462 AbstractCegarLoop]: Abstraction has 15582 states and 48928 transitions. [2019-12-27 07:36:06,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:36:06,451 INFO L276 IsEmpty]: Start isEmpty. Operand 15582 states and 48928 transitions. [2019-12-27 07:36:06,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:36:06,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:06,467 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 07:36:06,468 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:06,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:06,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1840202205, now seen corresponding path program 1 times [2019-12-27 07:36:06,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:06,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829527676] [2019-12-27 07:36:06,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:06,528 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 07:36:06,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829527676] [2019-12-27 07:36:06,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:06,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:36:06,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436242775] [2019-12-27 07:36:06,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:36:06,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:06,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:36:06,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:36:06,530 INFO L87 Difference]: Start difference. First operand 15582 states and 48928 transitions. Second operand 4 states. [2019-12-27 07:36:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:06,563 INFO L93 Difference]: Finished difference Result 2444 states and 5542 transitions. [2019-12-27 07:36:06,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:36:06,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:36:06,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:06,568 INFO L225 Difference]: With dead ends: 2444 [2019-12-27 07:36:06,569 INFO L226 Difference]: Without dead ends: 2145 [2019-12-27 07:36:06,569 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 07:36:06,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2019-12-27 07:36:06,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 2145. [2019-12-27 07:36:06,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2019-12-27 07:36:06,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 4722 transitions. [2019-12-27 07:36:06,607 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 4722 transitions. Word has length 25 [2019-12-27 07:36:06,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:06,607 INFO L462 AbstractCegarLoop]: Abstraction has 2145 states and 4722 transitions. [2019-12-27 07:36:06,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:36:06,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 4722 transitions. [2019-12-27 07:36:06,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 07:36:06,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:06,611 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 07:36:06,611 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:06,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:06,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1265486951, now seen corresponding path program 1 times [2019-12-27 07:36:06,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:06,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544062374] [2019-12-27 07:36:06,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:07,252 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 07:36:07,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544062374] [2019-12-27 07:36:07,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:07,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:36:07,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070376908] [2019-12-27 07:36:07,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:36:07,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:07,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:36:07,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:36:07,255 INFO L87 Difference]: Start difference. First operand 2145 states and 4722 transitions. Second operand 5 states. [2019-12-27 07:36:07,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:07,300 INFO L93 Difference]: Finished difference Result 443 states and 801 transitions. [2019-12-27 07:36:07,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:36:07,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 07:36:07,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:07,302 INFO L225 Difference]: With dead ends: 443 [2019-12-27 07:36:07,302 INFO L226 Difference]: Without dead ends: 372 [2019-12-27 07:36:07,302 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 07:36:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-27 07:36:07,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 344. [2019-12-27 07:36:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-27 07:36:07,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 620 transitions. [2019-12-27 07:36:07,309 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 620 transitions. Word has length 37 [2019-12-27 07:36:07,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:07,309 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 620 transitions. [2019-12-27 07:36:07,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:36:07,309 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 620 transitions. [2019-12-27 07:36:07,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:36:07,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:07,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:36:07,311 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:07,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:07,311 INFO L82 PathProgramCache]: Analyzing trace with hash -723762532, now seen corresponding path program 1 times [2019-12-27 07:36:07,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:07,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734247308] [2019-12-27 07:36:07,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:07,395 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 07:36:07,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734247308] [2019-12-27 07:36:07,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:07,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:36:07,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003015373] [2019-12-27 07:36:07,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:36:07,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:07,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:36:07,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:36:07,399 INFO L87 Difference]: Start difference. First operand 344 states and 620 transitions. Second operand 3 states. [2019-12-27 07:36:07,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:07,413 INFO L93 Difference]: Finished difference Result 332 states and 584 transitions. [2019-12-27 07:36:07,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:36:07,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 07:36:07,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:07,414 INFO L225 Difference]: With dead ends: 332 [2019-12-27 07:36:07,414 INFO L226 Difference]: Without dead ends: 332 [2019-12-27 07:36:07,415 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 07:36:07,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-27 07:36:07,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2019-12-27 07:36:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-27 07:36:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 584 transitions. [2019-12-27 07:36:07,420 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 584 transitions. Word has length 52 [2019-12-27 07:36:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:07,421 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 584 transitions. [2019-12-27 07:36:07,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:36:07,422 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 584 transitions. [2019-12-27 07:36:07,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 07:36:07,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:07,425 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 07:36:07,425 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:07,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:07,426 INFO L82 PathProgramCache]: Analyzing trace with hash -2146679471, now seen corresponding path program 1 times [2019-12-27 07:36:07,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:07,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992671935] [2019-12-27 07:36:07,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:07,537 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 07:36:07,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992671935] [2019-12-27 07:36:07,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:07,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:36:07,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124210011] [2019-12-27 07:36:07,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:36:07,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:07,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:36:07,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:36:07,540 INFO L87 Difference]: Start difference. First operand 332 states and 584 transitions. Second operand 5 states. [2019-12-27 07:36:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:07,739 INFO L93 Difference]: Finished difference Result 488 states and 866 transitions. [2019-12-27 07:36:07,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:36:07,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 07:36:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:07,741 INFO L225 Difference]: With dead ends: 488 [2019-12-27 07:36:07,741 INFO L226 Difference]: Without dead ends: 488 [2019-12-27 07:36:07,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:36:07,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-12-27 07:36:07,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 423. [2019-12-27 07:36:07,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-12-27 07:36:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 750 transitions. [2019-12-27 07:36:07,749 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 750 transitions. Word has length 53 [2019-12-27 07:36:07,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:07,749 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 750 transitions. [2019-12-27 07:36:07,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:36:07,749 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 750 transitions. [2019-12-27 07:36:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 07:36:07,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:07,751 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 07:36:07,751 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:07,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:07,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1496527321, now seen corresponding path program 2 times [2019-12-27 07:36:07,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:07,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667845943] [2019-12-27 07:36:07,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:07,857 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 07:36:07,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667845943] [2019-12-27 07:36:07,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:07,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:36:07,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815121926] [2019-12-27 07:36:07,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:36:07,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:07,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:36:07,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:36:07,860 INFO L87 Difference]: Start difference. First operand 423 states and 750 transitions. Second operand 3 states. [2019-12-27 07:36:07,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:07,905 INFO L93 Difference]: Finished difference Result 423 states and 749 transitions. [2019-12-27 07:36:07,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:36:07,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 07:36:07,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:07,906 INFO L225 Difference]: With dead ends: 423 [2019-12-27 07:36:07,906 INFO L226 Difference]: Without dead ends: 423 [2019-12-27 07:36:07,906 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 07:36:07,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-12-27 07:36:07,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 332. [2019-12-27 07:36:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-27 07:36:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 583 transitions. [2019-12-27 07:36:07,913 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 583 transitions. Word has length 53 [2019-12-27 07:36:07,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:07,913 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 583 transitions. [2019-12-27 07:36:07,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:36:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 583 transitions. [2019-12-27 07:36:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:36:07,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:07,915 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 07:36:07,915 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:07,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:07,916 INFO L82 PathProgramCache]: Analyzing trace with hash -826251112, now seen corresponding path program 1 times [2019-12-27 07:36:07,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:07,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736942279] [2019-12-27 07:36:07,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:08,279 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 07:36:08,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736942279] [2019-12-27 07:36:08,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:08,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:36:08,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668005408] [2019-12-27 07:36:08,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 07:36:08,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:08,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 07:36:08,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:36:08,284 INFO L87 Difference]: Start difference. First operand 332 states and 583 transitions. Second operand 13 states. [2019-12-27 07:36:09,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:09,010 INFO L93 Difference]: Finished difference Result 821 states and 1400 transitions. [2019-12-27 07:36:09,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 07:36:09,011 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 07:36:09,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:09,012 INFO L225 Difference]: With dead ends: 821 [2019-12-27 07:36:09,012 INFO L226 Difference]: Without dead ends: 273 [2019-12-27 07:36:09,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2019-12-27 07:36:09,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-12-27 07:36:09,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 222. [2019-12-27 07:36:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-27 07:36:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 393 transitions. [2019-12-27 07:36:09,017 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 393 transitions. Word has length 54 [2019-12-27 07:36:09,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:09,017 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 393 transitions. [2019-12-27 07:36:09,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 07:36:09,017 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 393 transitions. [2019-12-27 07:36:09,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:36:09,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:09,018 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 07:36:09,018 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:09,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:09,019 INFO L82 PathProgramCache]: Analyzing trace with hash -2130111720, now seen corresponding path program 2 times [2019-12-27 07:36:09,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:09,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308025072] [2019-12-27 07:36:09,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:09,299 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 07:36:09,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308025072] [2019-12-27 07:36:09,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:09,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:36:09,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774654259] [2019-12-27 07:36:09,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:36:09,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:09,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:36:09,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:36:09,302 INFO L87 Difference]: Start difference. First operand 222 states and 393 transitions. Second operand 12 states. [2019-12-27 07:36:09,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:09,770 INFO L93 Difference]: Finished difference Result 390 states and 669 transitions. [2019-12-27 07:36:09,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 07:36:09,770 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-27 07:36:09,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:09,771 INFO L225 Difference]: With dead ends: 390 [2019-12-27 07:36:09,772 INFO L226 Difference]: Without dead ends: 356 [2019-12-27 07:36:09,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-12-27 07:36:09,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-12-27 07:36:09,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 322. [2019-12-27 07:36:09,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-27 07:36:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 564 transitions. [2019-12-27 07:36:09,778 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 564 transitions. Word has length 54 [2019-12-27 07:36:09,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:09,779 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 564 transitions. [2019-12-27 07:36:09,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:36:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 564 transitions. [2019-12-27 07:36:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:36:09,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:09,780 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 07:36:09,780 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:09,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:09,781 INFO L82 PathProgramCache]: Analyzing trace with hash -688648962, now seen corresponding path program 3 times [2019-12-27 07:36:09,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:09,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688319205] [2019-12-27 07:36:09,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:10,068 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 07:36:10,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688319205] [2019-12-27 07:36:10,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:10,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:36:10,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565235279] [2019-12-27 07:36:10,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 07:36:10,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:10,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 07:36:10,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:36:10,070 INFO L87 Difference]: Start difference. First operand 322 states and 564 transitions. Second operand 13 states. [2019-12-27 07:36:10,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:10,552 INFO L93 Difference]: Finished difference Result 426 states and 720 transitions. [2019-12-27 07:36:10,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 07:36:10,553 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 07:36:10,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:10,554 INFO L225 Difference]: With dead ends: 426 [2019-12-27 07:36:10,554 INFO L226 Difference]: Without dead ends: 392 [2019-12-27 07:36:10,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-27 07:36:10,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-12-27 07:36:10,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 330. [2019-12-27 07:36:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-12-27 07:36:10,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 578 transitions. [2019-12-27 07:36:10,561 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 578 transitions. Word has length 54 [2019-12-27 07:36:10,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:10,561 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 578 transitions. [2019-12-27 07:36:10,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 07:36:10,561 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 578 transitions. [2019-12-27 07:36:10,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:36:10,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:10,562 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 07:36:10,563 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:10,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:10,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1187524996, now seen corresponding path program 4 times [2019-12-27 07:36:10,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:10,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425262862] [2019-12-27 07:36:10,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:36:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:36:10,658 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:36:10,659 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:36:10,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= v_~x~0_11 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice0~0_9) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~y$r_buff1_thd1~0_20) (= v_~y$read_delayed~0_7 0) (= |v_#NULL.offset_3| 0) (= v_~main$tmp_guard0~0_12 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2019~0.base_24|) (= 0 v_~y$w_buff1~0_25) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2019~0.base_24| 4)) (= v_~y$w_buff0_used~0_103 0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2019~0.base_24| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2019~0.base_24|) |v_ULTIMATE.start_main_~#t2019~0.offset_19| 0)) |v_#memory_int_9|) (= v_~y~0_29 0) (= 0 v_~y$r_buff1_thd0~0_50) (= (select .cse0 |v_ULTIMATE.start_main_~#t2019~0.base_24|) 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_ULTIMATE.start_main_~#t2019~0.offset_19|) (= 0 v_~weak$$choice2~0_35) (= 0 v_~y$r_buff1_thd2~0_17) (= v_~y$mem_tmp~0_12 0) (= 0 |v_#NULL.base_3|) (= v_~y$w_buff1_used~0_66 0) (= v_~y$r_buff0_thd1~0_27 0) (= v_~main$tmp_guard1~0_13 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2019~0.base_24| 1) |v_#valid_45|) (= v_~y$r_buff0_thd2~0_21 0) (= v_~y$r_buff0_thd0~0_76 0) (= 0 v_~y$flush_delayed~0_17) (= 0 v_~__unbuffered_cnt~0_16) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t2019~0.offset=|v_ULTIMATE.start_main_~#t2019~0.offset_19|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_18|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_14|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ULTIMATE.start_main_~#t2020~0.base=|v_ULTIMATE.start_main_~#t2020~0.base_20|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_27, ~y$flush_delayed~0=v_~y$flush_delayed~0_17, #length=|v_#length_11|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_15|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_10|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_17|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_17|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_50, ~x~0=v_~x~0_11, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_17|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_14|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_16|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_12|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_20, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y~0=v_~y~0_29, ULTIMATE.start_main_~#t2019~0.base=|v_ULTIMATE.start_main_~#t2019~0.base_24|, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_14|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_10|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_~#t2020~0.offset=|v_ULTIMATE.start_main_~#t2020~0.offset_17|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_17|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_76, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2019~0.offset, ULTIMATE.start_main_#t~ite28, #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, ULTIMATE.start_main_~#t2020~0.base, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~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_#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, ~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_~#t2019~0.base, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t2020~0.offset, 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 07:36:10,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L779-1-->L781: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2020~0.base_11|) (= |v_ULTIMATE.start_main_~#t2020~0.offset_10| 0) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2020~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2020~0.base_11|) |v_ULTIMATE.start_main_~#t2020~0.offset_10| 1)) |v_#memory_int_7|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2020~0.base_11|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2020~0.base_11| 4) |v_#length_9|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2020~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t2020~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ULTIMATE.start_main_~#t2020~0.offset=|v_ULTIMATE.start_main_~#t2020~0.offset_10|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2020~0.base=|v_ULTIMATE.start_main_~#t2020~0.base_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t2020~0.offset, #length, ULTIMATE.start_main_~#t2020~0.base] because there is no mapped edge [2019-12-27 07:36:10,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] P0ENTRY-->L4-3: Formula: (and (= (mod v_~y$w_buff1_used~0_57 256) 0) (= 2 v_~y$w_buff0~0_16) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0~0_17 v_~y$w_buff1~0_16) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= 1 v_~y$w_buff0_used~0_91) (= v_~y$w_buff1_used~0_57 v_~y$w_buff0_used~0_92) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_92, ~y$w_buff0~0=v_~y$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_91, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} 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 07:36:10,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L756-2-->L756-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-427545153 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-427545153 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out-427545153| ~y$w_buff1~0_In-427545153) (not .cse0) (not .cse1)) (and (= ~y~0_In-427545153 |P1Thread1of1ForFork1_#t~ite9_Out-427545153|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-427545153, ~y$w_buff1~0=~y$w_buff1~0_In-427545153, ~y~0=~y~0_In-427545153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-427545153} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-427545153, ~y$w_buff1~0=~y$w_buff1~0_In-427545153, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-427545153|, ~y~0=~y~0_In-427545153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-427545153} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 07:36:10,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L756-4-->L757: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_19) 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_19} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 07:36:10,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In761379700 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In761379700 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out761379700| ~y$w_buff0_used~0_In761379700) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out761379700| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In761379700, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In761379700} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In761379700, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In761379700, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out761379700|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 07:36:10,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L758-->L758-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In421011999 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In421011999 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In421011999 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In421011999 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In421011999 |P1Thread1of1ForFork1_#t~ite12_Out421011999|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out421011999|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In421011999, ~y$w_buff0_used~0=~y$w_buff0_used~0_In421011999, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In421011999, ~y$w_buff1_used~0=~y$w_buff1_used~0_In421011999} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In421011999, ~y$w_buff0_used~0=~y$w_buff0_used~0_In421011999, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In421011999, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out421011999|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In421011999} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 07:36:10,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L759-->L759-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In2129338539 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In2129338539 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In2129338539 |P1Thread1of1ForFork1_#t~ite13_Out2129338539|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out2129338539|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2129338539, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2129338539} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2129338539, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2129338539, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out2129338539|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 07:36:10,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L760-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In814830342 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In814830342 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In814830342 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In814830342 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out814830342| 0)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out814830342| ~y$r_buff1_thd2~0_In814830342) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In814830342, ~y$w_buff0_used~0=~y$w_buff0_used~0_In814830342, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In814830342, ~y$w_buff1_used~0=~y$w_buff1_used~0_In814830342} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In814830342, ~y$w_buff0_used~0=~y$w_buff0_used~0_In814830342, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In814830342, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out814830342|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In814830342} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:36:10,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, 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_10, 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 07:36:10,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L737-->L737-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1804843728 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1804843728 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1804843728 |P0Thread1of1ForFork0_#t~ite5_Out1804843728|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1804843728|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1804843728, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1804843728} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1804843728|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1804843728, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1804843728} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:36:10,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L738-->L738-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-771288520 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-771288520 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-771288520 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-771288520 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-771288520| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-771288520| ~y$w_buff1_used~0_In-771288520) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-771288520, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-771288520, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-771288520, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-771288520} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-771288520|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-771288520, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-771288520, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-771288520, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-771288520} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:36:10,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L739-->L740: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In542517818 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In542517818 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out542517818 0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_Out542517818 ~y$r_buff0_thd1~0_In542517818) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In542517818, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In542517818} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In542517818, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out542517818|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out542517818} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:36:10,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2073044481 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In2073044481 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In2073044481 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In2073044481 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out2073044481|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In2073044481 |P0Thread1of1ForFork0_#t~ite8_Out2073044481|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2073044481, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2073044481, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2073044481, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2073044481} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2073044481, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2073044481, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2073044481|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2073044481, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2073044481} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:36:10,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, 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_7} 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 07:36:10,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [577] [577] L785-->L787-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~y$w_buff0_used~0_67 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_44 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 07:36:10,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-2-->L787-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-722771119 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-722771119 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite17_Out-722771119| |ULTIMATE.start_main_#t~ite18_Out-722771119|))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite17_Out-722771119| ~y~0_In-722771119) .cse2) (and (= |ULTIMATE.start_main_#t~ite17_Out-722771119| ~y$w_buff1~0_In-722771119) (not .cse1) (not .cse0) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-722771119, ~y~0=~y~0_In-722771119, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-722771119, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-722771119} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-722771119|, ~y$w_buff1~0=~y$w_buff1~0_In-722771119, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-722771119|, ~y~0=~y~0_In-722771119, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-722771119, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-722771119} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 07:36:10,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1585970452 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1585970452 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite19_Out1585970452|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1585970452 |ULTIMATE.start_main_#t~ite19_Out1585970452|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1585970452, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1585970452} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1585970452, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1585970452|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1585970452} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 07:36:10,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1832889970 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1832889970 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1832889970 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1832889970 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out1832889970|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite20_Out1832889970| ~y$w_buff1_used~0_In1832889970) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1832889970, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1832889970, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1832889970, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1832889970} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1832889970, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1832889970, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1832889970|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1832889970, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1832889970} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 07:36:10,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L790-->L790-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-770877899 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-770877899 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-770877899 |ULTIMATE.start_main_#t~ite21_Out-770877899|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out-770877899|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-770877899, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-770877899} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-770877899, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-770877899, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-770877899|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 07:36:10,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1194993246 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1194993246 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1194993246 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1194993246 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out-1194993246| ~y$r_buff1_thd0~0_In-1194993246)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-1194993246|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1194993246, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1194993246, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1194993246, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1194993246} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1194993246, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1194993246, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1194993246, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1194993246|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1194993246} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 07:36:10,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L800-->L800-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-392829936 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-392829936 256) 0))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In-392829936 256) 0)) (and .cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-392829936 256))) (= (mod ~y$w_buff0_used~0_In-392829936 256) 0))) .cse1 (= |ULTIMATE.start_main_#t~ite31_Out-392829936| |ULTIMATE.start_main_#t~ite32_Out-392829936|) (= ~y$w_buff1~0_In-392829936 |ULTIMATE.start_main_#t~ite31_Out-392829936|)) (and (= |ULTIMATE.start_main_#t~ite31_In-392829936| |ULTIMATE.start_main_#t~ite31_Out-392829936|) (= ~y$w_buff1~0_In-392829936 |ULTIMATE.start_main_#t~ite32_Out-392829936|) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-392829936, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-392829936, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-392829936, ~weak$$choice2~0=~weak$$choice2~0_In-392829936, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-392829936|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-392829936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-392829936} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-392829936, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-392829936, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-392829936, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-392829936|, ~weak$$choice2~0=~weak$$choice2~0_In-392829936, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-392829936|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-392829936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-392829936} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 07:36:10,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L803-->L804: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd0~0_66 v_~y$r_buff0_thd0~0_65)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_27} 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 07:36:10,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L806-->L809-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= v_~y~0_23 v_~y$mem_tmp~0_7) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~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 07:36:10,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 07:36:10,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:36:10 BasicIcfg [2019-12-27 07:36:10,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:36:10,767 INFO L168 Benchmark]: Toolchain (without parser) took 16631.42 ms. Allocated memory was 146.3 MB in the beginning and 768.6 MB in the end (delta: 622.3 MB). Free memory was 102.3 MB in the beginning and 473.5 MB in the end (delta: -371.2 MB). Peak memory consumption was 251.2 MB. Max. memory is 7.1 GB. [2019-12-27 07:36:10,768 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 07:36:10,769 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.12 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.1 MB in the beginning and 158.9 MB in the end (delta: -56.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:36:10,770 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.69 ms. Allocated memory is still 204.5 MB. Free memory was 158.9 MB in the beginning and 155.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 07:36:10,772 INFO L168 Benchmark]: Boogie Preprocessor took 50.58 ms. Allocated memory is still 204.5 MB. Free memory was 155.7 MB in the beginning and 153.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:36:10,773 INFO L168 Benchmark]: RCFGBuilder took 773.80 ms. Allocated memory is still 204.5 MB. Free memory was 153.7 MB in the beginning and 109.6 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:36:10,777 INFO L168 Benchmark]: TraceAbstraction took 14916.91 ms. Allocated memory was 204.5 MB in the beginning and 768.6 MB in the end (delta: 564.1 MB). Free memory was 109.0 MB in the beginning and 473.5 MB in the end (delta: -364.5 MB). Peak memory consumption was 199.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:36:10,788 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.19 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.12 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.1 MB in the beginning and 158.9 MB in the end (delta: -56.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.69 ms. Allocated memory is still 204.5 MB. Free memory was 158.9 MB in the beginning and 155.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.58 ms. Allocated memory is still 204.5 MB. Free memory was 155.7 MB in the beginning and 153.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 773.80 ms. Allocated memory is still 204.5 MB. Free memory was 153.7 MB in the beginning and 109.6 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14916.91 ms. Allocated memory was 204.5 MB in the beginning and 768.6 MB in the end (delta: 564.1 MB). Free memory was 109.0 MB in the beginning and 473.5 MB in the end (delta: -364.5 MB). Peak memory consumption was 199.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 146 ProgramPointsBefore, 81 ProgramPointsAfterwards, 180 TransitionsBefore, 94 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 8 FixpointIterations, 28 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 24 ChoiceCompositions, 3312 VarBasedMoverChecksPositive, 143 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54561 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t2019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L736] 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) [L756] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 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 [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 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 [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 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 [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 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 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 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, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 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) [L799] 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, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 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)) [L800] 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)) [L801] EXPR 0 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 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)) [L802] 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, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 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)) [L804] 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, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 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)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1410 SDtfs, 1428 SDslu, 3647 SDs, 0 SdLazy, 1926 SolverSat, 127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15582occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 10215 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 503 NumberOfCodeBlocks, 503 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 436 ConstructedInterpolants, 0 QuantifiedInterpolants, 106469 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...